[Bu87] W., Buchholz, An independence result for _1 1 -CA+BI, Annals of Pure and Applied Logic, vol. 33 (1987), pp. 131-155.Google Scholar

[BCW94]W., Buchholz, E.A., Cichon, and A., Weiermann, A uniform approach to fundamental sequences and hierarchies, Mathematical Logic Quarterly, vol. 40 (1994), pp. 273-286.Google Scholar

[BFPS81] W., Buchholz, S., Feferman,W., Pohlers, and W., Sieg, Iterated inductive definitions and subsystems of analysis: Recent proof-theoretical studies, Springer Lecture Notes inMathematics, vol. 897, Springer, 1981.

[BS88] W., Buchholz and K., Schütte, Proof theory of impredicative subsystems of analysis, Bibliopolis, Naples, 1988.

[dJP77] D.H.J., de Jong and R., Parikh, Well partial orderings and hierarchies, Indigationes Mathematicae, vol. 39 (1977), pp. 195-206.Google Scholar

[Fe64] S., Feferman, Systems of predicative analysis, The Journal of Symbolic Logic, vol. 29 (1964), pp. 1-30.Google Scholar

[Fe68b] S., Feferman, Autonomous transfinite progressions and the extent of predicative mathematics, Logic, methodology and philosophy of science III (B., van Rootselaar and J.F., Staal, editors), North- Holland, Amsterdam, 1968, pp. 121-135.

[Fe68a] S., Feferman, Systems of predicative analysis, II: Representations of ordinals, The Journal of Symbolic Logic, vol. 33 (1968), pp. 193-220.CrossRefGoogle Scholar

[Fe79] S., Feferman, A more perspicuous formal system for predicativity, Konstruktionen versus Positionen (K., Lorenz, editor), Walter de Gruyter, Berlin, 1979, pp. 68-93.

[Fe91] S., Feferman, Reflecting on incompleteness, The Journal of Symbolic Logic, vol. 56 (1991), pp. 1- 49.Google Scholar

[Fe96] S., Feferman, Gödel's program for new axioms: Why, where, how and what?, Gödel –96 (P., Hajek, editor), Lecture Notes in Logic, vol. 6, Association for Symbolic Logic in conjunction with A.K., Peters, Ltd., 1996, pp. 3-22.Google Scholar

[FeS00] S., Feferman and T., Strahm, The unfolding of non-finitist arithmetic, Annals of Pure and Applied Logic, vol. 104 (2000), no. 1-3, pp. 75-96.Google Scholar

[Fr81] H., Friedman, Independence results in finite graph theory I-VII, Unpublished manuscripts, Ohio State University, 76 pages, February-March 1981.Google Scholar

[Fr82] H., Friedman, Reyond Kruskal's theorem I-III, Unpublished manuscripts, Ohio State University, 48 pages, June-July 1982.

[Fr84] H., Friedman, Notes on Kruskal's theorem, Unpublished handwritten notes, Ohio State University, 163 pages, 1984.Google Scholar

[Fr98] H., Friedman, 22:finite trees/predicativity, FOM e-mail posting, http://www.math.psu.edu/simpson/fom/ and http://www.math.ohio-state.edu/foundations/manuscripts.html, October 1998.

[Fr99] H., Friedman, 27:finite trees/predicativity:sketches, FOM e-mail posting, http://www.math.psu.edu/simpson/fom/ and http://www.math.ohio-state.edu/foundations/manuscripts.html, January 1999.

[FMS82] H., Friedman, K., McAloon, and S., Simpson, A combinatorial principle which is equivalent to the 1-consistency of predicative analysis, Patras logic symposion (G., Metakides, editor), Studies in Logic and the Foundations of Mathematics, North-Holland, 1982.

[FRS87] H., Friedman, N., Robertson, and P., Seymour, The metamathematics of the graph minor theorem, Logic and combinatorics, Contemporary Mathematics, vol. 65, American Mathematical Society, 1987, pp. 229-261.

[FS95] H., Friedman and M., Sheard, Elementary descent recursion and proof theory, Annals of Pure and Applied Logic, vol. 71 (1995), pp. 1-45.Google Scholar

