go-v.orgcodex
Menu
Page tools

codex · Philosophy

Complete Boolean algebra

In mathematics, a complete Boolean algebra is a Boolean algebra in which every subset has a supremum (least upper bound). Complete Boolean algebras are used to construct Boolean-valued models of set theory in the theory of forcing. Every Boolean algebra A has an essentially unique completion, which is a complete Boolean algebra containing A such that every element is the supremum of some subset of A. As a partially ordered set, this completion of A is the Dedekind–MacNeille completion. More generally, for some cardinal κ, a Boolean algebra is called κ-complete if every subset of cardinality less than or equal to κ has a supremum.

Wikipedia contributors, "Complete Boolean algebra", Wikipedia, revision 1360632589, retrieved 20 November 2026, source, CC BY-SA 4.0.

More Philosophy · Search the codex