Some recent developments in higher recursion theory
From MaRDI portal
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Other combinatorial set theory (03E05) Other aspects of forcing and Boolean-valued models (03E40) Logic on admissible sets (03C70)
Recommendations
Cites work
- scientific article; zbMATH DE number 3887608 (Why is no real title available?)
- Countable admissible ordinals and hyperdegrees
- Forcing with tagged trees
- Negative solutions to Post's problem. II
- Perfect-set forcing for uncountable cardinals
- Scott sentences and admissible sets
- Some applications of Jensen's coding theorem
- Steel forcing and barwise compactness
- The fine structure of the constructible hierarchy
- Uncountable admissibles. II: Compactness
Cited in
(4)
This page was built for publication: Some recent developments in higher recursion theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3342550)