Degrees of Selector Functions and Relative Computable Categoricity
-
Published:2024-04
Issue:4
Volume:45
Page:1825-1832
-
ISSN:1995-0802
-
Container-title:Lobachevskii Journal of Mathematics
-
language:en
-
Short-container-title:Lobachevskii J Math
Author:
Kalimullin I. Sh.
Publisher
Pleiades Publishing Ltd
Reference6 articles.
1. C. Ash, J. Knight, M. Manasse, and T. Slaman, ‘‘Generic copies of countable structures,’’ Ann. Pure Appl. Log. 42, 195–205 (1989).
https://doi.org/10.1016/0168-0072(89)90015-8
2. J. Chisholm, ‘‘Effective model theory vs. recursive model theory,’’ J. Symb. Logic 55, 1168–1191 (1990).
https://doi.org/10.2307/2274481
3. C. G. Jockusch and R. A. Shore, ‘‘Pseudo-jump operators, II: Transfinite iterations, hierarchies and minimal covers,’’ J. Symb. Logic 49, 1205–1236 (1984).
https://doi.org/10.2307/2274273
4. M. M. Arslanov, G. LaForte, and T. A. Slaman, ‘‘Relative enumerability in the difference hierarchy,’’ J. Symb. Logic 63, 411–420 (1998).
https://doi.org/10.2307/2586839
5. S. B. Cooper, Computability Theory (Chapman and Hall/CRC, New York, 2004).
https://doi.org/10.1201/9781315275789