The theory of the recursively enumerable weak truth-table degrees is undecidable

Journal of Symbolic Logic 57 (3):864-874 (1992)
Abstract
We show that the partial order of Σ0 3-sets under inclusion is elementarily definable with parameters in the semilattice of r.e. wtt-degrees. Using a result of E. Herrmann, we can deduce that this semilattice has an undecidable theory, thereby solving an open problem of P. Odifreddi
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: 10,747
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Citations of this work BETA
E. Herrmann (1997). Boolean Pairs Formed by the Δn0-Sets. Annals of Pure and Applied Logic 87 (2):145-149.
Similar books and articles
Analytics

Monthly downloads

Added to index

2009-01-28

Total downloads

6 ( #201,816 of 1,098,832 )

Recent downloads (6 months)

4 ( #79,379 of 1,098,832 )

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.