Representing real numbers in denumerable Boolean algebras
William Hanf (1976)
Fundamenta Mathematicae
Similarity:
William Hanf (1976)
Fundamenta Mathematicae
Similarity:
R. Bonnet (1976)
Annales scientifiques de l'Université de Clermont. Mathématiques
Similarity:
Roman Sikorski (1961)
Colloquium Mathematicum
Similarity:
H. Mildenberg (1993)
Fundamenta Mathematicae
Similarity:
Using ♢ , we construct a rigid atomless Boolean algebra that has no uncountable antichain and that admits the elimination of the Malitz quantifier .
Roman Sikorski (1963)
Colloquium Mathematicae
Similarity:
Saul Kripke (1967)
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.