Abstract
Gödel’s paper on formally undecidable propositions in first order Peano arithmetic (Gödel 1931) showed that any recursive axiomatic system containing Peano arithmetic still admits propositions which are not decidable. Gödel’s original example of such a proposition was not that illuminating. It was merely a kind of formalization of the well known antinomy of the liar. This raised the problem to look for intuitively meaningful propositions which are independent of Peano arithmetic.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Buchholz, W., Wainer, S.: Provably computable functions and the fast growing hierarchy. In: Logic and Combinatorics (Arcata, Calif., 1985), pp. 179–198. American Mathematical Society, Providence (1987)
Erdős, P., Rado, R.: A combinatorial theorem. J. Lond. Math. Soc. 25, 249–255 (1950)
Gödel, K.: Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme. Monatsh. Math. Phys. 38, 173–198 (1931)
Hardy, G.: A theorem concerning the infinite cardinal numbers. Quart J Math 35, 87–94 (1904)
Jech, T.: Set Theory. Pure and Applied Mathematics. Springer, Berlin (1978)
Ketonen, J., Solovay, R.: Rapidly growing Ramsey functions. Ann. Math. 113, 267–314 (1981)
Loebl, M., Nešetřil, J.: Fast and slow growing (a combinatorial study of unprovability). In: Surveys in Combinatorics, 1991 (Guildford, 1991), pp. 119–160. Cambridge University Press, Cambridge (1991)
Paris, J., Harrington, L.: A mathematical incompleteness in Peano arithmetic. In: Barwise, J. (ed.) Handbook of Mathematical Logic, pp. 1133–1142. North Holland, Amsterdam (1977)
Prömel, H.J., Thumser, W., Voigt, B.: Fast growing functions based on Ramsey theorems. Discrete Math. 95, 341–358 (1991)
Schütte, K.: Proof Theory. Springer, Berlin (1977). Translated from the revised German edition by J. N. Crossley
Wainer, S.S.: A classification of the ordinal recursive functions. Arch. Math. Log. Grundl. 13, 136–153 (1970)
Wainer, S.S.: Ordinal recursion, and a refinement of the extended Grzegorczyk hierarchy. J. Symb. Log. 37, 281–292 (1972)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Prömel, H.J. (2013). Rapidly Growing Ramsey Functions. In: Ramsey Theory for Discrete Structures. Springer, Cham. https://doi.org/10.1007/978-3-319-01315-2_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-01315-2_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-01314-5
Online ISBN: 978-3-319-01315-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)