Math 2.0

Order, lattices, ordered algebraic structures Distributive lattices Concept

Stone algebra

Summary

A Stone algebra is a bounded distributive lattice in which every element aa has a pseudocomplement a∗a^* and a∗∨a∗∗=1a^* \vee a^{**} = 1 holds. The identity a∗∨a∗∗=1a^* \vee a^{**} = 1 is called the Stone identity. Every Boolean algebra is a Stone algebra, and so is every bounded chain. Stone algebras lie between Boolean algebras and general pseudocomplemented distributive lattices.

Further reading

  1. Web https://en.wikipedia.org/wiki/Stone_algebra
About this page
TagESYKDNZF8E
URIm2://ESYKDNZF8E
Kindconcept
WritingW0 stub
MSC06D15
SpecializesDistributive lattice
Same as
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Definitions