Interpreting true arithmetic in the Δ 0 2 -enumeration degrees

Journal of Symbolic Logic 75 (2):522-550 (2010)
  Copy   BIBTEX

Abstract

We show that there is a first order sentence φ(x; a, b, l) such that for every computable partial order

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,623

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2010-09-12

Downloads
17 (#885,771)

6 months
10 (#397,791)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Then-rea enumeration degrees are dense.Alistair H. Lachlan & Richard A. Shore - 1992 - Archive for Mathematical Logic 31 (4):277-285.
Enumeration reducibility and partial degrees.John Case - 1971 - Annals of Mathematical Logic 2 (4):419-439.
Computably enumerable sets and quasi-reducibility.R. Downey, G. LaForte & A. Nies - 1998 - Annals of Pure and Applied Logic 95 (1-3):1-35.
Definability in the enumeration degrees.Theodore A. Slaman & W. Hugh Woodin - 1997 - Archive for Mathematical Logic 36 (4-5):255-267.
Some Special Pairs of Σ2 e-Degrees.Seema Ahmad & Alistair H. Lachlan - 1998 - Mathematical Logic Quarterly 44 (4):431-449.

View all 9 references / Add more references