Inadmissibility, tame R.E. sets and the admissible collapse

DOI10.1016/0003-4843(78)90002-5zbMATH Open0385.03034OpenAlexW2001977269MaRDI QIDQ4165366FDOQ4165366

Wolfgang Maass

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

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Other degrees and reducibilities in computability and recursion theory (03D30)

Cited In (6)

• Inadmissible recursion theory
• The Role of True Finiteness in the Admissible Recursively Enumerable Degrees
• Inverting the Half-Jump
• Intermediate β-r.e. degrees and the half-jump
• On minimal pairs and minimal degrees in higher recursion theory
• Some jump-like operations in β-recursion theory

This page was built for publication: Inadmissibility, tame R.E. sets and the admissible collapse

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4165366)