Skip to main content
SpringerLink
Log in

The arithmetic and Turing degrees are not elementarily equivalent

  • Published:
Archiv für mathematische Logik und Grundlagenforschung Aims and scope Submit manuscript

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

References

  • Harding, C.J.: Forcing in recursion theory. Thesis, University College of Swansea (1974).

  • Lachlan, A.H.: Distributive initial segments of the degrees of unsolvability. Z. math. Logik Grundlagen Math.14, 457–472 (1968).

    Google Scholar 

  • MacIntyre, J.M.: Transfinite extensions of Friedberg's completeness criterion. J. Symb. Logic42, 1–10 (1977).

    Google Scholar 

  • Mohrherr, Jeanleah: Ph. D. Thesis, University of Illinois, Chicago Circle (1982).

    Google Scholar 

  • Nerode, A., Shore, R.A.: Second order logic and first order theories of reducibility orderings. In: Barwise, J., Keisler, J., Kunen, K. (eds.): The Kleene symposium, pp. 181–200. Amsterdam: North-Holland 1979.

    Google Scholar 

  • Odifreddi, P.: On the first order theory of the arithmetic degrees. Proc. Am. Math. Soc.87, 505–507 (1983).

    Google Scholar 

  • Shore, R.A.: The Turing and truth-table degrees are not elementarily equivalent. In: Dalen, D. van (ed.): Logic Colloquium '80, pp. 231–237. Amsterdam: North-Holland 1982.

    Google Scholar 

  • Shore, R.A.: On homogeneity and definability in the first order theory of the Turing degrees. J. Symb. Logic47, 8–16 (1982a).

    Google Scholar 

  • Yates, C.E.M.: Initial segments of the degrees of unsolvability. Part II. Minimal degrees. J. Symb. Logic35, 243–266 (1970).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics White Hall, Cornell University, 14853, Ithaca, NY, USA

    Richard A. Shore

Authors
  1. Richard A. Shore
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research partially supported by a grant from the NSF.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shore, R.A. The arithmetic and Turing degrees are not elementarily equivalent. Arch math Logik 24, 137–139 (1984). https://doi.org/10.1007/BF02007145

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation