Encyclopedia > P > Paris–Harrington theorem
Paris–Harrington theorem
In mathematical logic, the Paris–Harrington theorem states that a certain combinatorial principle in Ramsey theory is true but not provable in Peano arithmetic. This was the first "natural" example of a true statement about the integers that could be stated but not proved in Peano arithmetic; it was already known that such statements existed by Gödel's first incompleteness theorem.
Information are taken from Wikipedia, the open encyclopedia, to which contribute many volunteers from around the whole world. Texts are available under the following conditions GNU Free Documentation License.
Encyklopedie (cz) Encyklopédia (sk) Enzyklopädie (de)