Counterexamples in minimally generated Boolean algebras
Sabine Koppelberg (1988)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
Sabine Koppelberg (1988)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
B. Rotman (1972)
Fundamenta Mathematicae
Similarity:
Lutz Heindorf (1996)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
We prove that a Boolean algebra is countable iff its subalgebra lattice admits a continuous complementation.
Roman Sikorski (1952)
Fundamenta Mathematicae
Similarity:
H. Gonshor (1978)
Fundamenta Mathematicae
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.
Paul Iverson (1991)
Colloquium Mathematicae
Similarity:
There is a conjecture of Vaught [17] which states: Without The Generalized Continuum Hypothesis one can prove the existence of a complete theory with exactly nonisomorphic, denumerable models. In this paper we show that there is no such theory in the class of complete extensions of the theory of Boolean algebras. More precisely, any complete extension of the theory of Boolean algebras has either 1 or nonisomorphic, countable models. Thus we answer this conjecture in the negative...