Unprovable combinatorial statements (Q1201266)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Unprovable combinatorial statements |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Unprovable combinatorial statements |
scientific article |
Statements
Unprovable combinatorial statements (English)
0 references
17 January 1993
0 references
Via an inequality between two families of canonical functions, some unprovability theorems (on Kruskal's theorem, on Goodstein sequences and on the Hydra game) are reduced to Wainer's theorem, i.e., that the totality of a sufficiently fast growing function cannot be proved.
0 references
unprovable combinatorial statements in Peano arithmetic
0 references
fast growing function
0 references
finite Ramsey theorem
0 references
unprovability
0 references
Kruskal's theorem
0 references
Goodstein sequences
0 references
Hydra game
0 references
Wainer's theorem
0 references
0 references
