×

\(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings. (English) Zbl 1016.03036

Summary: We characterize \(\varDelta _2^0\)-categoricity in Boolean algebras and linear orderings under some extra effectiveness conditions. We begin with a study of the relativized notion in these structures.

MSC:

03C57 Computable structure theory, computable model theory
03D45 Theory of numerations, effectively presented structures
03C35 Categoricity and completeness of theories
Full Text: DOI

References:

[1] Ash, C. J.; Knight, J. F., Computable Structures and the Hyperarithmetical Hierarchy (2000), North-Holland Publishing Company: North-Holland Publishing Company Amsterdam · Zbl 0960.03001
[2] Ash, C. J.; Knight, J. F.; Manasse, M.; Slaman, T., Generic copies of countable structures, Ann. Pure Appl. Logic, 42, 195-205 (1989) · Zbl 0678.03012
[3] Chang, C. C.; Keisler, H. J., Model Theory (1973), North-Holland: North-Holland Amsterdam · Zbl 0276.02032
[4] Chisholm, J., Effective model theory vs. recursive model theory, J. Symbolic Logic, 55, 1168-1191 (1990) · Zbl 0722.03030
[5] Downey, R., Computability theory and linear ordering, (Ershov, Y. L.; Goncharov, S. S.; Nerode, A.; Remmel, J. B.; Marek, V. W., Recursive Algebra, Analysis and Combinatorics. Recursive Algebra, Analysis and Combinatorics, Handbook of Recursive Mathematics, Vol. 2 (1998), Elsevier: Elsevier Amsterdam), 823-976 · Zbl 0941.03045
[6] S.S. Goncharov, Autostability and computable families of constructivizations. Algebra Logic 14 (1975) 647-680 (Russian), 392-409 (English).; S.S. Goncharov, Autostability and computable families of constructivizations. Algebra Logic 14 (1975) 647-680 (Russian), 392-409 (English). · Zbl 0382.03033
[7] S.S. Goncharov, The quantity of non-autoequivalent constructivizations, Algebra Logic 16 (1977) 257-282 (Russian), 169-185 (English).; S.S. Goncharov, The quantity of non-autoequivalent constructivizations, Algebra Logic 16 (1977) 257-282 (Russian), 169-185 (English). · Zbl 0407.03040
[8] S.S. Goncharov, Autostability of models and abelian groups, Algebra Logic 19 (1980) 23-44 (Russian), 13-27 (English).; S.S. Goncharov, Autostability of models and abelian groups, Algebra Logic 19 (1980) 23-44 (Russian), 13-27 (English). · Zbl 0468.03022
[9] S.S. Goncharov, The problem of the number of non-self-equivalent constructivizations, Algebra Logic 19 (1980) 621-639 (Russian), 401-414 (English).; S.S. Goncharov, The problem of the number of non-self-equivalent constructivizations, Algebra Logic 19 (1980) 621-639 (Russian), 401-414 (English). · Zbl 0476.03046
[10] S.S. Goncharov, V.D. Dzgoev, Autostability of models, Algebra Logic 19 (1980) 45-58 (Russian), 28-36 (English).; S.S. Goncharov, V.D. Dzgoev, Autostability of models, Algebra Logic 19 (1980) 45-58 (Russian), 28-36 (English). · Zbl 0468.03023
[11] Hungerford, T., Algebra (1974), Springer: Springer Berlin · Zbl 0293.12001
[12] J.F. Knight, M. Stob, Computable Boolean Algebras, preprint.; J.F. Knight, M. Stob, Computable Boolean Algebras, preprint. · Zbl 0974.03041
[13] Koppelberg, S., Handbook of Boolean Algebras (1989), North-Holland: North-Holland Amsterdam · Zbl 0671.06001
[14] O.V. Kudinov, A criterion for the autostability of 1-decidable models, Algebra Logic 31 (1992) 479-492 (Russian), 284-292 (English).; O.V. Kudinov, A criterion for the autostability of 1-decidable models, Algebra Logic 31 (1992) 479-492 (Russian), 284-292 (English). · Zbl 0795.03048
[15] Moses, M., Recursive linear orderings with recursive successivities, Ann. Pure Appl. Logic, 27, 253-264 (1984) · Zbl 0572.03025
[16] Remmel, J. B., Recursive isomorphism types of recursive Boolean algebras, J. Symbolic Logic, 46, 596-616 (1981) · Zbl 0543.03031
[17] Remmel, J. B., Recursively categorical linear orderings, Proc. AMS, 83, 387-391 (1981) · Zbl 0493.03022
[18] La Roche, P., Recursively presented Boolean algebras, Notices AMS, 24, A552-A553 (1977)
[19] Soare, R. I., Recursively Enumerable Sets and Degrees (1987), Springer: Springer Berlin · Zbl 0623.03042
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.