Free Boolean algebras over unions of two well orderings
Abstract
Given a partially ordered set P there exists the most general Boolean algebra F(P) which contains P as a generating set, called the free Boolean algebra over P. We study free Boolean algebras over posets of the form P=P0 P1, where P0,P1 are well orderings. We call them nearly ordinal algebras. Answering a question of Maurice Pouzet, we show that for every uncountable cardinal there are 2 pairwise non-isomorphic nearly ordinal algebras of cardinality . Topologically, free Boolean algebras over posets correspond to compact 0-dimensional distributive lattices. In this context, we classify all closed sublattices of the product (ω1+1)×(ω1+1), thus showing that there are only 1 many of them. In contrast with the last result, we show that there are 21 topological types of closed subsets of the Tikhonov plank (ω1+1)×(ω+1).
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.