Inadmissible forcing

DOI10.1016/0001-8708(87)90028-4zbMath0645.03046OpenAlexW4212885787MaRDI QIDQ1102950

Gerald E. Sacks, Theodore A. Slaman

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

zbMATH Keywords

forcingE-recursive functionsrecursively closed sets

Mathematics Subject Classification ID

Other aspects of forcing and Boolean-valued models (03E40) Higher-type and set recursion theory (03D65)

Related Items (3)

The limits of E-recursive enumerability ⋮ The extended plus-one hypothesis—A relative consistency result ⋮ Reflection and forcing in E-recursion theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Inadmissible forcing