Reflection and forcing in E-recursion theory

DOI10.1016/0168-0072(85)90036-3zbMath0574.03034OpenAlexW1968293668MaRDI QIDQ1062978

Theodore A. Slaman

Publication date: 1985

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(85)90036-3

zbMATH Keywords

definability

Mathematics Subject Classification ID

Inner models, including constructibility, ordinal definability, and core models (03E45) 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 ⋮ Another extension of Van de Wiele's theorem ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• The limits of E-recursive enumerability
• Inadmissible forcing
• Countable admissible ordinals and hyperdegrees
• Recursive Functionals and Quantifiers of Finite Types I
• Effective cofinalities and admissibility in E-recursion
• Plus‐1 Results for E‐Recursion
• The K-Section of a Type n Object
• Hyperanalytic Predicates
• Recursive Functionals and Quantifiers of Finite Types II

This page was built for publication: Reflection and forcing in E-recursion theory