[Gor90] L., Gordeev, Generalizations of the Kruskal-Friedman Theorems, The Journal of Symbolic Logic, vol. 55 (1990), pp. 157-181.Google Scholar

[HP93] P., Hajek and P., Pudlak,Metamathematics of first-order arithmetic, Perspectives in Mathematical Logic, Springer, 1993.

[HMSS] L., Harrington, M., Morley, A., Scedrov, and S., Simpson (editors), Harvey Friedman's research on the foundations of mathematics, Studies in Logic and the Foundations of Mathematics, vol. 117, North-Holland, 1985.

[Hi52] L., Harrington, Ordering by divisibility in abstract algebras, Proceedings of the LondonMathematical Society, vol. 2 (1952), pp. 326-336.Google Scholar

[Kriz89] I., Kriz,Well-quasiordering finite trees with gap-condition, Annals ofMathematics, vol. 130 (1989), pp. 215-226.Google Scholar

[Kriz95] I., Kriz, The structure of infinite Friedman trees, Advances inMathematics, vol. 115 (1995), pp. 141-199.Google Scholar

[KT91] I., Kriz and R., Thomas, Ordinal types in Ramsey theory and well-partial-ordering theory, Mathematics of Ramsey theory (J., Nesetril and V., Rödl, editors), Springer, 1991.

[Kr60] J.B., Kruskal,Well-quasi-ordering, the tree theorem, andVazsonyi's conjecture, Transactions of the American Mathematical Society, vol. 95 (1960), pp. 210-225.Google Scholar

[LM87] M., Loebl and J., Matousek, On undecidability of the weakened Kruskal theorem, Logic and combinatorics, Contemporary Mathematics, vol. 65, American Mathematical Society, 1987, pp. 275- 280.

[NW65] C.St.J.A., Nash-Williams, On well-quasi-ordering finite trees, Proceedings of the Cambridge Philosophical Society, vol. 59 (1965), pp. 105-122.Google Scholar

[RW93] M., Rathjen and A., Weiermann, Proof-theoretic investigations on Kruskal's theorem, Annals of Pure and Applied Logic, vol. 60 (1993), pp. 49-88.Google Scholar

[Ro84] H.E., Rose, Subrecursion: Functions and hierarchies, Oxford Logic Guides, Oxford University Press, 1984.

[Schm79] D., Schmidt, Well-partial orderings and their maximal order types, Habilitationsschrift, Heidelberg, 1979.

[Sch54] K., Schütte, Kennzeichnung von Ordnungszahlen durch rekursiv erklärte Funktionen, Mathematische Annalen, vol. 127 (1954), pp. 15-32.Google Scholar

[Sch65] D., Schmidt, Predicative well-orderings, Formal systems and recursive functions (Crossley and Dummett, editors), North-Holland, 1965, pp. 176-184.

[Sch77] D., Schmidt, Proof theory, Grundlehren der Mathematischen Wisenschaften, no. 225, Springer-Verlag, 1977.

[Si85] S.G., Simpson, Nonprovability of certain combinatorial properties of finite trees, Harvey Friedman's research on the foundations of mathematics (L., Harrington, M.Morley, A., Scedrov, and S., Simspon, editors), Studies in Logic and the Foundations ofMathematics, vol. 117, North-Holland, 1985, pp. 87-117.

[Si99] S.G., Simpson, Subsystems of second order arithmetic, Perspectives in Mathematical Logic, Springer-Verlag, 1999.

[Sm85] R.L., Smith, The consistency strengths of some finite forms of the Higman and Kruskal theorems, Harvey Friedman's research on the foundations of mathematics (L., Harrington, M., Morley, A., Scedrov, and S., Simspon, editors), Studies in Logic and the Foundations ofMathematics, vol. 117, North-Holland, 1985, pp. 119-136.

[Veb08] O., Veblen, Continuous increasing functions of finite and transfinite ordinals, Transactions of the American Mathematical Society, vol. 9 (1908), pp. 280-292.Google Scholar