The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Page 1 Next

Displaying 1 – 20 of 204

Showing per page

A characterization of complete atomic Boolean algebra.

Francesc Esteva (1977)

Stochastica

In this note we give a characterization of complete atomic Boolean algebras by means of complete atomic lattices. We find that unicity of the representation of the maximum as union of atoms and Lambda-infinite distributivity law are necessary and sufficient conditions for the lattice to be a complete atomic Boolean algebra.

A forcing construction of thin-tall Boolean algebras

Juan Martínez (1999)

Fundamenta Mathematicae

It was proved by Juhász and Weiss that for every ordinal α with 0 < α < ω 2 there is a superatomic Boolean algebra of height α and width ω. We prove that if κ is an infinite cardinal such that κ < κ = κ and α is an ordinal such that 0 < α < κ + + , then there is a cardinal-preserving partial order that forces the existence of a superatomic Boolean algebra of height α and width κ. Furthermore, iterating this forcing through all α < κ + + , we obtain a notion of forcing that preserves cardinals and such that in the corresponding generic...

A groupoid characterization of Boolean algebras

Ivan Chajda (2004)

Discussiones Mathematicae - General Algebra and Applications

We present a groupoid which can be converted into a Boolean algebra with respect to term operations. Also conversely, every Boolean algebra can be reached in this way.

A note on Boolean algebras

Isaac Gorelic (1994)

Commentationes Mathematicae Universitatis Carolinae

We show that splitting of elements of an independent family of infinite regular size will produce a full size independent set.

Another note on countable Boolean algebras

Lutz Heindorf (1996)

Commentationes Mathematicae Universitatis Carolinae

We prove that a Boolean algebra is countable iff its subalgebra lattice admits a continuous complementation.

Currently displaying 1 – 20 of 204

Page 1 Next