Abstract
Isomorphism types of countable homogeneous Boolean algebras are described in [1], in which too is settled the question of whether such algebras are decidable. Precisely, a countable homogeneous Boolean algebra has a decidable presentation iff the set by which an isomorphism type of that algebra is characterized belongs to a class \(Pi_2^0 \) of the arithmetic hierarchy. The problem of obtaining a characterization for homogeneous Boolean algebras which have a recursive presentation remained open. Partially, here we resolve this problem, viz., estimate an exact upper and an exact lower bounds for the set which an isomorphism type of such any algebra is characterized by in terms of the Feiner hierarchy.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
A. S. Morozov, “Countable homogeneous Boolean algebras,” Algebra Logika, 21, No. 3, 269-282 (1982).
L. Feiner, “Hierarchies of Boolean algebras,” J. Symb. Logic, 35, No. 3, 365-373 (1970).
S. P. Odintsov and V. L. Selivanov, “Arithmetic hierarchy and ideals of enumerated Boolean algebras,” Sib. Mat. Zh., 30, No. 6, 140-149 (1989).
S. Yu. Podzorov, “Arithmetic complexity of first-order definable subsets of recursive Boolean algebras,” Sib. Adv. Math., 8, No. 1, 141-150 (1998).
S. S. Goncharov, Countable Boolean Algebras and Decidability [in Russian], Nauch. Kniga, Novosibirsk (1996).
H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York (1967).
A. H. Lachlan, “On the lattice of recursively enumerable sets,” Trans. Am. Math. Soc., 130, No. 1, 1-37 (1968).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Podzorov, S.Y. Recursive Homogeneous Boolean Algebras. Algebra and Logic 40, 96–105 (2001). https://doi.org/10.1023/A:1010260804894
Issue Date:
DOI: https://doi.org/10.1023/A:1010260804894