Inadmissibility, tame R.E. sets and the admissible collapse
From MaRDI portal
Publication:4165366
DOI10.1016/0003-4843(78)90002-5zbMath0385.03034OpenAlexW2001977269MaRDI QIDQ4165366
Publication date: 1978
Published in: Annals of Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0003-4843(78)90002-5
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
Inverting the Half-Jump ⋮ Intermediate β-r.e. degrees and the half-jump ⋮ Some jump-like operations in β-recursion theory ⋮ On minimal pairs and minimal degrees in higher recursion theory ⋮ Inadmissible recursion theory ⋮ The Role of True Finiteness in the Admissible Recursively Enumerable Degrees