Publisher
Springer Science and Business Media LLC
Reference7 articles.
1. H. B. Enderton,An infinitistic rule of proof, J. Symbolic Logic,32 (1967), 447–451.
2. R. Gandy,General recursive functionals of finite type and hierarchies of functions, Symposium on Mathematical Logic at Clermont Ferrand, 1962.
3. A. Grzegorczyk, A. Mostowski and C. Ryll-Nardzewski,The classical and ω-complete arithmetic, J. Symbolic Logic,23 (1958), 188–205.
4. P. Hinman, Hierarchies of effective descriptive set theory, Trans. Amer. Math. Soc.142 (1969), 111–140.
5. S. C. Kleene,Recursive functionals and quantifiers of finite types. I, Trans. Amer. Math. Soc.91 (1959), 1–52.
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Proof of Grilliot's Theorem;Bulletin of the Belgian Mathematical Society - Simon Stevin;2024-04-30
2. Complexity of winning strategies for Δ⁰₂ games;Proceedings of the American Mathematical Society;1993
3. Recursion in Kolmogorov's R-operator and the ordinal σ3;Journal of Symbolic Logic;1986-03
4. Recursion and Nonmonotone Induction in a Quantifier;The Kleene Symposium;1980
5. Recursion in a quantifier vs. elementary induction;Journal of Symbolic Logic;1979-06