scholarly journals Coproducts of Distributive Lattice based Algebras

10.29007/vx1v ◽  
2018 ◽  
Author(s):  
Leonardo Manuel Cabrer ◽  
Hilary Priestley
Keyword(s):  
Distributive Lattice ◽  
Systematic Study ◽  
Distributive Lattices ◽  
Finitely Generated ◽  
Cartesian Products

The analysis of coproducts in varieties of algebras has generally been variety-specific, relying on tools tailored to particular classes of algebras. A recurring theme, however, is the use of a categorical duality. Among the dualities and topological representations in the literature, natural dualities are particularly well behaved with respect to coproduct. Since (multisorted) natural dualities are based on hom-functors, they send coproducts into cartesian products.We carry out a systematic study of coproducts for finitely generated quasivarieties A that admit a (term) reduct in the variety D of bounded distributive lattices.

scholarly journals Finitely generated pseudocomplemented distributive lattices

1975 ◽  
Vol 19 (2) ◽  
pp. 238-246 ◽  
Author(s):  
J. Berman ◽  
ph. Dwinger
Keyword(s):  
Distributive Lattice ◽  
Partially Ordered Set ◽  
Ordered Set ◽  
Distributive Lattices ◽  
Basic Fact ◽  
Finitely Generated ◽  
Partially Ordered ◽  
Finite Set ◽  
Natural Way

If L is a pseudocomplemented distributive lattice which is generated by a finite set X, then we will show that there exists a subset G of L which is associated with X in a natural way that ¦G¦ ≦ ¦X¦ + 2¦x¦ and whose structure as a partially ordered set characterizes the structure of L to a great extent. We first prove in Section 2 as a basic fact that each element of L can be obtained by forming sums (joins) and products (meets) of elements of G only. Thus, L considered as a distributive lattice with 0,1 (the operation of pseudocomplementation deleted), is generated by G. We apply this to characterize for example, the maximal homomorphic images of L in each of the equational subclasses of the class Bω of pseudocomplemented distributive lattices, and also to find the conditions which have to be satisfied by G in order that X freely generates L.

scholarly journals The Central Decomposition of FD01(n)

Order ◽  
2021 ◽  
Author(s):  
Peter Köhler
Keyword(s):  
Distributive Lattices ◽  
Finitely Generated ◽  
Finite Distributive Lattices

AbstractThe paper presents a method of composing finite distributive lattices from smaller pieces and applies this to construct the finitely generated free distributive lattices from appropriate Boolean parts.

Congruence relations on almost distributive lattices-II

2019 ◽  
pp. 2150005
Author(s):  
Gezahagne Mulat Addis
Keyword(s):  
Distributive Lattice ◽  
Congruence Relation ◽  
Congruence Class ◽  
Distributive Lattices ◽  
Ideal Formula ◽  
Congruence Relations

For a given ideal [Formula: see text] of an almost distributive lattice [Formula: see text], we study the smallest and the largest congruence relation on [Formula: see text] having [Formula: see text] as a congruence class.

scholarly journals Weak LI-ideals in implicative almost distributive lattices

2021 ◽  
Vol 14 (3) ◽  
pp. 207-217
Author(s):  
Tilahun Mekonnen Munie
Keyword(s):  
Distributive Lattice ◽  
Research Area ◽  
Distributive Lattices ◽  
Lattice Implication Algebra ◽  
Implication Algebra ◽  
New Development

In the field of many valued logic, lattice valued logic (especially ideals) plays an important role. Nowadays, lattice valued logic is becoming a research area. Researchers introduced weak LI-ideals of lattice implication algebra. Furthermore, other scholars researched LI-ideals of implicative almost distributive lattice. Therefore, the target of this paper was to investigate new development on the extension of LI-ideal theories and properties in implicative almost distributive lattice. So, in this paper, the notion of weak LI-ideals and maximal weak LI- ideals of implicative almost distributive lattice are defined. The properties of weak LI- ideals in implicative almost distributive lattice are studied and several characterizations of weak LI-ideals are given. Relationship between weak LI-ideals and weak filters are explored. Hence, the extension properties of weak LI-ideal of lattice implication algebra to that of weak LI-ideal of implicative almost distributive lattice were shown.

scholarly journals On some varieties of ai-semirings satisfying xp+1 ≈ x

2018 ◽  
Vol 16 (1) ◽  
pp. 913-923
Author(s):  
Aifa Wang ◽  
Yong Shao
Keyword(s):  
Distributive Lattice ◽  
Finitely Based ◽  
Finitely Generated ◽  
Lattice Of Subvarieties

AbstractThe aim of this paper is to study the lattice of subvarieties of the ai-semiring variety defined by the additional identities$$\begin{array}{} \displaystyle x^{p+1}\approx x\,\,\mbox{and}\,\,zxyz\approx(zxzyz)^{p}zyxz(zxzyz)^{p}, \end{array} $$wherepis a prime. It is shown that this lattice is a distributive lattice of order 179. Also, each member of this lattice is finitely based and finitely generated.

