Cut-Elimination with Depths
Publisher
Springer Singapore
Reference17 articles.
1. Arai, T.: Non-elementary speed-ups in logic calculi. Math. Logic Quat. 54, 629–640 (2008)
2. Arai, T.: Quick cut-elimination for strictly positive cuts. Ann. Pure Appl. Logic 162, 807–815 (2011)
3. Berger, U., Buchholz, W., Schwichtenberg, H.: Refined program extraction from classical proofs. Ann. Pure Appl. Logic 114, 3–25 (2002)
4. Cantini, A.: On the relationship between choice and comprehension principles in second order arithmetic. J. Symb. Logic 52, 360–373 (1986)
5. Friedman, H.: Classically and intuitionistically provable recursive functions. In: Scott, D., Müllerm, G. H. (eds.) Higher Set Theory, pp. 21–28. Lecture Notes in Mathematics, vol. 669. Springer, Berlin (1978)