Skip to main content
SpringerLink
Log in

The structure of m-degrees

  • Conference paper
  • First Online:
Recursion Theory Week

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 1141))

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 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.95
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. DEGTEV: Some result on uppersemilattices and m-degrees. Alg. and Log. 18 (1979) 664–679.

    MathSciNet  Google Scholar 

  2. EPSTEIN: Degrees of unsolvability: Structure and Theory. Lecture Notes in Math. 759 (1979).

    Google Scholar 

  3. ERSHOV: The uppersemilattice of numerations of a finite set. Alg. and Log. 14 (1975) 159–175.

    Article  Google Scholar 

  4. LACHLAN: Initial segments of many-one degrees. Can. J. Math. 22 (1970) 75–85.

    Article  MathSciNet  MATH  Google Scholar 

  5. _____: Two theorems on many-one degrees of r.e. sets. Alg. and Log. 11 (1972) 127–132.

    Article  MathSciNet  MATH  Google Scholar 

  6. _____: Recursively enumerable many-one degrees. und Log. 11 (1972) 186–202.

    Google Scholar 

  7. LERMAN: Degrees of Unsolvability. Springer-Verlag 1983.

    Google Scholar 

  8. NERODE-SHORE: Second-order logic and first-order theories of reducibility orderings. In: The Kleene Symposium, Barwise et al. eds., North-Holland (1980) 181–200.

    Google Scholar 

  9. ODIFREDDI: Strong reducibilities. Bull. Am. Math. Soc. 4 (1981) 37–86.

    Article  MathSciNet  MATH  Google Scholar 

  10. _____: Forcing and reducibilities, J. Symb. Log. 48 (1983) 288–310, 724–743, 1013–1034.

    Article  MathSciNet  MATH  Google Scholar 

  11. _____: Classical Recursion Theory. Springer-Verlag, to appear.

    Google Scholar 

  12. PALIUTIN: Addendum to ERSHOV [75]. Alg. and Log. 14 (1975) 175–177.

    Google Scholar 

  13. POST: Recursively enumerable sets of positive integers and their decision properties. Bull. Am. Math. Soc. 50 (1944) 284–316.

    Article  MathSciNet  MATH  Google Scholar 

  14. SHORE: The theories of the truth-table and Turing degrees are not elementarily equivalent. In: Logic Colloquium 1980, Van Dalen et al. eds., North-Holland (1982) 231–237.

    Google Scholar 

  15. _____: The arithmetic and Turing degrees are not elementarily equivalent, to appear.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università di Torino, Italy

    Piergiorgio Odifreddi

Authors
  1. Piergiorgio Odifreddi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Heinz-Dieter Ebbinghaus Gert H. Müller Gerald E. Sacks

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag

About this paper

Cite this paper

Odifreddi, P. (1985). The structure of m-degrees. In: Ebbinghaus, HD., Müller, G.H., Sacks, G.E. (eds) Recursion Theory Week. Lecture Notes in Mathematics, vol 1141. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0076227

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15673-4

  • Online ISBN: 978-3-540-39596-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation