Subject
General Computer Science,Theoretical Computer Science
Reference8 articles.
1. An independence result for (Π11−CA)+BI;Buchholz;Ann. Pure Appl. Logic,1987
2. Provably computable functions and the fast-growing hierarchy;Buchholz,1987
3. A. Cichon, A short proof of two recently discovered independence results using Recursion Theoretic methods, Proc. American Mathematical Society, Vol. 87, 1983, pp. 704–706.
4. A relationship among Gentzen's Proof-Reduction, Kirby–Paris’ Hydra Game and Buchholz's Hydra Game;Hamano;Math. Logic Quart.,1997
5. A direct independence proof of Buchholz's Hydra Game on finite labeled trees;Hamano;Arch. Math. Logic,1998
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Die Another Day;Theory of Computing Systems;2008-03-22
2. Die Another Day;Lecture Notes in Computer Science;2007
3. Worms, gaps, and hydras;MLQ;2005-07