Negative solutions to Post's problem. II
From MaRDI portal
Publication:1152361
DOI10.2307/1971132zbMath0461.03008OpenAlexW2747509665WikidataQ59620026 ScholiaQ59620026MaRDI QIDQ1152361
Publication date: 1981
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1971132
Other degrees and reducibilities in computability and recursion theory (03D30) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items (14)
The limits of E-recursive enumerability ⋮ Degree theory on \(\aleph_\omega\) ⋮ The theory of the \(\alpha \) degrees is undecidable ⋮ Computational processes, observers and Turing incompleteness ⋮ Uncountable master codes and the jump hierarchy ⋮ Finding bases of uncountable free abelian groups is usually difficult ⋮ Tabular degrees in \(\alpha\)-recursion theory ⋮ Intermediate β-r.e. degrees and the half-jump ⋮ Some jump-like operations in β-recursion theory ⋮ Simple r. e. degree structures ⋮ Double jumps of minimal degrees over cardinals ⋮ Some recent developments in higher recursion theory ⋮ COMPUTABILITY IN UNCOUNTABLE BINARY TREES ⋮ Uncountable admissibles. II: Compactness
This page was built for publication: Negative solutions to Post's problem. II