Journal ArticleOPEN ACCESS

Chains and antichains in Boolean algebras

Fundamenta Mathematicae (2000) 163(1) 55-76
DOI: 10.4064/fm-163-1-55-76
2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

We give an affirmative answer to problem DJ from Fremlin's list ([8]) which asks whether MAw1 implies that every uncountable Boolean algebra has an uncountable set of pairwise incomparable elements.

Cite

CITATION STYLE

APA

Losada, M., & Todorčevic, S. (2000). Chains and antichains in Boolean algebras. Fundamenta Mathematicae, 163(1), 55–76. https://doi.org/10.4064/fm-163-1-55-76

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free