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
Predicativity: The outer limits
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. 130 - 136Publisher: Cambridge University PressPrint publication year: 2002
References
[1] , , and , On the strength of König's duality theorem for infinite bipartite graphs, Journal of Combinatorial Theory, Series B, vol. 54 (1992), pp. 257-290.Google Scholar
[2] , , , and (editors), Logical Methods, Birkhäuser, 1993, 813 pages.
[3] , Systems of predicative analysis, I, The Journal of Symbolic Logic, vol. 29 (1964), pp. 1-30.Google Scholar
[4] , Systems of predicative analysis, II, The Journal of Symbolic Logic, vol. 33 (1968), pp. 193-220.Google Scholar
[5] , Predicatively reducible systems of set theory, [18, part 2], 1974, pp. 11-32.
[6] , A more perspicuous formal system for predicativity, [15, volume I], 1978, pp. 68-93.
[7] , Reflecting on incompleteness, The Journal of Symbolic Logic, vol. 56 (1991), pp. 1-49.Google Scholar
[8] , Does mathematics need new axioms?, AmericanMathematicalMonthly, vol. 106 (1999), pp. 99-111.Google Scholar
[9] , Metamathematics of Ulm theory, June 24, 1999, unpublished, 34 pages.
[10] , Systems of second order arithmetic with restricted induction, I, II (abstracts), The Journal of Symbolic Logic, vol. 41 (1976), pp. 557-559.Google Scholar
[11] , , and , A finite combinatorial principle which is equivalent to the 1-consistency of predicative analysis, [17], 1982, pp. 197-230.
[12] , , and , The metamathematics of the graph minor theorem, [20], 1987, pp. 229-261.
[13] , , , and (editors), Harvey Friedman's Research on the Foundations of Mathematics, Studies in Logic and the Foundations of Mathematics, North-Holland, 1985, XVI + 408 pages.
[14] , Infinite Abelian Groups, revised ed., University of Michigan Press, 1969, VII + 95 pages.
[15] (editor), Konstruktionen versus Positionen, beiträge zur Diskussion um die Konstruktive Wissenschaftstheorie, Walter de Gruyter, Berlin, 1978, Volume I, XX + 350 pages, Volume II, X + 406 pages.
[16] , Foundations of BQO theory, Transactions of the American Mathematical Society, vol. 345 (1994), pp. 641-660.Google Scholar
[17] (editor), Patras Logic Symposion, Studies in Logic and the Foundations of Mathematics, North-Holland, 1982, IX + 391 pages.
[18] and (editors), Axiomatic Set Theory, Proceedings of Symposia in Pure Mathematics, vol. XIII, American Mathematical Society, 1971-1974, Part 1, VI + 474 pages, Part 2, VI + 222 pages.
[19] , On the strength of Fraıssé's conjecture, [2], 1993, pp. 782-813.
[20] (editor), Logic and Combinatorics, Contemporary Mathematics, American Mathematical Society, 1987, XI + 394 pages.Google Scholar
[21] , Set theoretic aspects of ATR0, [27], 1982, pp. 255-271.
[23] , Nonprovability of certain combinatorial properties of finite trees, [13], 1985, pp. 87- 117.
[24] , Unprovable theorems and fast growing functions, [20], 1987, pp. 359-394.
[25] , On the strength of König's duality theorem for countable bipartite graphs, The Journal of Symbolic Logic, vol. 59 (1994), pp. 113-123.Google Scholar
[26] , Subsystems of Second Order Arithmetic, Perspectives in Mathematical Logic, Springer-Verlag, 1999, XIV + 445 pages.
[27] , , and (editors), Logic Colloquium –80, Studies in Logic and the Foundations of Mathematics, North-Holland, 1982, X + 342 pages.
- 2
- Cited by