Publication:2707068
From MaRDI portal
DOI<3::AID-MALQ3>3.0.CO;2-A 10.1002/1521-3870(200101)47:1<3::AID-MALQ3>3.0.CO;2-AzbMath0977.03023MaRDI QIDQ2707068
Publication date: 21 January 2002
Turing degree; Turing definability; computably enumerable set; degrees of unsolvability; definability of the jump operator
03D35: Undecidability and degrees of sets of sentences
03D25: Recursively (computably) enumerable sets and degrees
03D28: Other Turing degree structures
Related Items
Local Definitions in Degree Structures: The Turing Jump, Hyperdegrees and Beyond, Interpolating \(d\)-r.e. and REA degrees between r.e. degrees, A non-splitting theorem for d.r.e. sets, A splitting theorem for $n-REA$ degrees, Degree Structures: Local and Global Investigations, DIRECT AND LOCAL DEFINITIONS OF THE TURING JUMP