Equational Classes of Distributive Pseudo-Complemented Lattices

1970 ◽  
Vol 22 (4) ◽  
pp. 881-891 ◽  
Author(s):  
K. B. Lee

A pseudo-complemented lattice is a lattice L with zero such that for every a ∊ L there exists a* ∊ L such that, for all x ∊ L, a ∧ x = 0 if and only if x ≦ a*. a* is called a pseudo-complement of a. It is clear that for each element a of a pseudo-complemented lattice L, a* is uniquely determined by a. Thus * can be regarded as a unary operation on L. Moreover, each pseudo-complemented lattice contains the unit, namely 0*. It follows that every pseudo-complemented lattice L can be regarded as an algebra (L; (∧, ∨, *, 0, 1)) of type (2, 2, 1, 0, 0). In this paper, we consider only distributive pseudo-complemented lattices. For simplicity, we call such a lattice a p-algebra.

2018 ◽  
Vol 68 (4) ◽  
pp. 713-716
Author(s):  
Ivan Chajda ◽  
Helmut Länger ◽  
Ranganathan Padmanabhan

Abstract In this note we characterize Boolean algebras among lattices of type (2, 2, 1) with join, meet and an additional unary operation by means of single two-variable respectively three-variable identities. In particular, any uniquely complemented lattice satisfying any one of these equational constraints is distributive and hence a Boolean algebra.


2004 ◽  
Vol 47 (2) ◽  
pp. 191-205 ◽  
Author(s):  
G. Grätzer ◽  
E. T. Schmidt

AbstractThe congruences of a finite sectionally complemented lattice L are not necessarily uniform (any two congruence classes of a congruence are of the same size). To measure how far a congruence Θ of L is from being uniform, we introduce Spec Θ, the spectrum of Θ, the family of cardinalities of the congruence classes of Θ. A typical result of this paper characterizes the spectrum S = (mj | j < n) of a nontrivial congruence Θ with the following two properties:


1988 ◽  
Vol 30 (2) ◽  
pp. 137-143 ◽  
Author(s):  
T. S. Blyth ◽  
J. C. Varlet

Recently we introduced the notion of an MS-algebra as a common abstraction of a de Morgan algebra and a Stone algebra [2]. Precisely, an MS-algebra is an algebra 〈L; ∧, ∨ ∘, 0, 1〉 of type 〈2, 2, 1, 0, 0〉 such that 〈L; ∧, ∨, 0, 1〉 is a distributive lattice with least element 0 and greatest element 1, and x → x∘ is a unary operation such that x ≤ x∘∘, (x ∧ y)∘ = x∘ ∨ y∘ and 1∘ = 0. It follows that ∘ is a dual endomorphism of L and that L∘∘ = {x∘∘ x ∊ L} is a subalgebra of L that is called the skeleton of L and that belongs to M, the class of de Morgan algebras. Clearly, theclass MS of MS-algebras is equational. All the subvarieties of MS were described in [3]. The lattice Λ (MS) of subvarieties of MS has 20 elements (see Fig. 1) and its non-trivial part (we exclude T, the class of one-element algebras) splits into the prime filter generated by M, that is [M, M1], the prime ideal generated by S, that is [B, S], and the interval [K, K2 ∨ K3].


1989 ◽  
Vol 31 (1) ◽  
pp. 1-16 ◽  
Author(s):  
T. S. Blyth ◽  
A. S. A. Noor ◽  
J. C. Varlet

An MS-algebra is an algebra (L; ∨, ∧, ∘, 0, 1) of type (2, 2, 1, 0, 0) such that (L; ∨, ∧, 0, 1) is a distributive lattice with smallest element 0 and greatest element 1, and x ↦ x∘ is a unary operation such that l∘ = 0, x ≤ x∘∘ for all x ∈ L, and (x ∧ y)∘ = x∘ ∨ y∘ for all x, y ∈ L. These algebras belong to the class of Ockham algebras introduced by Berman [3]; see also [2,10,15]. A double MS-algebra is an algebra (L, ∨, ∧, ∘, +, 0, 1) of type (2, 2, 1, 1, 0, 0) such that (L, ∘) and (Ld, +) are MS-algebras, where Ld denotes the dual of L, and the operations ∘, + are linked by the identities x∘+ = x∘∘ and x+∘ = x++. We refer to [5, 6, 7, 8] for the basic properties of MS-algebras and double MS-algebras. Concerning the latter, the properties x∘∘∘ = x∘, x+++ = x+, and x∘ ≤ x+will be used frequently. The class of double MS-algebras is congruencedistributive and consequently the results of [13] can be applied. As to general results in lattice theory and universal algebra, the reader may consult [1, 9, 12].


2001 ◽  
Vol 120 (5) ◽  
pp. A314-A314
Author(s):  
K HADERSLEV ◽  
P JEPPESEN ◽  
B HARTMANN ◽  
J THULESEN ◽  
J GRAFF ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document