Book contents
- Frontmatter
- Preface
- Contents
- PART I PROOF THEORETIC ANALYSIS
- Ordinal analysis without proofs
- Relating ordinals to proofs in a perspicuous way
- Internal finite tree embeddings
- Foundational and mathematical uses of higher types
- The epsilon substitutionmethod and continuity
- Predicativity: The outer limits
- PART II LOGIC AND COMPUTATION
- PART III APPLICATIVE AND SELF-APPLICATIVE THEORIES
- PART IV PHILOSOPHY OF MODERN MATHEMATICAL AND LOGICAL THOUGHT
- Symposium program
- References
Internal finite tree embeddings
from PART I - PROOF THEORETIC ANALYSIS
Published online by Cambridge University Press: 31 March 2017
Book contents
- Frontmatter
- Preface
- Contents
- PART I PROOF THEORETIC ANALYSIS
- Ordinal analysis without proofs
- Relating ordinals to proofs in a perspicuous way
- Internal finite tree embeddings
- Foundational and mathematical uses of higher types
- The epsilon substitutionmethod and continuity
- Predicativity: The outer limits
- PART II LOGIC AND COMPUTATION
- PART III APPLICATIVE AND SELF-APPLICATIVE THEORIES
- PART IV PHILOSOPHY OF MODERN MATHEMATICAL AND LOGICAL THOUGHT
- Symposium program
- References
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Reflections on the Foundations of MathematicsEssays in Honor of Solomon Feferman, pp. 60 - 91Publisher: Cambridge University PressPrint publication year: 2002
References
[Bu87] , An independence result for _1 1 -CA+BI, Annals of Pure and Applied Logic, vol. 33 (1987), pp. 131-155.Google Scholar
[BCW94], , and , A uniform approach to fundamental sequences and hierarchies, Mathematical Logic Quarterly, vol. 40 (1994), pp. 273-286.Google Scholar
[BFPS81] , ,, and , Iterated inductive definitions and subsystems of analysis: Recent proof-theoretical studies, Springer Lecture Notes inMathematics, vol. 897, Springer, 1981.
[BS88] and , Proof theory of impredicative subsystems of analysis, Bibliopolis, Naples, 1988.
[dJP77] and , Well partial orderings and hierarchies, Indigationes Mathematicae, vol. 39 (1977), pp. 195-206.Google Scholar
[Fe64] , Systems of predicative analysis, The Journal of Symbolic Logic, vol. 29 (1964), pp. 1-30.Google Scholar
[Fe68b] , Autonomous transfinite progressions and the extent of predicative mathematics, Logic, methodology and philosophy of science III ( and , editors), North- Holland, Amsterdam, 1968, pp. 121-135.
[Fe68a] , Systems of predicative analysis, II: Representations of ordinals, The Journal of Symbolic Logic, vol. 33 (1968), pp. 193-220.CrossRefGoogle Scholar
[Fe79] , A more perspicuous formal system for predicativity, Konstruktionen versus Positionen (, editor), Walter de Gruyter, Berlin, 1979, pp. 68-93.
[Fe91] , Reflecting on incompleteness, The Journal of Symbolic Logic, vol. 56 (1991), pp. 1- 49.Google Scholar
[Fe96] , Gödel's program for new axioms: Why, where, how and what?, Gödel –96 (, editor), Lecture Notes in Logic, vol. 6, Association for Symbolic Logic in conjunction with , Ltd., 1996, pp. 3-22.Google Scholar
[FeS00] and , The unfolding of non-finitist arithmetic, Annals of Pure and Applied Logic, vol. 104 (2000), no. 1-3, pp. 75-96.Google Scholar
[Fr81] , Independence results in finite graph theory I-VII, Unpublished manuscripts, Ohio State University, 76 pages, February-March 1981.Google Scholar
[Fr82] , Reyond Kruskal's theorem I-III, Unpublished manuscripts, Ohio State University, 48 pages, June-July 1982.
[Fr84] , Notes on Kruskal's theorem, Unpublished handwritten notes, Ohio State University, 163 pages, 1984.Google Scholar
[Fr98] , 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] , 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] , , and , A combinatorial principle which is equivalent to the 1-consistency of predicative analysis, Patras logic symposion (, editor), Studies in Logic and the Foundations of Mathematics, North-Holland, 1982.
[FRS87] , , and , The metamathematics of the graph minor theorem, Logic and combinatorics, Contemporary Mathematics, vol. 65, American Mathematical Society, 1987, pp. 229-261.
[FS95] and , Elementary descent recursion and proof theory, Annals of Pure and Applied Logic, vol. 71 (1995), pp. 1-45.Google Scholar
[Gor90] , Generalizations of the Kruskal-Friedman Theorems, The Journal of Symbolic Logic, vol. 55 (1990), pp. 157-181.Google Scholar
[HP93] and ,Metamathematics of first-order arithmetic, Perspectives in Mathematical Logic, Springer, 1993.
[HMSS] , , , and (editors), Harvey Friedman's research on the foundations of mathematics, Studies in Logic and the Foundations of Mathematics, vol. 117, North-Holland, 1985.
[Hi52] , Ordering by divisibility in abstract algebras, Proceedings of the LondonMathematical Society, vol. 2 (1952), pp. 326-336.Google Scholar
[Kriz89] ,Well-quasiordering finite trees with gap-condition, Annals ofMathematics, vol. 130 (1989), pp. 215-226.Google Scholar
[Kriz95] , The structure of infinite Friedman trees, Advances inMathematics, vol. 115 (1995), pp. 141-199.Google Scholar
[KT91] and , Ordinal types in Ramsey theory and well-partial-ordering theory, Mathematics of Ramsey theory ( and , editors), Springer, 1991.
[Kr60] ,Well-quasi-ordering, the tree theorem, andVazsonyi's conjecture, Transactions of the American Mathematical Society, vol. 95 (1960), pp. 210-225.Google Scholar
[LM87] and , On undecidability of the weakened Kruskal theorem, Logic and combinatorics, Contemporary Mathematics, vol. 65, American Mathematical Society, 1987, pp. 275- 280.
[NW65] , On well-quasi-ordering finite trees, Proceedings of the Cambridge Philosophical Society, vol. 59 (1965), pp. 105-122.Google Scholar
[RW93] and , Proof-theoretic investigations on Kruskal's theorem, Annals of Pure and Applied Logic, vol. 60 (1993), pp. 49-88.Google Scholar
[Ro84] , Subrecursion: Functions and hierarchies, Oxford Logic Guides, Oxford University Press, 1984.
[Schm79] , Well-partial orderings and their maximal order types, Habilitationsschrift, Heidelberg, 1979.
[Sch54] , Kennzeichnung von Ordnungszahlen durch rekursiv erklärte Funktionen, Mathematische Annalen, vol. 127 (1954), pp. 15-32.Google Scholar
[Sch65] , Predicative well-orderings, Formal systems and recursive functions (Crossley and Dummett, editors), North-Holland, 1965, pp. 176-184.
[Sch77] , Proof theory, Grundlehren der Mathematischen Wisenschaften, no. 225, Springer-Verlag, 1977.
[Si85] , Nonprovability of certain combinatorial properties of finite trees, Harvey Friedman's research on the foundations of mathematics (, M.Morley, , and , editors), Studies in Logic and the Foundations ofMathematics, vol. 117, North-Holland, 1985, pp. 87-117.
[Si99] , Subsystems of second order arithmetic, Perspectives in Mathematical Logic, Springer-Verlag, 1999.
[Sm85] , The consistency strengths of some finite forms of the Higman and Kruskal theorems, Harvey Friedman's research on the foundations of mathematics (, , , and , editors), Studies in Logic and the Foundations ofMathematics, vol. 117, North-Holland, 1985, pp. 119-136.
[Veb08] , Continuous increasing functions of finite and transfinite ordinals, Transactions of the American Mathematical Society, vol. 9 (1908), pp. 280-292.Google Scholar
- 1
- Cited by