Some recent developments in higher recursion theory
From MaRDI portal
Publication:3342550
DOI10.2307/2273455zbMath0549.03032OpenAlexW2171757169MaRDI QIDQ3342550
Publication date: 1983
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2273455
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Other combinatorial set theory (03E05) Other aspects of forcing and Boolean-valued models (03E40) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Logic on admissible sets (03C70)
Related Items
Cites Work
- Uncountable admissibles. II: Compactness
- Countable admissible ordinals and hyperdegrees
- Negative solutions to Post's problem. II
- Perfect-set forcing for uncountable cardinals
- Some applications of Jensen's coding theorem
- Steel forcing and barwise compactness
- Scott sentences and admissible sets
- Forcing with tagged trees
- The fine structure of the constructible hierarchy
- Unnamed Item