Abstract
We obtain exact estimates for the algorithmic complexity for the classes of strongly constructivizable computable models autostable relative to strong constructivizations and belonging to the following natural classes: Boolean algebras, distributive lattices, rings, commutative semigroups, and partial orders.
Similar content being viewed by others
References
Goncharov S. S. and Knight J. F., “Computable structure and non-structure theorems,” Algebra and Logic, 41, No. 6, 351–373 (2002).
Ershov Yu. L. and Goncharov S. S., Constructive Models, Ser. Siberian School of Algebra and Logic, Kluwer Academic/Plenum Publishers, New York, etc. (2000).
Ash C. J. and Knight J. F., Computable Structures and the Hyperarithmetical Hierarchy, Elsevier, Amsterdam (2000) (Stud. Logic Found. Math.; V. 144).
Nurtazin A. T., Computable Classes and Algebraic Criteria of Autostability [in Russian], Dis. Kand. Fiz.-Mat. Nauk, Inst. Mat. Mekh., Alma-Ata (1974).
Goncharov S. S. and Marchuk M. I., “Index sets of constructive models of bounded signature which are autostable relative to strong constructivizations,” Algebra and Logic (to be published).
Goncharov S. S. and Marchuk M. I., “Index sets of constructive models of finite signature and graph signature which are autostable relative to strong constructivizations,” Algebra and Logic (to be published).
Goncharov S. S. and Marchuk M. I., “Index sets of autostable relative to strong constructivizations constructive models,” Vestnik NGU. Ser. Mat. Mekh. Inform., 13, No. 4, 43–67 (2013).
Marker D., “Non Σn axiomatizable almost strongly minimal theories,” J. Symbolic Logic, 54, No. 3, 921–927 (1989).
Goncharov S. S. and Khoussainov B., “Complexity of theories of computable categorical models,” Algebra and Logic, 43, No. 6, 365–373 (2004).
Ash C. J. and Knight J. F., “Pairs of recursive structures,” Ann. Pure Appl. Logic, 46, No. 3, 211–234 (1990).
Goncharov S. S., Countable Boolean Algebras and Decidability [in Russian], Nauchnaya Kniga, Novosibirsk (1996).
Chang C. C. and Keisler H. J., Model Theory, North-Holland, Amsterdam and London (1973).
Nurtazin A. T., “Strong and weak constructivization and computable families,” Algebra and Logic, 13, No. 3, 177–184 (1974).
Rogers H., Theory of Recursive Functions and Effective Computability, McGraw-Hill Book Comp., New York, St. Louis, San Francisco, Toronto, London, and Sydney (1972).
Tarski A., “Arithmetical classes and types of Boolean algebras,” Bull. Amer. Math. Soc., 55, 63 (1949).
Ershov Yu. L., “Decidability of the elementary theory of distributive structures with relative complements and the theory of filters,” Algebra i Logika, 3, No. 3, 17–38 (1964).
Remmel J. B., “Recursive Boolean algebras,” in: Handbook of Boolean Algebras. V. 3, Elsevier, Amsterdam, etc., 1989, pp. 1097–1165.
Mead J., “Recursive prime models for Boolean algebras,” Colloq. Math., 41, 25–33 (1979).
Pal’chunov D. E., Trofimov A. V., and Turko A. I., “Autostability relative to strong constructivizations of Boolean algebras with distinguished ideals,” Siberian Math. J., 56, No. 3, 490–498 (2015).
Csima B. F., Montalbán A., and Shore R. A., “Boolean algebras, Tarski invariants, and index sets,” Notre Dame J. Formal Logic, 47, No. 1, 1–23 (2006).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text Copyright © 2015 Goncharov S.S., Bazhenov N.A., and Marchuk M.I.
The first author was partially supported by the Russian Foundation for Basic Research (Grant 13-01-91001-ANF-A). The second author was partially supported by the Grant Council of the President of the Russian Federation for the State Maintenance of the Leading Scientific Schools (Grant NSh-860.2014.1). The third author was partially supported by the Russian Foundation for Basic Research (Grant 14-01-00376).
To Yuriĭ Leonidovich Ershov on his 75th birthday.
__________
Translated from Sibirskiĭ Matematicheskiĭ Zhurnal, Vol. 56, No. 3, pp. 498–512, May–June, 2015; DOI: 10.17377/smzh.2015.56.303.
Rights and permissions
About this article
Cite this article
Goncharov, S.S., Bazhenov, N.A. & Marchuk, M.I. The index set of Boolean algebras autostable relative to strong constructivizations. Sib Math J 56, 393–404 (2015). https://doi.org/10.1134/S0037446615030039
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0037446615030039