Functional reducts of Boolean algebras
Abstract
In this paper we classify some special reducts of the countable atomless Boolean algebra which we call functional reducts. We prove that there are exactly 13 such structures up to first order interdefinability.
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.