On a Conjecture of Kleene and Post

DOI<link itemprop=identifier href="https://doi.org/10.1002/1521-3870(200101)47:1<3::AID-MALQ3>3.0.CO;2-A" /><3::AID-MALQ3>3.0.CO;2-A 10.1002/1521-3870(200101)47:1<3::AID-MALQ3>3.0.CO;2-AzbMath0977.03023OpenAlexW2100268447MaRDI QIDQ2707068

S. Barry Cooper

Publication date: 21 January 2002

Full work available at URL: https://doi.org/10.1002/1521-3870(200101)47:1<3::aid-malq3>3.0.co;2-a

zbMATH Keywords

Turing degreeTuring definabilitycomputably enumerable setdegrees of unsolvabilitydefinability of the jump operator

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Recursively (computably) enumerable sets and degrees (03D25) Other Turing degree structures (03D28)

Related Items (6)

Interpolating \(d\)-r.e. and REA degrees between r.e. degrees ⋮ DIRECT AND LOCAL DEFINITIONS OF THE TURING JUMP ⋮ A splitting theorem for $n-REA$ degrees ⋮ Local Definitions in Degree Structures: The Turing Jump, Hyperdegrees and Beyond ⋮ Degree Structures: Local and Global Investigations ⋮ A non-splitting theorem for d.r.e. sets

This page was built for publication: On a Conjecture of Kleene and Post