Details
| Originalsprache | Englisch |
|---|---|
| Seiten (von - bis) | 572-586 |
| Seitenumfang | 15 |
| Fachzeitschrift | Mathematical logic quarterly |
| Jahrgang | 55 |
| Ausgabenummer | 6 |
| Publikationsstatus | Veröffentlicht - 17 Nov. 2009 |
Abstract
We compare diverse degrees of compactness and finiteness in Boolean algebras with each other and investigate the influence of weak choice principles. Our arguments rely on a discussion of infinitary distributive laws and generalized prime elements in Boolean algebras. In ZF set theory without choice, a Boolean algebra is Dedekind finite if and only if it satisfies the ascending chain condition. The Denumerable Subset Axiom (DS) implies finiteness of Boolean algebras with compact top, whereas the converse fails in ZF. Moreover, we derive from DS the atomicity of continuous Boolean algebras. Some of the results extend to more general structures like pseudocomplemented semilattices.
ASJC Scopus Sachgebiete
- Mathematik (insg.)
- Logik
Zitieren
- Standard
- Harvard
- Apa
- Vancouver
- BibTex
- RIS
in: Mathematical logic quarterly, Jahrgang 55, Nr. 6, 17.11.2009, S. 572-586.
Publikation: Beitrag in Fachzeitschrift › Artikel › Forschung › Peer-Review
}
TY - JOUR
T1 - Finiteness conditions and distributive laws for Boolean algebras
AU - Erné, Marcel
PY - 2009/11/17
Y1 - 2009/11/17
N2 - We compare diverse degrees of compactness and finiteness in Boolean algebras with each other and investigate the influence of weak choice principles. Our arguments rely on a discussion of infinitary distributive laws and generalized prime elements in Boolean algebras. In ZF set theory without choice, a Boolean algebra is Dedekind finite if and only if it satisfies the ascending chain condition. The Denumerable Subset Axiom (DS) implies finiteness of Boolean algebras with compact top, whereas the converse fails in ZF. Moreover, we derive from DS the atomicity of continuous Boolean algebras. Some of the results extend to more general structures like pseudocomplemented semilattices.
AB - We compare diverse degrees of compactness and finiteness in Boolean algebras with each other and investigate the influence of weak choice principles. Our arguments rely on a discussion of infinitary distributive laws and generalized prime elements in Boolean algebras. In ZF set theory without choice, a Boolean algebra is Dedekind finite if and only if it satisfies the ascending chain condition. The Denumerable Subset Axiom (DS) implies finiteness of Boolean algebras with compact top, whereas the converse fails in ZF. Moreover, we derive from DS the atomicity of continuous Boolean algebras. Some of the results extend to more general structures like pseudocomplemented semilattices.
KW - ℳ-distributive
KW - ℳ-prime
KW - Atomistic lattice
KW - Boolean algebra
KW - Chain condition
KW - Compact
KW - Continuous lattice
KW - Dedekind finite
KW - Pseudocomplemented
UR - http://www.scopus.com/inward/record.url?scp=76749097194&partnerID=8YFLogxK
U2 - 10.1002/malq.200810034
DO - 10.1002/malq.200810034
M3 - Article
AN - SCOPUS:76749097194
VL - 55
SP - 572
EP - 586
JO - Mathematical logic quarterly
JF - Mathematical logic quarterly
SN - 0942-5616
IS - 6
ER -