The limits of E-recursive enumerability
From MaRDI portal
Publication:1095136
DOI10.1016/0168-0072(86)90064-3zbMath0632.03040OpenAlexW2001479798MaRDI QIDQ1095136
Publication date: 1986
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(86)90064-3
Related Items (3)
Inadmissible forcing ⋮ Effective forcing versus proper forcing ⋮ Reflection and forcing in E-recursion theory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Uncountable admissibles. II: Compactness
- Reflection and forcing in E-recursion theory
- Completely mitotic r. e. degrees
- Inadmissible forcing
- Negative solutions to Post's problem. II
- Aspects of constructibility
- The extended plus-one hypothesis—A relative consistency result
- The definability of E(α)
- Effective cofinalities and admissibility in E-recursion
- The K-Section of a Type n Object
- Σ1 compactness for next admissible sets
- Hyperanalytic Predicates
- Degrees of unsolvability of constructible sets of integers
- Recursive Functionals and Quantifiers of Finite Types II
This page was built for publication: The limits of E-recursive enumerability
