Saturated Boolean Algebras With Ultrafilters
Žarko Mijajlović (1979)
Publications de l'Institut Mathématique
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.
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.
Displaying similar documents to “A short note on lattices allowing disjunctive reasoning.”
Saturated Boolean Algebras With Ultrafilters
Any orthomodular poset is a pasting of Boolean algebras
Vladimír Rogalewicz (1988)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Generalizations of Boolean algebras. An attribute exploration
Léonard Kwuida, Christian Pech, Heiko Reppe (2006)
Mathematica Slovaca
Similarity:
A construction in Boolean algebras
R. Kaufman (1968)
Colloquium Mathematicae
Similarity:
On a problem of Sikorski in the set representability of Boolean algebras
Robert Lagrange (1974)
Colloquium Mathematicae
Similarity:
The elementary-equivalence classes of clopen algebras of P-spaces
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.
On dense subsets of Boolean algebras
Roman Sikorski (1963)
Colloquium Mathematicae
Similarity:
Partial Boolean algebras in a broader sense and Boolean embeddings
Janusz Czelakowski (1981)
Colloquium Mathematicae
Similarity: