Functional reducts of Boolean algebras

2015/06/03 by Bodor, Bertalan, Kalina, Kende, Szabó, Csaba
#FOS: Mathematics #Logic (math.LO)

paper · doi:10.48550/arxiv.1506.01314

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.

Related

• Notes on countably generated complete Boolean algebras
• A complete Boolean algebra that has no proper atomless complete subalgebra
• Oscillating subalgebras of the atomless countable Boolean algebra
• The reducts of equality up to primitive positive interdefinability
• Embeddings into the countable atomless Boolean algebra