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.
Displaying similar documents to “Problems in Boolean algebras”
Another note on countable Boolean algebras
A rigid Boolean algebra that admits the elimination of Q21
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 .
Large Subalgebras of a Boolean Algebra
Slobodan Vujošević (1989)
Publications de l'Institut Mathématique
Similarity:
Separation properties and Boolean powers
Steven Garavaglia, J. M. Plotkin (1984)
Colloquium Mathematicae
Similarity:
Notes on unique solutions of boolean equations
D. Banković (1987)
Matematički Vesnik
Similarity:
Boolean algebras admitting a countable minimally acting group
Aleksander Błaszczyk, Andrzej Kucharski, Sławomir Turek (2014)
Open Mathematics
Similarity:
The aim of this paper is to show that every infinite Boolean algebra which admits a countable minimally acting group contains a dense projective subalgebra.
On proper subuniverses of a boolean algebra
Wroński, Stanisław (2015-10-26T10:14:52Z)
Acta Universitatis Lodziensis. Folia Mathematica
Similarity:
Representation and distributivity of Boolean algebras
Roman Sikorski (1961)
Colloquium Mathematicum
Similarity:
On Boolean modus ponens.
Sergiu Rudeanu (1998)
Mathware and Soft Computing
Similarity:
An abstract form of modus ponens in a Boolean algebra was suggested in [1]. In this paper we use the general theory of Boolean equations (see e.g. [2]) to obtain a further generalization. For a similar research on Boolean deduction theorems see [3].