Boolean algebra

Lattice that models the classical propositional logic

EntityQ4973304

Also known as Boolean lattice · Boolean ring

Subclass of: orthomodular lattice
, distributive lattice
, Heyting algebra
+1 more

Overview

From Wikipedia, the free encyclopedia · Read full article · Text CC BY-SA 4.0

In mathematics, a Boolean algebra or Boolean lattice is a complemented distributive lattice. This type of algebraic structure captures essential properties of both set operations and logic operations. A Boolean algebra can be seen as a generalization of a power set algebra or a field of sets, or its elements can be viewed as generalized truth values. It is also a special case of a De Morgan algebra and a Kleene algebra.

Overview

All data

21 statements · 5% with external sources · numbers in brackets are citations

Named after: George Boole
Studied by: Boolean algebra
lattice theory
commutative algebra
Permanent duplicated item: Robbins algebra
Different from: Boolean algebra
Said to be the same as: Boolean ring criterion used: isomorphism of categories
Stone space criterion used: dual equivalence

On other databases

10 identifiers linking Boolean algebra across the web's reference databases

Data quality

statements

externally sourced

Source last edited September 8, 2026. AIDB refreshes this page daily.

Suggest a fact or correction

Links

Use this data

curl https://aidb.si/api/v1/entities/Q4973304

API docs, limits & keys

Cite this page

AIDB. (2026). Boolean algebra (Q4973304). Retrieved from https://aidb.si/e/boolean-algebra-Q4973304