On the Partially Ordered Set of Prime Ideals of a Distributive Lattice

1971 ◽  
Vol 23 (5) ◽  
pp. 866-874 ◽  
Author(s):  
Raymond Balbes
Keyword(s):  
Distributive Lattice ◽  
Partially Ordered Set ◽  
Ordered Set ◽  
Complete Characterization ◽  
Distributive Lattices ◽  
Prime Ideals ◽  
Partially Ordered ◽  
Irreducible Elements

For a distributive lattice L, let denote the poset of all prime ideals of L together with ∅ and L. This paper is concerned with the following type of problem. Given a class of distributive lattices, characterize all posets P for which for some . Such a poset P will be called representable over. For example, if is the class of all relatively complemented distributive lattices, then P is representable over if and only if P is a totally unordered poset with 0, 1 adjoined. One of our main results is a complete characterization of those posets P which are representable over the class of distributive lattices which are generated by their meet irreducible elements. The problem of determining which posets P are representable over the class of all distributive lattices appears to be very difficult.

Finite Projective Distributive Lattices

1970 ◽  
Vol 13 (1) ◽  
pp. 139-140 ◽  
Author(s):  
G. Grätzer ◽  
B. Wolk
Keyword(s):  
Distributive Lattice ◽  
Free Algebra ◽  
Distributive Lattices ◽  
Free Algebras ◽  
Algebra Ii

The theorem stated below is due to R. Balbes. The present proof is direct; it uses only the following two well-known facts: (i) Let K be a category of algebras, and let free algebras exist in K; then an algebra is projective if and only if it is a retract of a free algebra, (ii) Let F be a free distributive lattice with basis {xi | i ∊ I}; then ∧(xi | i ∊ J0) ≤ ∨(xi | i ∊ J1) implies J0∩J1≠ϕ. Note that (ii) implies (iii): If for J0 ⊆ I, a, b ∊ F, ∧(xi | i ∊ J0)≤a ∨ b, then ∧ (xi | i ∊ J0)≤ a or b.

scholarly journals Varieties of distributive lattices with unary operations I

1997 ◽  
Vol 63 (2) ◽  
pp. 165-207 ◽  
Author(s):  
H. A. Priestley
Keyword(s):  
Duality Theory ◽  
Algebraic Logic ◽  
Distributive Lattices ◽  
Ordered Semigroup ◽  
Finitely Generated ◽  
Left Multiplication ◽  
Unified Study

AbstractA unified study is undertaken of finitely generated varieties HSP () of distributive lattices with unary operations, extending work of Cornish. The generating algebra () is assusmed to be of the form (P; ∧, ∨, 0, 1, {fμ}), where each fμ is an endomorphism or dual endomorphism of (P; ∧, ∨, 0, 1), and the Priestly dual of this lattice is an ordered semigroup N whose elements act by left multiplication to give the maps dual to the operations fμ. Duality theory is fully developed within this framework, into which fit many varieties arising in algebraic logic. Conditions on N are given for the natural and Priestley dualities for HSP () to be essentially the same, so that, inter alia, coproducts in HSP () are enriched D-coproducts.

Metrizability Conditions for Completely Distributive Lattices

1983 ◽  
Vol 26 (4) ◽  
pp. 446-453
Author(s):  
G. Gierz ◽  
J. D. Lawson ◽  
A. R. Stralka
Keyword(s):  
Distributive Lattice ◽  
Essential Extension ◽  
Distributive Lattices ◽  
Interval Topology ◽  
Completely Distributive ◽  
Countable Chain ◽  
Completely Distributive Lattice

AbstractA lattice is said to be essentially metrizable if it is an essential extension of a countable lattice. The main result of this paper is that for a completely distributive lattice the following conditions are equivalent: (1) the interval topology on L is metrizable, (2) L is essentially metrizable, (3) L has a doubly ordergenerating sublattice, (4) L is an essential extension of a countable chain.

scholarly journals Congruences on a Distributive Lattice

1954 ◽  
Vol 10 (2) ◽  
pp. 76-77
Author(s):  
H. A. Thueston
Keyword(s):  
Distributive Lattice ◽  
Lattice Theory ◽  
Distributive Lattices ◽  
The Subject ◽  
The Many ◽  
Finite Distributive Lattices

Among the many papers on the subject of lattices I have not seen any simple discussion of the congruences on a distributive lattice. It is the purpose of this note to give such a discussion for lattices with a certain finiteness. Any distributive lattice is isomorphic with a ring of sets (G. Birkhoff, Lattice Theory, revised edition, 1948, p. 140, corollary to Theorem 6); I take the case where the sets are finite. All finite distributive lattices are covered by this case.

Sign in / Sign up

Export Citation Format

Share Document