Paris-Harrington theorem

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English

[edit]

Etymology

[edit]

Named after Jeff Paris and Leo Harrington, who carried out work on this topic.

Proper noun

[edit]

the Paris-Harrington theorem

  1. (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.

Further reading

[edit]