In a p-algebra L, for all x , y ∈ L : {\displaystyle x,y\in L:} 34
The set S(L) ≝ { x** | x ∈ L } is called the skeleton of L. S(L) is a ∧-subsemilattice of L and together with x ∪ y = (x∨y)** = (x* ∧ y*)* forms a Boolean algebra (the complement in this algebra is *).56 In general, S(L) is not a sublattice of L.7 In a distributive p-algebra, S(L) is the set of complemented elements of L.8
Every element x with the property x* = 0 (or equivalently, x** = 1) is called dense. Every element of the form x ∨ x* is dense. D(L), the set of all the dense elements in L is a filter of L.910 A distributive p-algebra is Boolean if and only if D(L) = {1}.11
Pseudocomplemented lattices form a variety; indeed, so do pseudocomplemented semilattices.12
A relative pseudocomplement of a with respect to b is a maximal element c such that a∧c≤b. This binary operation is denoted a→b. A lattice with the pseudocomplement for each two elements is called implicative lattice, or Brouwerian lattice. In general, an implicative lattice may not have a minimal element. If such a minimal element exists, then each pseudocomplement a* could be defined using relative pseudocomplement as a → 0.17
T.S. Blyth (2006). Lattices and Ordered Algebraic Structures. Springer Science & Business Media. Chapter 7. Pseudocomplementation; Stone and Heyting algebras. pp. 103–119. ISBN 978-1-84628-127-3. 978-1-84628-127-3 ↩
Clifford Bergman (2011). Universal Algebra: Fundamentals and Selected Topics. CRC Press. pp. 63–70. ISBN 978-1-4398-5129-6. 978-1-4398-5129-6 ↩
Balbes, Raymond; Horn, Alfred (September 1970). "Stone Lattices". Duke Math. J. 37 (3): 537–545. doi:10.1215/S0012-7094-70-03768-3. /wiki/Alfred_Horn ↩
Birkhoff, Garrett (1973). Lattice Theory (3rd ed.). AMS. p. 44. /wiki/Garrett_Birkhoff ↩