Algebra and Logic

, Volume 57, Issue 4, pp 320–323 | Cite as

Positive Presentations of Families in Relation to Reducibility with Respect to Enumerability

  • I. Sh. KalimullinEmail author
  • V. G. Puzarenko
  • M. Kh. Faizrakhmanov

The objects considered here serve both as generalizations of numberings studied in [1] and as particular versions of A-numberings, where 𝔸 is a suitable admissible set, introduced in [2] (in view of the existence of a transformation realizing the passage from e-degrees to admissible sets [3]). The key problem dealt with in the present paper is the existence of Friedberg (single-valued computable) and positive presentations of families. In [3], it was stated that the above-mentioned transformation preserves the majority of properties treated in descriptive set theory. However, it is not hard to show that it also respects the positive (negative, decidable, single-valued) presentations. Note that we will have to extend the concept of a numbering and, in the general case, consider partial maps rather than total ones. The given effect arises under the passage from a hereditarily finite superstructure to natural numbers, since a computable function (in the sense of a hereditarily finite superstructure) realizing an enumeration of the hereditarily finite superstructure for nontotal sets is necessarily a partial function.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Yu. L. Ershov, Numeration Theory [in Russian], Nauka, Moscow (1977).Google Scholar
  2. 2.
    Yu. L. Ershov, Definability and Computability, Sib. School Alg. Log. [in Russian], 2nd ed., Ekonomika, Moscow (2000).Google Scholar
  3. 3.
    I. Sh. Kalimullin and V. G. Puzarenko, “Computability principles on admissible sets,” Mat. Trudy, 7, No. 2, 35-71 (2004).MathSciNetzbMATHGoogle Scholar
  4. 4.
    R. I. Soare, Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets, Persp. Math. Log., Omega Ser., Springer, Berlin (1987).zbMATHGoogle Scholar
  5. 5.
    S. S. Goncharov and A. Sorbi, “Generalized computable numerations and nontrivial Rogers semilattices,” Algebra and Logic, 36, No. 6, 359-369 (1997).MathSciNetCrossRefGoogle Scholar
  6. 6.
    S. A. Badaev, “Positive enumerations,” Sib. Math. J., 18, No. 3, 343-352 (1977).CrossRefGoogle Scholar
  7. 7.
    S. S. Goncharov, S. Lempp, and D. R. Solomon, “Friedberg numberings of families of ncomputably enumerable sets,” Algebra and Logic, 41, No. 2, 81-86 (2002).MathSciNetCrossRefGoogle Scholar
  8. 8.
    G. E. Sacks, Higher Recursion Theory, Springer, Berlin (1990).CrossRefGoogle Scholar
  9. 9.
    J. C. Owings, Jun., “The meta-r.e. sets, but not the Π1 1 sets, can be enumerated without repetition,” J. Symb. Log., 35, No. 2, 223-229 (1970).MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  • I. Sh. Kalimullin
    • 1
    Email author
  • V. G. Puzarenko
    • 2
    • 3
  • M. Kh. Faizrakhmanov
    • 1
  1. 1.Kazan (Volga Region) Federal UniversityKazanRussia
  2. 2.Sobolev Institute of MathematicsNovosibirskRussia
  3. 3.Novosibirsk State UniversityNovosibirskRussia

Personalised recommendations