Skip to main content
SpringerLink
Log in

An alternative, priority-free, solution to Post's problem

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1986 (MFCS 1986)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 233))

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arslanov, M.M. (1981) On some general theorems about fixed points, Mathematical University News, 228, No5, 9–16.

    Google Scholar 

  2. Arslanov, M.M. (1985) Classes of recursively enumerable sets and their degrees of unsolvability, Mathematical University News, 275, No4, 13–19.

    Google Scholar 

  3. Friedberg, R.M. (1957) Two recursively enumerable sets of incomparable degrees of unsolvability, Proc. Nat. Acad. Sci. U.S.A. 43, 236–238.

    Google Scholar 

  4. Handbook of mathematical logic (J. Barwise ed.) (1977) Simpson, S.G. Degrees of unsolvability: A survey of results, North-Holland, Amsterdam, 631–652.

    Google Scholar 

  5. Jockusch, C.G. Jr., Soare, R.I. (1972) Degrees of members of ∏ 01 classes, Pacific J. Math., 40, 605–616.

    Google Scholar 

  6. Jockusch, C.G. Jr., Soare, R.I. (1972) ∏ 01 classes and degrees of theories, Trans. Amer. Math. Soc., 173, 33–56.

    Google Scholar 

  7. Maass, W. (1982) Recursively enumerable generic sets, J. Symbolic Logic, 47, 809–823.

    Google Scholar 

  8. Muchnik, A.A. (1956) On the unsolvability of the problem of reducibility in the theory of algorithms, Dokl. A. Nauk SSSR 108, 194–197.

    Google Scholar 

  9. Post, E.L. (1944) Recursively enumerable sets of integers and their decision problems, Bull. Amer. Math. Soc. 50, 285–316.

    Google Scholar 

  10. Rogers, H. Jr. (1967) Theory of recursive functions and effective computability, McGraw-Hill, New York.

    Google Scholar 

  11. Soare, R.I. (to appear) Recursively enumerable sets and degrees, Omega Series in Logic, Springer-Verlag, Berlin and New York.

    Google Scholar 

  12. Stob, M. (1982) Index sets and degrees of unsolvability, J. Symbolic Logic 47, 241–248.

    Google Scholar 

  13. Kučera, A. (1985) Measure, ∏ 01 -classes and complete extensions of PA, Lecture Notes in Math., vol. 1141, Springer-Verlag, Berlin, 245–259.

    Google Scholar 

  14. Kučera, A. (to appear) A class of degrees of unsolvability of functions without a fixed point, Yerevan State Univ., Yerevan.

    Google Scholar 

  15. Kučera, A. (in preparation) The role of diagonalization in constructions of r.e. sets.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Operations Research, Charles University, Malostranské nám.25, 118 00, Prague 1, Czechoslovakia

    Antonín Kučera

Authors
  1. Antonín Kučera
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jozef Gruska Branislav Rovan Juraj Wiedermann

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kučera, A. (1986). An alternative, priority-free, solution to Post's problem. In: Gruska, J., Rovan, B., Wiedermann, J. (eds) Mathematical Foundations of Computer Science 1986. MFCS 1986. Lecture Notes in Computer Science, vol 233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0016275

Download citation

  • DOI: https://doi.org/10.1007/BFb0016275

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16783-9

  • Online ISBN: 978-3-540-39909-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation