Mathematical Logic Quarterly 47 (1):3-34 (2001)
| Abstract |
A proof is given that 0′ is definable in the structure of the degrees of unsolvability. This answers a long-standing question of Kleene and Post, and has a number of corollaries including the definability of the jump operator
|
| Keywords | Computably enumerable degree Turing definable Jump operator Turing degree Computably enumerable set |
| Categories | (categorize this paper) |
| DOI | 10.1002/1521-3870(200101)47:1 |
| Options |
Mark as duplicate
Export citation
Request removal from index
|
Download options
References found in this work BETA
No references found.
Citations of this work BETA
Direct and Local Definitions of the Turing Jump.Richard A. Shore - 2007 - Journal of Mathematical Logic 7 (2):229-262.
Degree Structures: Local and Global Investigations.Richard A. Shore - 2006 - Bulletin of Symbolic Logic 12 (3):369-389.
Local Definitions in Degeree Structures: The Turing Jump, Hyperdegrees and Beyond.Richard A. Shore - 2007 - Bulletin of Symbolic Logic 13 (2):226-239.
Similar books and articles
An Interval of Computably Enumerable Isolating Degrees.Matthew C. Salts - 1999 - Mathematical Logic Quarterly 45 (1):59-72.
On Lachlan’s Major Sub-Degree Problem.S. Barry Cooper & Angsheng Li - 2008 - Archive for Mathematical Logic 47 (4):341-434.
Relative Enumerability and 1-Genericity.Wei Wang - 2011 - Journal of Symbolic Logic 76 (3):897 - 913.
The Computably Enumerable Degrees Are Locally Non-Cappable.Matthew B. Giorgi - 2004 - Archive for Mathematical Logic 43 (1):121-139.
Every Incomplete Computably Enumerable Truth-Table Degree is Branching.Peter A. Fejer & Richard A. Shore - 2001 - Archive for Mathematical Logic 40 (2):113-123.
A Δ02 Set with Barely Σ02 Degree.Rod Downey, Geoffrey Laforte & Steffen Lempp - 1999 - Journal of Symbolic Logic 64 (4):1700 - 1718.
A Minimal Pair Joining to a Plus Cupping Turing Degree.Dengfeng Li & Angsheng Li - 2003 - Mathematical Logic Quarterly 49 (6):553-566.
A $Delta^02$ Set with Barely $Sigma^02$ Degree.Rod Downey, Geoffrey Laforte & Steffen Lempp - 1999 - Journal of Symbolic Logic 64 (4):1700-1718.
Codable Sets and Orbits of Computably Enumerable Sets.Leo Harrington & Robert I. Soare - 1998 - Journal of Symbolic Logic 63 (1):1-28.
Isolation in the CEA Hierarchy.Geoffrey LaForte - 2005 - Archive for Mathematical Logic 44 (2):227-244.
Degree Spectra of the Successor Relation of Computable Linear Orderings.Jennifer Chubb, Andrey Frolov & Valentina Harizanov - 2009 - Archive for Mathematical Logic 48 (1):7-13.
On the Distribution of Lachlan Nonsplitting Bases.S. Barry Cooper, Angsheng Li & Xiaoding Yi - 2002 - Archive for Mathematical Logic 41 (5):455-482.
On Relative Enumerability of Turing Degrees.Shamil Ishmukhametov - 2000 - Archive for Mathematical Logic 39 (3):145-154.
Antibasis Theorems for {\ Pi^ 0_1} Classes and the Jump Hierarchy.Ahmet Çevik - 2013 - Archive for Mathematical Logic 52 (1-2):137-142.
Definability, Automorphisms, and Dynamic Properties of Computably Enumerable Sets.Leo Harrington & Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (2):199-213.
Analytics
Added to PP index
2013-12-01
Total views
12 ( #751,000 of 2,404,066 )
Recent downloads (6 months)
1 ( #550,679 of 2,404,066 )
2013-12-01
Total views
12 ( #751,000 of 2,404,066 )
Recent downloads (6 months)
1 ( #550,679 of 2,404,066 )
How can I increase my downloads?
Downloads
