Inadmissible forcing
From MaRDI portal
Publication:1102950
DOI10.1016/0001-8708(87)90028-4zbMATH Open0645.03046OpenAlexW4212885787MaRDI QIDQ1102950FDOQ1102950
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
Recommendations
Other aspects of forcing and Boolean-valued models (03E40) Higher-type and set recursion theory (03D65)
Cites Work
- Recursive Functionals and Quantifiers of Finite Types I
- Perfect-set forcing for uncountable cardinals
- Iterated perfect-set forcing
- Forcing with tagged trees
- Countable admissible ordinals and hyperdegrees
- Completely mitotic r. e. degrees
- Recursive Functionals and Quantifiers of Finite Types II
- Computations in higher types
- Uncountable Admissibles I: Forcing
- Title not available (Why is that?)
- The limits of E-recursive enumerability
- Hyperanalytic Predicates
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sacks forcing does not always produce a minimal upper bound
Cited In (11)
- A Note on Conjectures of Calude About the Topological Size of Sets of Partial Recursive Functions
- Continuous relations and generalized $G_δ$ sets
- Plus‐1 Results for E‐Recursion
- On the non-enumerability of \(L\)
- 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
- Forcing and reducibilities. III. Forcing in fragments of set theory
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)
