Inadmissible forcing

DOI10.1016/0001-8708(87)90028-4MaRDI QIDQ1102950zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Forcing and reducibilities. III. Forcing in fragments of set theory
• Reflection and forcing in E-recursion theory
• Forcing in admissible sets
• \(E\)-recursion 2012
• Plus‐1 Results for E‐Recursion

Cites work

• scientific article; zbMATH DE number 3912367 (Why is no real title available?)
• scientific article; zbMATH DE number 3685474 (Why is no real title available?)
• scientific article; zbMATH DE number 3739516 (Why is no real title available?)
• Completely mitotic r. e. degrees
• Computations in higher types
• Countable admissible ordinals and hyperdegrees
• Forcing with tagged trees
• Hyperanalytic Predicates
• Iterated perfect-set forcing
• Perfect-set forcing for uncountable cardinals
• Recursive Functionals and Quantifiers of Finite Types I
• Recursive Functionals and Quantifiers of Finite Types II
• Sacks forcing does not always produce a minimal upper bound
• The limits of E-recursive enumerability
• Uncountable Admissibles I: Forcing

Cited in

(11)

• Forcing and reducibilities. III. Forcing in fragments of set theory
• A Note on Conjectures of Calude About the Topological Size of Sets of Partial Recursive Functions
• Continuous relations and generalized $G_δ$ sets
• On the non-enumerability of \(L\)
• Plus‐1 Results for E‐Recursion
• Rudimentary recursion, gentle functions and provident sets
• The extended plus-one hypothesis—A relative consistency result
• Successor levels of the Jensen hierarchy
• Forcing in admissible sets
• Reflection and forcing in E-recursion theory
• The limits of E-recursive enumerability

This page was built for publication: Inadmissible forcing

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