Another note on countable Boolean algebras
Lutz Heindorf (1996)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
We prove that a Boolean algebra is countable iff its subalgebra lattice admits a continuous complementation.
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.
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.
Lutz Heindorf (1996)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
We prove that a Boolean algebra is countable iff its subalgebra lattice admits a continuous complementation.
B. Rotman (1972)
Fundamenta Mathematicae
Similarity:
Lutz Heindorf (1990)
Fundamenta Mathematicae
Similarity:
M. Stone (1945)
Fundamenta Mathematicae
Similarity:
Andrzej Hulanicki (1959)
Fundamenta Mathematicae
Similarity:
Jan van Mill (1984)
Fundamenta Mathematicae
Similarity:
R. Bonnet (1976)
Annales scientifiques de l'Université de Clermont. Mathématiques
Similarity: