Conjectures and questions from Gerald Sacks's \textit{Degrees of unsolvability}

DOI10.1007/S001530050063zbMath0907.03020OpenAlexW2028097918WikidataQ123110910 ScholiaQ123110910MaRDI QIDQ1387091

Richard A. Shore

Publication date: 9 September 1998

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001530050063

zbMATH Keywords

degrees of unsolvability

Mathematics Subject Classification ID

History of mathematics in the 20th century (01A60) Undecidability and degrees of sets of sentences (03D35) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) History of mathematical logic and foundations (03-03) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (4)

Degrees of Transducibility ⋮ Transducer degrees: atoms, infima and suprema ⋮ The Role of True Finiteness in the Admissible Recursively Enumerable Degrees ⋮ THE THEORY OF THE METARECURSIVELY ENUMERABLE DEGREES

This page was built for publication: Conjectures and questions from Gerald Sacks's \textit{Degrees of unsolvability}