Home
Hostname: page-component-684bc48f8b-68png Total loading time: 0.166 Render date: 2021-04-12T15:06:17.665Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "metricsAbstractViews": false, "figures": false, "newCiteModal": false, "newCitedByModal": true }

# On the Σ2-theory of the upper semilattice of Turing degrees

Published online by Cambridge University Press:  12 March 2014

Corresponding

## Extract

A first-order sentence Φ is Σ2 if there is a quantifier-free formula Θ such that Φ has the form . The Σ2-theory of a structure for a language ℒ is the set of Σ2-sentences of true in . It was shown independently by Lerman and Shore (see [Le, Theorem VII.4.4]) that the Σ2-theory of the structure = 〈D, ≤ 〉 is decidable, where D is the set of degrees of unsolvability and ≤ is the standard ordering of D. This result is optimal in the sense that the Σ3-theory of is undecidable, a result due to J. Schmerl. (For a proof, see [Le, Theorem VII.4.5]. As Lerman has pointed out, this proof should be corrected by defining θσ to be ∀1(x) rather than ∀x(ψ(x)σ1(x)).) Nonetheless, in this paper we extend the decidability result of Lerman and Shore by showing that the Σ2-theory of is decidable, where ⋃ is the least upper bound operator and 0 is the least degree. Of course ⋃ is definable in , but many interesting degree-theoretic results are expressible as Σ2-sentences in the language of but not as Σ2-sentences in the language of . For instance, Simpson observed that the Posner-Robinson cupping theorem could be used to show that for any nonzero degrees a, b, there is a degree g such that bag, and bg (see [PR, Corollary 6]). However, the Posner-Robinson technique does not seem to suffice to decide the Σ2-theory of . We introduce instead a new method for coding a set into the join of two other sets and use it to decide this theory.

Type
Research Article
Information
The Journal of Symbolic Logic , March 1993 , pp. 193 - 204

## Access options

Get access to the full version of this content by using one of the access options below.

## References

[La]Lachlan, A. H., The elementary theory of recursively enumerable sets, Duke Mathematical Journal, vol. 35 (1968), pp. 123146.Google Scholar
[Le]Lerman, M., Degrees of unsolvability, Perspectives in Mathematical Logic, Omega Series, Springer-Verlag, Berlin, Heidelberg, New York, Tokyo, 1983.Google Scholar
[LS]Lerman, M. and Soare, R. I., A decidable fragment of the elementary theory of the lattice of recursively enumerable sets, Transactions of the American Mathematical Society, vol. 257(1980), pp. 137.Google Scholar
[PR]Posner, D. and Robinson, R., Degrees joining to 0′, this Journal, vol. 46 (1981), pp. 705713.Google Scholar

### Full text views

Full text views reflects PDF downloads, PDFs sent to Google Drive, Dropbox and Kindle and HTML full text views.

Total number of HTML views: 0
Total number of PDF views: 4 *
View data table for this chart

* Views captured on Cambridge Core between September 2016 - 12th April 2021. This data will be updated every 24 hours.

# Send article to Kindle

Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

On the Σ2-theory of the upper semilattice of Turing degrees
Available formats
×

# Send article to Dropbox

To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

On the Σ2-theory of the upper semilattice of Turing degrees
Available formats
×

# Send article to Google Drive

To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

On the Σ2-theory of the upper semilattice of Turing degrees
Available formats
×
×