Skip to main content
SpringerLink
Log in

Computability and Numberings

  • Chapter
New Computational Paradigms

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ash, C. J.: Categoricity in hyperarithmetical degrees. Annals of Pure and Applied Logic, 34,1-14 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  2. Ash, C. J., Knight, J. F.: Pairs of computable structures. Annals of Pure and Applied Logic, 46, 211-234 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  3. Ash, C. J., Knight, J. F.: Possible degrees in computable copies. Annals of Pure and Applied Logic, 75, 215-221 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  4. Ash, C. J., Knight, J. F.: Possible degrees in computable copies II. Annals of Pure and Applied Logic, 87, 151-165 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  5. Ash, C. J., Knight, J. F.: Computable Structures and the Hyperarithmetical Hierarchy. Elsevier Science, Amsterdam (2000)

    MATH  Google Scholar 

  6. Badaev, S. A.: On Rogers semilattices. Lecture Notes in Computer Science, 3959, 704-706(2006)

    MathSciNet  Google Scholar 

  7. Badaev, S. A., Goncharov, S. S.: Theory of numberings: open problems. In: Cholak, P., Lempp, S., Lerman, M., Shore, R. (eds) Computability Theory and its Applications. Con-temporary Mathematics, 257. American Mathematical Society, Providence (2000)

    Google Scholar 

  8. Badaev, S. A., Goncharov, S. S.: Rogers semilattices of families of arithmetic sets. Alge-bra and Logic, 40, 283-291 (2001)

    Article  MathSciNet  Google Scholar 

  9. Badaev, S. A., Goncharov, S. S., Sorbi, A.: Completeness and universality of arithmeti-cal numberings. In: Cooper, S. B., Goncharov, S. S. (eds) Computability and Models. Kluwer/Plenum Publishers, New York (2003).

    Google Scholar 

  10. Badaev, S. A., Goncharov, S. S., Podzorov, S.Yu., Sorbi, A.: Algebraic properties of Rogers semilattices of arithmetical numberings. In: Cooper, S. B., Goncharov, S. S. (eds) Computability and Models. Kluwer/Plenum Publishers, New York (2003)

    Google Scholar 

  11. Badaev, S. A., Goncharov, S. S., Sorbi, A.: Isomorphism types and theories of Rogers semilattices of arithmetical numberings. In: Cooper, S. B., Goncharov, S. S. (eds) Com-putability and Models. Kluwer/Plenum Publishers, New York (2003)

    Google Scholar 

  12. Badaev, S. A., Goncharov, S. S., Sorbi, A.: Elementary properties of Rogers semilattices of arithmetical numberings. In: Downey, R., Ding, D., Tung, S. H., Qiu, Y. H., Yasugi, M., Wu, G. (eds) Proceedings of the 7-th and 8-th Asian Logic Conferences. World Scientific, Singapore (2003)

    Google Scholar 

  13. Badaev, S. A., Goncharov, S. S., Sorbi, A.: On elementary theories of Rogers semilattices. Algebra and Logic, 44, 143-147 (2005)

    Article  MathSciNet  Google Scholar 

  14. Badaev, S. A., Goncharov, S. S., Sorbi, A.: Isomorphis types of Rogers semilattices for the families from different levels of arithmetical hierarchy. Algebra and Logic, 45, 361-370(2006)

    Article  MathSciNet  Google Scholar 

  15. Badaev, S. A., Podzorov, S.Yu.: Minimal coverings in the Rogers semilattices of Σ n -computable numberings. Siberian Mathematical Journal, 43, 616-622 (2002)

    Article  MathSciNet  Google Scholar 

  16. Badaev, S. A., Talasbaeva Zh. T.: Computable numberings in the Hierarchy of Ershov. In: Goncharov, S.S., Ono, H., Downey, R. (eds) Proceedings of 9-th Asian Logic Conference. World Scientific Publishers, Singapore (2006)

    Google Scholar 

  17. Dzgoev, V. D.: Constructive enumerations of Boolean lattices. Algebra and Logic, 27, 395-400 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  18. Ershov, Yu.L.: Theory of Numberings. Nauka, Moscow (1977).

    Google Scholar 

  19. Ershov, Yu.L.: Theory of numberings. In: Griffor, E. R. (ed) Handbook of Computability Theory. North-Holland, Amsterdam (1999)

    Google Scholar 

  20. Feiner, L.: Hierarchies of Boolean algebras. Journal of Symbolic Logic, 35, 365-374 (1970)

    Article  MathSciNet  Google Scholar 

  21. Friedberg, R. M.: Three theorems on recursive enumeration. Journal of Symbolic Logic, 23,309-316 (1958)

    Article  MathSciNet  Google Scholar 

  22. Goncharov, S. S.: The quantity of nonautoequivalent constructivizations. Algebra and Logic, 16, 169-185 (1977)

    Article  Google Scholar 

  23. Goncharov, S. S.: Computable single-valued numerations. Algebra and Logic, 19, 325-356(1980)

    Article  MATH  Google Scholar 

  24. Goncharov, S. S.: On the problem of number of non-self-equivalent constructivizations. Algebra and Logic, 19, 401-414 (1980)

    Article  MATH  Google Scholar 

  25. Goncharov, S. S.: Countable Boolean Algebras and Decidability. Plenum, Consultants Bureau, New York (1997).

    MATH  Google Scholar 

  26. Goncharov, S. S.: Computability and computable models. In: Mathematical Problems in Applied Logic II. Springer, Heidelberg (2007)

    Google Scholar 

  27. Goncharov, S. S., Knight, J. F.: Computable structure/non-structure theorems. Algebra and Logic, 41, 351-373 (2002)

    Article  MathSciNet  Google Scholar 

  28. Goncharov, S. S., Harizanov, V. S., Knight, J. F., McCoy, C., Miller, R. G., Solomon, R.: Enumerations in computable structure theory. Annals of Pure and Applied Logic, 136, 219-246 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  29. Goncharov, S. S., Lempp, S., Solomon, D. R.: Friedberg numberings of families of n-computably enumerable sets. Algebra and Logic, 41, 81-86 (2002)

    Article  MathSciNet  Google Scholar 

  30. Goncharov, S. S., Nurtazin, A. T.: Constructive models of complete solvable theories. Algebra and Logic, 12, 67-77 (1973)

    Article  Google Scholar 

  31. Goncharov, S. S., Sorbi, A.: Generalized computable numerations and non-trivial Rogers semilattices. Algebra and Logic, 36, 359-369 (1997)

    Article  MathSciNet  Google Scholar 

  32. Lachlan, A. H.: On the lattice of recursively enumerable sets. Transactions of the American Mathematical Society, 130, 1-37 (1968)

    Article  MATH  MathSciNet  Google Scholar 

  33. Podzorov, S.Yu.: Initial segments in Rogers semilattices of Σ n -computable numberings. Algebra and Logic, 42, 121-129 (2003)

    Article  MathSciNet  Google Scholar 

  34. Podzorov, S.Yu.: Local structure of Rogers semilattices of Σ n -computable numberings. Algebra and Logic, 44, 82-94 (2005)

    Article  MathSciNet  Google Scholar 

  35. Podzorov, S.Yu.: On the definition of a Lachlan semilattice. Siberian Mathematical Jour-nal, 47, 315-323 (2006)

    Article  MathSciNet  Google Scholar 

  36. Rogers, H.: Gödel numberings of partial computable functions. Journal of Symbolic Logic, 23, 49-57 (1958)

    Google Scholar 

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

    MATH  Google Scholar 

  38. Soare, R. I.: Recursively Enumerable Sets and Degrees. Springer-Verlag, Berlin Heidel-berg (1987)

    Google Scholar 

  39. Talasbaeva, Zh. T.: Positive numberings of families of sets in the Ershov hierarchy. Alge-bra and Logic, 42, 413-418 (2003)

    Article  MathSciNet  Google Scholar 

  40. Uspensky, V. A.: Kolmogorov and mathematical logic. Journal of Symbolic Logic, 57, 385-412 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  41. Uspensky, V. A.: Lectures on Computable Functions. Fiz-MatGiz, Moscow (1960)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Kazakh National University, 050038, Almaty, Kazakhstan

    Serikzhan Badaev

  2. Institute of Mathematics of Siberian Branch of Russian Academy of Sciences, 6300090, Novosibirsk, Russia

    Sergey Goncharov

Authors
  1. Serikzhan Badaev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sergey Goncharov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Leeds, LS2 9JT, Leeds, UK

    S. Barry Cooper

  2. University of Amsterdam, Plantage Muidergracht 24, 1018 TV, Amsterdam, Netherlands

    Benedikt Löwe

  3. Università di Siena, Pian dei Mantellini 44, 53100, Siena, Italy

    Andrea Sorbi

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer Science+Business Media, LLC

About this chapter

Cite this chapter

Badaev, S., Goncharov, S. (2008). Computability and Numberings. In: Cooper, S.B., Löwe, B., Sorbi, A. (eds) New Computational Paradigms. Springer, New York, NY. https://doi.org/10.1007/978-0-387-68546-5_2

Download citation

  • DOI: https://doi.org/10.1007/978-0-387-68546-5_2

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-36033-1

  • Online ISBN: 978-0-387-68546-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation