e/Paris-Harrington theorem

Information
has gloss	eng: 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 in the language of arithmetic, but not proved in Peano arithmetic; it was already known that such statements existed by Gödel's first incompleteness theorem.
lexicalization	eng: Paris-Harrington theorem
lexicalization	eng: Paris–Harrington theorem
instance of	c/Independence results