Displaying similar documents to “Join-semilattices with two-dimensional congruence amalgamation”

The graphs of join-semilattices and the shape of congruence lattices of particle lattices

Pavel Růžička (2017)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

We attach to each 0 , -semilattice S a graph G S whose vertices are join-irreducible elements of S and whose edges correspond to the reflexive dependency relation. We study properties of the graph G S both when S is a join-semilattice and when it is a lattice. We call a 0 , -semilattice S particle provided that the set of its join-irreducible elements satisfies DCC and join-generates S . We prove that the congruence lattice of a particle lattice is anti-isomorphic to the lattice of all hereditary...

On the special context of independent sets

Vladimír Slezák (2001)

Discussiones Mathematicae - General Algebra and Applications

Similarity:

In this paper the context of independent sets J L p is assigned to the complete lattice (P(M),⊆) of all subsets of a non-empty set M. Some properties of this context, especially the irreducibility and the span, are investigated.

Free trees and the optimal bound in Wehrung's theorem

Pavel Růžička (2008)

Fundamenta Mathematicae

Similarity:

We prove that there is a distributive (∨,0,1)-semilattice of size ℵ₂ such that there is no weakly distributive (∨,0)-homomorphism from C o n c A to with 1 in its range, for any algebra A with either a congruence-compatible structure of a (∨,1)-semi-lattice or a congruence-compatible structure of a lattice. In particular, is not isomorphic to the (∨,0)-semilattice of compact congruences of any lattice. This improves Wehrung’s solution of Dilworth’s Congruence Lattice Problem, by giving the best...

An extension method for t-norms on subintervals to t-norms on bounded lattices

Funda Karaçal, Ümit Ertuğrul, M. Nesibe Kesicioğlu (2019)

Kybernetika

Similarity:

In this paper, a construction method on a bounded lattice obtained from a given t-norm on a subinterval of the bounded lattice is presented. The supremum distributivity of the constructed t-norm by the mentioned method is investigated under some special conditions. It is shown by an example that the extended t-norm on L from the t-norm on a subinterval of L need not be a supremum-distributive t-norm. Moreover, some relationships between the mentioned construction method and the other...

Lattice-inadmissible incidence structures

Frantisek Machala, Vladimír Slezák (2004)

Discussiones Mathematicae - General Algebra and Applications

Similarity:

Join-independent and meet-independent sets in complete lattices were defined in [6]. According to [6], to each complete lattice (L,≤) and a cardinal number p one can assign (in a unique way) an incidence structure J L p of independent sets of (L,≤). In this paper some lattice-inadmissible incidence structures are founded, i.e. such incidence structures that are not isomorphic to any incidence structure J L p .

Diamond identities for relative congruences

Gábor Czédli (1995)

Archivum Mathematicum

Similarity:

For a class K of structures and A K let C o n * ( A ) resp. C o n K ( A ) denote the lattices of * -congruences resp. K -congruences of A , cf. Weaver [25]. Let C o n * ( K ) : = I { C o n * ( A ) : A K } where I is the operator of forming isomorphic copies, and C o n r ( K ) : = I { C o n K ( A ) : A K } . For an ordered algebra A the lattice of order congruences of A is denoted by C o n < ( A ) , and let C o n < ( K ) : = I { C o n < ( A ) : A K } if K is a class of ordered algebras. The operators of forming subdirect squares and direct products are denoted by Q s and P , respectively. Let λ be a lattice identity and let Σ be a set of lattice identities....

Dieudonné-type theorems for lattice group-valued k -triangular set functions

Antonio Boccuto, Xenofon Dimitriou (2019)

Kybernetika

Similarity:

Some versions of Dieudonné-type convergence and uniform boundedness theorems are proved, for k -triangular and regular lattice group-valued set functions. We use sliding hump techniques and direct methods. We extend earlier results, proved in the real case. Furthermore, we pose some open problems.

Hyperreflexivity of bilattices

Kamila Kliś-Garlicka (2016)

Czechoslovak Mathematical Journal

Similarity:

The notion of a bilattice was introduced by Shulman. A bilattice is a subspace analogue for a lattice. In this work the definition of hyperreflexivity for bilattices is given and studied. We give some general results concerning this notion. To a given lattice we can construct the bilattice Σ . Similarly, having a bilattice Σ we may consider the lattice Σ . In this paper we study the relationship between hyperreflexivity of subspace lattices and of their associated bilattices. Some examples...

Large semilattices of breadth three

Friedrich Wehrung (2010)

Fundamenta Mathematicae

Similarity:

A 1984 problem of S. Z. Ditor asks whether there exists a lattice of cardinality ℵ₂, with zero, in which every principal ideal is finite and every element has at most three lower covers. We prove that the existence of such a lattice follows from either one of two axioms that are known to be independent of ZFC, namely (1) Martin’s Axiom restricted to collections of ℵ₁ dense subsets in posets of precaliber ℵ₁, (2) the existence of a gap-1 morass. In particular, the existence of such a...