Skip to main content
Log in

Positive Numberings in Admissible Sets

  • Published:
Siberian Mathematical Journal Aims and scope Submit manuscript

Abstract

We construct the example of an admissible set \(\mathbb{A}\) such that there exists a positive computable \(\mathbb{A}\)-numbering of the family of all \(\mathbb{A}\)-c.e. sets, whereas any negative computable \(\mathbb{A}\)-numberings are absent.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ershov Yu. L., Definability and Computability [Russian], Èkonomika, Moscow (2000) (Siberian School of Algebra and Logic).

    Google Scholar 

  2. Puzarenko V. G., “Decidable computable \(\mathbb{A}\)-numberings,” Algebra and Logic, vol. 41, no. 5, 314–322 (2002).

    Article  MathSciNet  Google Scholar 

  3. Puzarenko V. G., “On a semilattice of numberings,” Siberian Adv. Math., vol. 20, no. 2, 128–154 (2010).

    Article  MathSciNet  Google Scholar 

  4. Puzarenko V. G., “A semilattice of numberings. II,” Algebra and Logic, vol. 49, no. 4, 340–353 (2010).

    Article  MathSciNet  Google Scholar 

  5. Kalimullin I. Sh., Puzarenko V. G., and Faizrahmanov M. Kh., “Positive presentations of families relative to e-oracles,” Sib. Math. J., vol. 59, no. 4, 648–656 (2018).

    Article  MathSciNet  Google Scholar 

  6. Kalimullin I. Sh., Puzarenko V. G., and Faizrahmanov M. Kh., “Partial decidable presentations in hyperarithmetic,” Sib. Math. J., vol. 60, no. 3, 464–471 (2019).

    Article  MathSciNet  Google Scholar 

  7. Ershov Yu. L., The Theory of Enumerations [Russian], Nauka, Moscow (1977).

    Google Scholar 

  8. Goncharov S. S. and Sorbi A., “Generalized computable numerations and nontrivial Rogers semilattices,” Algebra and Logic, vol. 36, no. 6, 359–369 (1997).

    Article  MathSciNet  Google Scholar 

  9. Badaev S. A. and Goncharov S. S., “Generalized computable universal numberings,” Algebra and Logic, vol. 53, no. 5, 355–364 (2014).

    Article  MathSciNet  Google Scholar 

  10. Puzarenko V. G., “Computability in special models,” Sib. Math. J., vol. 46, no. 1, 148–165 (2005).

    Article  MathSciNet  Google Scholar 

  11. Barwise J., Admissible Sets and Structures, Springer-Verlag, Berlin, Göttingen, and Heidelberg (1975).

    Book  Google Scholar 

  12. 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).

    Book  Google Scholar 

  13. Ershov Yu. L. and Goncharov S. S., Constructive Models, Kluwer Academic/Plenum Publishers, New York, etc. (2000).

    Book  Google Scholar 

  14. Ershov Yu. L., Decision Problems and Constructive Models [Russian], Nauka, Moscow (1980).

    Google Scholar 

  15. Ershov Yu. L., Puzarenko V. G., and Stukachev A. I., “\(\mathbb{HF}\)-computability,” in: Computability in Context, Imp. Coll. Press, London, 2011, 169–242 (—Computation and Logic in the Real World).

    Chapter  Google Scholar 

  16. Puzarenko V. G., “Generalized numberings and definability of the field ℝ in admissible structures,” Vestnik NGU Ser. Mat. Mekh. Informat., vol. 2, no. 3, 107–117 (2003).

    MATH  Google Scholar 

  17. Malcev A. I., Algorithms and Recursive Functions, Wolters–Noordhoff Publishing, Groningen (1970).

    Google Scholar 

  18. Puzarenko V. G., “Computability over models of decidable theories,” Algebra and Logic, vol. 39, no. 2, 98–113 (2000).

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding authors

Correspondence to I. Sh. Kalimullin, V. G. Puzarenko or M. Kh. Faizrahmanov.

Additional information

Dedicated to the 80th birthday of Academician Yu. L. Ershov, the founder of the areas of semantic programming and computability on admissible structures.

Russian Text © The Author(s), 2020, published in Sibirskii Matematicheskii Zhurnal, 2020, Vol. 61, No. 3, pp. 607–621.

I. Sh. Kalimullin was supported by the Russian Science Foundation (Grant 18-11-00028). Also he is funded by the Russian Government as a Federal Professor of Mathematics. V. G. Puzarenko was supported by the Mathematical Center in Akademgorod, the Ministry of Education and Science of the Russian Federation (Agreement 075-15-2019-1613), and the State Task to the Sobolev Institute of Mathematics (Project 0314-2019-0003). The work of M. Kh. Faizrahmanov was carried out in the framework of the program of support of the Mathematical Center of the Volga Region Federal District.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kalimullin, I.S., Puzarenko, V.G. & Faizrahmanov, M.K. Positive Numberings in Admissible Sets. Sib Math J 61, 478–489 (2020). https://doi.org/10.1134/S003744662003009X

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S003744662003009X

Keywords

Navigation