The Π₃-Theory of the [image] -Enumeration Degrees Is Undecidable

Journal of Symbolic Logic 71 (4):1284 - 1302 (2006)
  Copy   BIBTEX

Abstract

We show that in the language of {≤}, the Π₃-fragment of the first order theory of the $\Sigma _{2}^{0}$-enumeration degrees is undecidable. We then extend this result to show that the Π₃-theory of any substructure of the enumeration degrees which contains the $\Delta _{2}^{0}$-degrees is undecidable

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,221

External links

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

Through your library

Similar books and articles

Noncappable enumeration degrees below 0'e. [REVIEW]S. Barry Cooper & Andrea Sorbi - 1996 - Journal of Symbolic Logic 61 (4):1347 - 1363.
Bounding Nonsplitting Enumeration Degrees.Thomas F. Kent & Andrea Sorbi - 2007 - Journal of Symbolic Logic 72 (4):1405 - 1417.
Uniform enumeration operations.A. H. Lachlan - 1975 - Journal of Symbolic Logic 40 (3):401-409.
Degrees of Unsolvability of Continuous Functions.Joseph S. Miller - 2004 - Journal of Symbolic Logic 69 (2):555 - 584.
1-genericity in the enumeration degrees.Kate Copestake - 1988 - Journal of Symbolic Logic 53 (3):878-887.

Analytics

Added to PP
2010-08-24

Downloads
9 (#1,074,911)

6 months
1 (#1,027,696)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

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.
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.

Add more references