Rapidly Growing Ramsey Functions

Hans Jürgen Prömel
Additional contact information
Hans Jürgen Prömel: Technische Universität Darmstadt

Chapter Chapter 8 in Ramsey Theory for Discrete Structures, 2013, pp 97-103 from Springer

Abstract: 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 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.

Keywords: Peano Arithmetic; Recursive Axiomatic System; Hardy Hierarchy; Classical Ramsey Theorem; Cantor Normal Form (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-319-01315-2_8

Ordering information: This item can be ordered from
http://www.springer.com/9783319013152

DOI: 10.1007/978-3-319-01315-2_8

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().