Inadmissible forcing
From MaRDI portal
Publication:1102950
DOI10.1016/0001-8708(87)90028-4zbMath0645.03046MaRDI QIDQ1102950
Theodore A. Slaman, Gerald E. Sacks
Publication date: 1987
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0001-8708(87)90028-4
03E40: Other aspects of forcing and Boolean-valued models
03D65: Higher-type and set recursion theory
Related Items
Reflection and forcing in E-recursion theory, The limits of E-recursive enumerability, The extended plus-one hypothesis—A relative consistency result
Cites Work
- Completely mitotic r. e. degrees
- The limits of E-recursive enumerability
- Sacks forcing does not always produce a minimal upper bound
- Countable admissible ordinals and hyperdegrees
- Computations in higher types
- Recursive Functionals and Quantifiers of Finite Types I
- Iterated perfect-set forcing
- Perfect-set forcing for uncountable cardinals
- Uncountable Admissibles I: Forcing
- Forcing with tagged trees
- Hyperanalytic Predicates
- Recursive Functionals and Quantifiers of Finite Types II
- Unnamed Item
- Unnamed Item
- Unnamed Item