Publisher
Springer International Publishing
Reference15 articles.
1. Dershowitz, N. (1987). Termination of rewriting. Journal of Symbolic Computation, 3(1–2), 69–116.
2. Friedman, H., McAloon, K., & Simpson, S. (1982). A finite combinatorial principle which is equivalent to the 1 consistency of predicative analysis. In G. Metakides (Ed.), Logic Symposium I (Patras 1980) (pp. 197–230). Amsterdam: North-Holland.
3. Gallier, J. H. (1991). What’s so special about Kruskal’s theorem and the ordinal $$\Gamma _{0}$$? A survey of some results in proof theory. APAL, 53, 199–260.
4. Gordeev, L. (1989). Systems of iterated projective ordinal notations and combinatorial statements about binary labeled trees. Archive for Mathematical Logic, 29, 29–46.
5. Gordeev, L. (1989). Generalizations of the one-dimensional version of the Kruskal-Friedman theorems. The Journal of Symbolic Logic, 54(1), 100–121.