The Π₃-Theory of the $\Sigma _{2}^{0}$ -Enumeration Degrees Is Undecidable

Journal of Symbolic Logic 71 (4):1284 - 1302 (2006)
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.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 9,360
External links
  • Through your library Configure
    References found in this work BETA

    No references found.

    Citations of this work BETA

    No citations found.

    Similar books and articles
    A. H. Lachlan (1975). Uniform Enumeration Operations. Journal of Symbolic Logic 40 (3):401-409.
    Andrew Arana (2001). Solovay's Theorem Cannot Be Simplified. Annals of Pure and Applied Logic 112 (1):27-41.
    Analytics

    Monthly downloads

    Sorry, there are not enough data points to plot this chart.

    Added to index

    2011-05-29

    Total downloads

    0

    Recent downloads (6 months)

    0

    How can I increase my downloads?

    My notes
    Sign in to use this feature


    Discussion
    Start a new thread
    Order:
    There  are no threads in this forum
    Nothing in this forum yet.