Abstract
We introduce the notion of A-numbering which generalizes the classical notion of numbering. All main attributes of classical numberings are carried over to the objects considered here. The problem is investigated of the existence of positive and decidable computable A-numberings for the natural families of sets e-reducible to a fixed set. We prove that, for every computable A-family containing an inclusion-greatest set, there also exists a positive computable A-numbering. Furthermore, for certain families we construct a decidable (and even single-valued) computable total A-numbering when A is a low set; we also consider a relativization containing all cases of total sets (this in fact corresponds to computability with a usual oracle).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ershov Yu. L., The Theory of Enumerations [Russian], Nauka, Moscow (1977).
Ershov Yu. L., Definability and Computability, Consultants Bureau, New York and London (1996).
Kalimullin I. Sh. and Puzarenko V. G., “Computable principles on admissible sets,” Siberian Adv. Math., vol. 15, No. 4, 1–33 (2005).
Soare R. I., Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets, Springer-Verlag, Berlin, Heidelberg, New York, London, Paris, and Tokyo (1987).
Rogers H., Theory of Recursive Functions and Effective Computability, McGraw-Hill Book Comp., New York, St. Louis, San Francisco, Toronto, London, and Sydney (1967).
Goncharov S. S. and Sorbi A., “Generalized computable numerations and nontrivial Rogers semilattices,” Algebra and Logic, vol. 36, No. 6, 359–369 (1997).
Badaev S. A. and Goncharov S. S., “Generalized computable universal numberings,” Algebra and Logic, vol. 53, No. 5, 355–364 (2014).
Issakhov A. A., “Ideals without minimal elements in Rogers semilattices,” Algebra and Logic, vol. 54, No. 3, 197–203 (2015).
Faizrahmanov M. Kh., “Universal generalized computable numberings and hyperimmunity,” Algebra and Logic, vol. 56, No. 4, 337–347 (2017).
Faizrahmanov M. Kh., “Minimal generalized computable enumerations and high degrees,” Sib. Math. J., vol. 58, No. 6, 553–558 (2017).
Badaev S. A. and Goncharov S. S., “The theory of numberings: Open problems,” Contemp. Math., vol. 257, 23–38 (2000).
Badaev S. A., “Positive enumerations,” Sib. Math. J., vol. 18, No. 3, 343–352 (1977).
Goncharov S. S., Lempp S., and Solomon D. R., “Friedberg numberings of families of n-computably enumerable sets,” Algebra and Logic, vol. 41, No. 2, 81–86 (2002).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © 2018 Kalimullin I.Sh., Puzarenko V.G., and Faizrahmanov M.Kh.
Kazan; Novosibirsk. Translated from Sibirskii Matematicheskii Zhurnal, vol. 59, no. 4, pp. 823–833, July–August, 2018; DOI: 10.17377/smzh.2018.59.407.
I. Sh. Kalimullin was supported by the subsidy of the Government Task for Kazan (Volga Region) Federal University (Grant 1.451.2016/1.4). V. G. Puzarenko was supported by the Russian Foundation for Basic Research (Grant 18–01–00624). M. Kh. Faizrahmanov was supported by the subsidy of the Government Task for Kazan (Volga Region) Federal University (Grant 1.1515.2017/4.6).
Rights and permissions
About this article
Cite this article
Kalimullin, I.S., Puzarenko, V.G. & Faizrahmanov, M.K. Positive Presentations of Families Relative to e-Oracles. Sib Math J 59, 648–656 (2018). https://doi.org/10.1134/S0037446618040079
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0037446618040079