Index sets of autostable relative to strong constructivizations constructive models for familiar classes. (English. Russian original) Zbl 1382.03060
Dokl. Math. 92, No. 2, 525-527 (2015); translation from Dokl. Akad. Nauk, Ross. Akad. Nauk 464, No. 1, 12-14 (2015).
Summary: This paper calculates, in a precise way, the complexity of the index sets for computable structures that are autostable relative to strong constructivizations and belong to one of the following classes: linear orderings, Boolean algebras, distributive lattices, partial orderings, rings, and commutative semigroups. We also calculate the complexity of the index set for computable structures that have computable dimension \(n\), where \(n\) is a fixed natural number greater than 1.
MSC:
| 03C57 | Computable structure theory, computable model theory |
| 03D45 | Theory of numerations, effectively presented structures |
References:
| [1] | Y. L. Ershov and S. S. Goncharov, Constructive Models: Siberian School of Algebra and Logic (Consultants Bureau, New York, 2000). · Zbl 0954.03036 · doi:10.1007/978-1-4615-4305-3 |
| [2] | C. J. Ash and J. F. Khight, Computable Structures and the Hyperarithmetical Hierarchy (Elsevier Science, Amsterdam, 2000). · Zbl 0960.03001 |
| [3] | Goncharov, S. S.; Khight, J. F., No article title, Algebra Logic, 41, 351-373 (2002) · Zbl 1034.03044 · doi:10.1023/A:1021758312697 |
| [4] | S. S. Goncharov, in Mathematical Problems from Applied Logic. II: Logics for the 21st Century, Int. Math. Ser. (Springer, New York, 2007), Vol. 5, pp. 99-216. · Zbl 1109.03003 · doi:10.1007/978-0-387-69245-6_3 |
| [5] | Goncharov, S. S., No article title, J. Math. Sci., 205, 355-367 (2015) · doi:10.1007/s10958-015-2252-5 |
| [6] | Fokina, E. B., No article title, Sib. Math. J., 48, 939-948 (2007) · Zbl 1164.03326 · doi:10.1007/s11202-007-0097-y |
| [7] | Pavlovskii, E. N., No article title, Sib. Math. J., 49, 512-523 (2008) · doi:10.1007/s11202-008-0049-1 |
| [8] | Bazhenov, N. A., No article title, J. Math. Sci., 203, 444-454 (2014) · doi:10.1007/s10958-014-2148-9 |
| [9] | Goncharov, S. S.; Marchuk, M. I., No article title, J. Math. Sci., 205, 368-388 (2015) · Zbl 1349.03037 · doi:10.1007/s10958-015-2253-4 |
| [10] | S. S. Goncharov, Countable Boolean Algebras and Decidability: Siberian School of Algebra and Logic (Consultants Bureau, New York, 1997). · Zbl 0912.03019 |
| [11] | Bazhenov, N. A., No article title, Algebra Logic, 52, 179-187 (2013) · Zbl 1315.03052 · doi:10.1007/s10469-013-9233-x |
| [12] | Ash, C. J.; Knight, J. F., No article title, Ann. Pure Appl. Logic, 46, 211-234 (1990) · Zbl 0712.03020 · doi:10.1016/0168-0072(90)90004-L |
| [13] | Nurtazin, A. T., No article title, Algebra Logika, 13, 311-323 (1974) · Zbl 0302.02014 · doi:10.1007/BF01463352 |
| [14] | Downey, R. G.; Kach, A. M.; Lempp, S.; etal., No article title, Adv. Math., 268, 423-466 (2015) · Zbl 1345.03063 · doi:10.1016/j.aim.2014.09.022 |
| [15] | Goncharov, S. S., No article title, Algebra Logika, 19, 621-639 (1980) · Zbl 0476.03046 · doi:10.1007/BF01669323 |
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.
