Author:
Afshari Bahareh,Rathjen Michael
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Afshari, B.: Relative computability and the proof-theoretic strength of some theories, Ph.D. Thesis, University of Leeds, U.K. (2008)
2. Friedman, H., McAloon, K., Simpson, S.: A finite combinatorial principle equivalent to the 1-consistency of predicative analysis. In: Metakides, G. (ed.) Patras Logic Symposion, pp. 197–230. North-Holland (1982)
3. Hinman, P.G.: Recursion-theoretic hierarchies. Springer, Heidelberg (1978)
4. Jäger, G.: Theories for iterated jumps (1980) (unpublished notes)
5. Jockusch, C.G.: Ramsey’s theorem and recursion theory. Journal of Symbolic Logic 37, 268–280 (1972)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献