1982•Transactions of the American Mathematical SocietyOpen access

Independent Families in Complete Boolean Algebras

B. Balcar, F. Franek

Open full text 20 citations

Abstract

We present a proof (without any set-theoretical assumptions) that every infinite complete Boolean algebra includes a free subalgebra of the same cardinality. It follows that the set of all ultrafilters on an infinite complete Boolean algebra $B$ has power $2^{|B|}$.

Open-access reader

About this research paper

What this paper is about

We present a proof (without any set-theoretical assumptions) that every infinite complete Boolean algebra includes a free subalgebra of the same cardinality. It follows that the set of all ultrafilters on an infinite complete Boolean algebra $B$ has power $2^{|B|}$.

Why it matters

OpenAlex reports 20 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

We present a proof (without any set-theoretical assumptions) that every infinite complete Boolean algebra includes a free subalgebra of the same cardinality. It follows that the set of all ultrafilters on an infinite complete Boolean algebra $B$ has power $2^{|B|}$.

Key concepts: Complete Boolean algebra, Boolean algebras canonically defined, Mathematics, Stone's representation theorem for Boolean algebras, Free Boolean algebra, Two-element Boolean algebra, Subalgebra, Cardinality (data modeling)

Related papers

Back to paper searchBrowse research topicsOriginal source
Independent Families in Complete Boolean Algebras — Research Paper | ScholarLens