Skip to main content
SpringerLink
Log in

The First Order Theories of the Medvedev and Muchnik Lattices

  • Conference paper
Mathematical Theory and Computational Practice (CiE 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5635))

Included in the following conference series:

Abstract

We show that the first order theories of the Medevdev lattice and the Muchnik lattice are both computably isomorphic to the third order theory of the natural numbers.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Dyment, E.: Certain properties of the Medvedev lattice. Mathematics of the USSR Sbornik 30, 321–340 (1976) (English Translation)

    Article  MathSciNet  MATH  Google Scholar 

  2. Lerman, M.: Degrees of Unsolvability. Perspectives in Mathematical Logic. Springer, Heidelberg (1983)

    Book  MATH  Google Scholar 

  3. Medevdev, Y.T.: Degrees of difficulty of the mass problems. Dokl. Nauk. SSSR 104, 501–504 (1955)

    MathSciNet  Google Scholar 

  4. Muchnik, A.: On strong and weak reducibility of algorithmic problems. Sibirskii Matematicheskii Zhurnal 4, 1328–1341 (1963) (Russian)

    MathSciNet  Google Scholar 

  5. Nies, A.: Undecidable fragments of elementary theories. Algebra Universalis 35, 8–33 (1996)

    Article  MathSciNet  MATH  Google Scholar 

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

    MATH  Google Scholar 

  7. Shore, R.A.: Degree structures: local and global investigations. Bull. Symbolic Logic 12(3), 369–389 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  8. Simpson, S.G.: First order theory of the degrees of recursive unsolvability. Ann. of Math. 105, 121–139 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  9. Slaman, T.A., Woodin, W.H.: Definability in the Turing degrees. Illinois J. Math. 30, 320–334 (1986)

    MathSciNet  MATH  Google Scholar 

  10. Sorbi, A.: The Medvedev lattice of degrees of difficulty. In: Cooper, S.B., Slaman, T.A., Wainer, S.S. (eds.) Computability, Enumerability, Unsolvability - Directions in Recursion theory. London Mathematical Society Lecture Notes Series, pp. 289–312. Cambridge University Press, New York (1996)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Siena, 53100, Siena, Italy

    Andrew Lewis & Andrea Sorbi

  2. Department of Computer Science, University of Auckland, New Zealand

    André Nies

Authors
  1. Andrew Lewis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. André Nies
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Andrea Sorbi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Heidelberg, Im Neuenheimer Feld 294, 69120, Heidelberg, Germany

    Klaus Ambos-Spies

  2. Universiteit van Amsterdam, Plantage Muidergracht 24, 1018, Amsterdam, TV, The Netherlands

    Benedikt Löwe

  3. Institut für Informatik, Ruprecht-Karls-Universität Heidelberg, Im Neuenheimer Feld 294, 69120, Heidelberg, Germany

    Wolfgang Merkle

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lewis, A., Nies, A., Sorbi, A. (2009). The First Order Theories of the Medvedev and Muchnik Lattices. In: Ambos-Spies, K., Löwe, B., Merkle, W. (eds) Mathematical Theory and Computational Practice. CiE 2009. Lecture Notes in Computer Science, vol 5635. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03073-4_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03073-4_33

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03072-7

  • Online ISBN: 978-3-642-03073-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation