Recommendations
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?)
- scientific article; zbMATH DE number 3494394 (Why is no real title available?)
- scientific article; zbMATH DE number 3531389 (Why is no real title available?)
- Aspects of constructibility
- Completely mitotic r. e. degrees
- Degrees of unsolvability of constructible sets of integers
- Effective cofinalities and admissibility in E-recursion
- Hyperanalytic Predicates
- Inadmissible forcing
- Negative solutions to Post's problem. II
- Recursive Functionals and Quantifiers of Finite Types II
- Reflection and forcing in E-recursion theory
- The K-Section of a Type n Object
- The definability of E(α)
- The extended plus-one hypothesis—A relative consistency result
- Uncountable admissibles. II: Compactness
- Σ1 compactness for next admissible sets
Cited in
(11)- Another extension of Van de Wiele's theorem
- On the non-enumerability of \(L\)
- Effective cofinalities and admissibility in E-recursion
- SOME CONSEQUENCES OF AD FOR KLEENE RECURSION IN3E
- Effective forcing versus proper forcing
- scientific article; zbMATH DE number 3916251 (Why is no real title available?)
- \(E\)-recursion 2012
- Reflection and forcing in E-recursion theory
- Inadmissible forcing
- \(E\)-recursive intuitions
- scientific article; zbMATH DE number 3981159 (Why is no real title available?)
This page was built for publication: The limits of E-recursive enumerability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1095136)
