Author:
Faizrahmanov M. Kh.,Puzarenko V. G.
Reference8 articles.
1. Yu. L. Ershov, Theory of Numberings (Moscow, Nauka, 1977) [in Russian].
2. A. I. Mal’tsev, ‘‘Positive and negative enumerations,’’ Dokl. Akad. Nauk SSSR 160, 278–280 (1965).
3. R. I. Soare, Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets (Springer, Berlin, Heidelberg, New York, London, Paris, Tokyo, 1987).
4. Yu. L. Ershov, Definability and Computability (Plenum, New York, 1996).
5. I. Sh. Kalimullin, V. G. Puzarenko, and M. Kh. Faizrakhmanov, ‘‘Computable positive and Friedberg numberings in hyperarithmetic,’’ Algebra Logic 59, 46–58 (2020).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Negative Numberings in Admissible Sets. I;Siberian Advances in Mathematics;2023-12