Skip to main content
SpringerLink
Log in

Families Without Minimal Numberings

  • Published:
Algebra and Logic Aims and scope

It is proved that for any nonzero computable ordinal and its arbitrary notation a, there exists a Σ − 1 a -computable family without minimal computable numberings.

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

Access this article

Log in via an institution

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. V. V. V’yugin, “On some examples of upper semilattices of computable enumerations,” Algebra and Logic, 12, No. 5, 277-286 (1973).

    Article  Google Scholar 

  2. S. A. Badaev, “Minimal enumerations,” Sib. Adv. Math., 2, No. 1, 1-30 (1992).

    MathSciNet  Google Scholar 

  3. S. A. Badaev and Zh. T. Talasbaeva, “Computable numberings in the hierarchy of Ershov,” Mathematical Logic in Asia, S. S. Goncharov (Ed.), World Scientific, NJ, 17-30 (2006).

  4. S. A. Badaev and S. Lempp, “A decomposition of the Rogers semilattice of a family of d.c.e. sets,” J. Symb. Log., 74, No. 2, 618-640 (2009).

    Article  MATH  MathSciNet  Google Scholar 

  5. A. B. Khutoretskii, “On the cardinality of the upper semilattice of computable enumerations,” Algebra and Logic, 10, No. 5, 348-352 (1971).

    Article  Google Scholar 

  6. K. Sh. Abeshev, “On the existence of universal numberings for finite families of d.c.e. sets,” Math. Log. Q., 60, No. 3, 161-167 (2014).

    Article  MATH  MathSciNet  Google Scholar 

  7. S. A. Badaev and S. S. Goncharov, “Theory of numberings: Open problems,” in Computability Theory and Its Applications, Current Trends and Open Problems, Cont. Math., 257, S. Cholak et al. (Eds.), Am. Math. Soc., Providence, RI (2000), pp. 23-38.

  8. H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York (1967).

    MATH  Google Scholar 

  9. Yu. L. Ershov, “A hierarchy of sets. I,” Algebra and Logic, 7, No. 1, 25-43 (1968).

    Article  Google Scholar 

  10. Yu. L. Ershov, “On a hierarchy of sets, II,” Algebra and Logic, 7, No. 4, 212-232 (1968).

    Article  Google Scholar 

  11. Yu. L. Ershov, “On a hierarchy of sets. III,” Algebra and Logic, 9, No. 1, 20-31 (1970).

    Article  Google Scholar 

  12. C. J. Ash and J. F. Knight, Computable Structures and the Hyperarithmetical Hierarchy, Stud. Log. Found. Math., 144, Elsevier, Amsterdam (2000).

  13. S. S. Goncharov and A. Sorbi, “Generalized computable numerations and nontrivial Rogers semilattices,” Algebra and Logic, 36, No. 6, 359-369 (1997).

    Article  MathSciNet  Google Scholar 

  14. Yu. L. Ershov, The Theory of Numberings [in Russian], Nauka, Moscow (1977).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Al-Farabi Kazakh National University, Al-Farabi ave. 71, Alma-Ata, 050038, Kazakhstan

    K. Sh. Abeshev, S. A. Badaev & M. Mustafa

Authors
  1. K. Sh. Abeshev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. A. Badaev
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Mustafa
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to K. Sh. Abeshev.

Additional information

Translated from Algebra i Logika, Vol. 53, No. 4, pp. 427-450, July-August, 2014.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Abeshev, K.S., Badaev, S.A. & Mustafa, M. Families Without Minimal Numberings. Algebra Logic 53, 271–286 (2014). https://doi.org/10.1007/s10469-014-9290-9

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10469-014-9290-9

Keywords

Search

Navigation