Math 2.0

Order, lattices, ordered algebraic structures Boolean algebras Concept

Generalized Boolean algebra

Summary

A generalized Boolean algebra is a distributive lattice with a least element 00 in which any two elements aa and bb have a difference a∖ba \setminus b. This difference is the complement of a∧ba \wedge b in the interval [0,a][0, a]. It is a Boolean algebra that may lack a greatest element. Each interval [0,a][0, a] in it is a Boolean algebra. Generalized Boolean algebras correspond to Boolean rings that need not have a unit, in the same way as Boolean algebras correspond to Boolean rings.

Further reading

  1. Web https://en.wikipedia.org/wiki/Boolean_algebra_(structure)
About this page
TagZK1MHTQGS9
URIm2://ZK1MHTQGS9
Kindconcept
WritingW0 stub
MSC06E75, 06E20
SpecializesDistributive lattice

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