Countable homogeneous Boolean algebras
The author determines the countable homogeneous Boolean algebras, where homogeneous is taken in its model-theoretic sense [e.g. {\S} 3.2 of \textit{C. C. Chang} and \textit{H. J. Keisler}, Model theory (1973; Zbl 0276.02032)]. The determination uses the three elementary invariants of a Boolean algebra ({\S} 5.5 of Chang-Keisler), and some further ones of a related character. It allows to characterize those homogeneous Boolean algebras that are strongly constructible in the sense of \textit{Yu. L. Ershov} [Decision problems and constructivizable models (Russian) (1980; Zbl 0495.03009)]. Finally, the author shows that certain cancellation laws such as: if \(A\times A\cong B\times B\) then \(A\cong B\), hold for countable homogeneous Boolean algebras, though they fail for arbitrary countable Boolean algebras as shown by \textit{J. Ketonen} [Ann. Math. (2) 108, 41--89 (1978; Zbl 0418.06006)].
- Recursive homogeneous Boolean algebras
- The Calkin algebra is not countably homogeneous
- Functional reducts of the countable homogeneous Boolean algebra
- scientific article; zbMATH DE number 996480 (Why is no real title available?)
- On countably closed complete Boolean algebras
- scientific article; zbMATH DE number 2154086 (Why is no real title available?)
- On the homogeneous countable Boolean contact algebra.
- A thin-tall Boolean algebra which is isomorphic to each of its uncountable subalgebras
- Functional reducts of the countable atomless Boolean algebra
- On the computability of ordered fields
- Cardinality and cofinality of homomorphs of products of Boolean algebras
This page was built for publication: Countable homogeneous Boolean algebras
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q793713)
