Counterexamples in minimally generated Boolean algebras
Sabine Koppelberg (1988)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Boolean algebras in which every chain and antichain is countable”
Counterexamples in minimally generated Boolean algebras
Αll -dense sets of reals can be isomorphic
James Baumgartner (1973)
Fundamenta Mathematicae
Similarity:
Problems in Boolean algebras
R. Bonnet (1976)
Annales scientifiques de l'Université de Clermont. Mathématiques
Similarity:
A proof (involving Martin's axiom) of a partition relation
J. Baumgartner, A. Hajnal (1973)
Fundamenta Mathematicae
Similarity:
On Todorcevic orderings
Bohuslav Balcar, Tomáš Pazák, Egbert Thümmel (2015)
Fundamenta Mathematicae
Similarity:
The Todorcevic ordering 𝕋(X) consists of all finite families of convergent sequences in a given topological space X. Such an ordering was defined for the special case of the real line by S. Todorcevic (1991) as an example of a Borel ordering satisfying ccc that is not σ-finite cc and even need not have the Knaster property. We are interested in properties of 𝕋(X) where the space X is taken as a parameter. Conditions on X are given which ensure the countable chain condition and its...
Destroying precaliber : an application of a Δ-systems lemma for closed sets
Juris Steprans, Stephen Watson (1988)
Fundamenta Mathematicae
Similarity:
Maximal chains in atomic Boolean algebras
George Day (1970)
Fundamenta Mathematicae
Similarity:
On hereditary interval algebras.
Alami, M., Zhani, D. (2004)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Caliber (, ω) is not productive
Stephen Watson, Zhou Hao-Xuan (1990)
Fundamenta Mathematicae
Similarity: