Representation and distributivity of Boolean algebras
Roman Sikorski (1961)
Colloquium Mathematicum
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Roman Sikorski (1961)
Colloquium Mathematicum
Similarity:
Roman Sikorski (1950)
Fundamenta Mathematicae
Similarity:
Robert Lagrange (1974)
Colloquium Mathematicae
Similarity:
Paul R. Halmos (1954-1956)
Compositio Mathematica
Similarity:
Brian Wynne (2008)
Fundamenta Mathematicae
Similarity:
Two Boolean algebras are elementarily equivalent if and only if they satisfy the same first-order statements in the language of Boolean algebras. We prove that every Boolean algebra is elementarily equivalent to the algebra of clopen subsets of a normal P-space.
Roman Sikorski (1952)
Fundamenta Mathematicae
Similarity:
Žikica Perović (1988)
Publications de l'Institut Mathématique
Similarity:
Bernhard Banaschewski (1993)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
The functor taking global elements of Boolean algebras in the topos of sheaves on a complete Boolean algebra is shown to preserve and reflect injectivity as well as completeness. This is then used to derive a result of Bell on the Boolean Ultrafilter Theorem in -valued set theory and to prove that (i) the category of complete Boolean algebras and complete homomorphisms has no non-trivial injectives, and (ii) the category of frames has no absolute retracts.