Handbook of Boolean Algebras
James Donald Monk, Robert Bonnet, Sabine Koppelberg
Abstract
James Donald Monk, Robert Bonnet, Sabine Koppelberg
Abstract
Special Classes of Boolean Algebras: Superatomic Boolean Algebras (J. Roitman). Projective Boolean Algebras (S. Koppelberg). Countable Boolean Algebras (R.S. Pierce). Measure Algebras (D.H. Fremlin). Logical Questions: Decidable Extensions of the Theory of Boolean Algebras (M. Weese). Undecidable Extensions of the Theory of Boolean Algebras (M. Weese). Recursive Boolean Algebras (J.B. Remmel). Lindenbaum-Tarski Algebras (D. Myers). Boolean-Valued Models (T. Jech). Appendix on Set Theory (J.D. Monk). Chart of Topological Duality. Appendix on General Topology (B. Balcar, P. Simon). References. Bibliography. Index.
OpenAlex reports 336 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Special Classes of Boolean Algebras: Superatomic Boolean Algebras (J. Roitman). Projective Boolean Algebras (S. Koppelberg). Countable Boolean Algebras (R.S. Pierce). Measure Algebras (D.H. Fremlin). Logical Questions: Decidable Extensions of the Theory of Boolean Algebras (M. Weese). Undecidable Extensions of the Theory of Boolean Algebras (M. Weese). Recursive Boolean Algebras (J.B. Remmel). Lindenbaum-Tarski Algebras (D. Myers). Boolean-Valued Models (T. Jech). Appendix on Set Theory (J.D. Monk). Chart of Topological Duality. Appendix on General Topology (B. Balcar, P. Simon). References. Bibliography. Index.
Key concepts: Stone's representation theorem for Boolean algebras, Complete Boolean algebra, Boolean algebras canonically defined, Free Boolean algebra, Two-element Boolean algebra, Interior algebra, Mathematics, Undecidable problem