Embeddings into the countable atomless Boolean algebra

Abstract

We prove that there is a lattice embedded from every countable distributive lattice into the Boolean algebra of computable subsets of N. Along the way, we discuss all relevant results about lattices, Boolean algebras and embeddings between them.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…