Paris-Harrington theorem

(mathematical logic) A theorem stating that a certain combinatorial principle in Ramsey theory, namely the strengthened finite Ramsey theorem, is true, but not provable in Peano arithmetic.