Finiteness conditions and distributive laws for Boolean algebras
✍ Scribed by Marcel Erné
- Publisher
- John Wiley and Sons
- Year
- 2009
- Tongue
- English
- Weight
- 141 KB
- Volume
- 55
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
✦ Synopsis
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 (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)
📜 SIMILAR VOLUMES
Some finiteness conditions for infinite dimensional coalgebras, particularly right or left semiperfect coalgebras, or co-Frobenius Hopf algebras are studied. As well, examples of co-Frobenius Hopf algebras are constructed via a Hopf algebra structure on an Ore extension of a group algebra, and it is
We consider algebras with one binary operation } and one generator (monogenic) and satisfying the left distributive law a } (b } c)=(a } b) } (a } c). One can define a sequence of finite left-distributive algebras A n , and then take a limit to get an infinite monogenic left-distributive algebra A .
NONSTANDARD METHODS AND FINITENESS CONDITIONS IN ALGEBRA by MATT INSALL in Rolla (Missouri)')
## Abstract We prove that all infinite Boolean rings (algebras) have the property __P__ ≠ __NP__ according to the digital (binary) nondeterminism.