Pseudo-galois Extensions of Boolean Algebras
Radical classes of generalized Boolean algebras
Refinement Monoids, Vaught Monoids, and Boolean Algebras.
Relative Pseudo-Complements, Join-Extensions, and Meet-Retractions.
Remarks on measurable Boolean algebras and sequential cardinals
The paper offers a generalization of Kalton-Roberts' theorem on uniformly exhaustive Maharam's submeasures to the case of arbitrary sequentially continuous functionals. Applying the result one can reduce the problem of measurability of sequential cardinals to the question whether sequentially continuous functionals are uniformly exhaustive.
Remarks on powers of lattices
Representation theorem for finite quasi-boolean algebras
Representing free Boolean algebras
Partitioner algebras are defined in [2] and are natural tools for studying the properties of maximal almost disjoint families of subsets of ω. In this paper we investigate which free algebras can be represented as partitioner algebras or as subalgebras of partitioner algebras. In so doing we answer a question raised in [2] by showing that the free algebra with generators is represented. It was shown in [2] that it is consistent that the free Boolean algebra of size continuum is not a subalgebra...
Representing real numbers in denumerable Boolean algebras
Residuation Theory (Book Review by R. McFadden.
Rigid Boolean Algebras
Sacks forcing collapses to
We shall prove that Sacks algebra is nowhere -distributive, which implies that Sacks forcing collapses to .
Semi-Boolean algebras and their applications to intuitionistic logic with dual operations
Sheaf Spaces and Sheaves of Universal Algebras.
Simultaneous strategies and Boolean games of uncountable length
Some Classes of Projective Boolean Algebras.
Some recent results on Cohen algebras
Some remarks on Post algebras
Stone Lattices
The article continues the formalization of the lattice theory (as structures with two binary operations, not in terms of ordering relations). In the paper, the notion of a pseudocomplement in a lattice is formally introduced in Mizar, and based on this we define the notion of the skeleton and the set of dense elements in a pseudocomplemented lattice, giving the meet-decomposition of arbitrary element of a lattice as the infimum of two elements: one belonging to the skeleton, and the other which...
Strongly retractive Boolean algebras