Kanamori–McAloon theorem

In mathematical logic, the Kanamori–McAloon theorem, due to Kanamori & McAloon (1987), gives an example of an incompleteness in Peano arithmetic, similar to that of the Paris–Harrington theorem. They showed that a certain finitistic special case of a theorem^[which?] in Ramsey theory due to Erdős and Rado is not provable in Peano arithmetic.

See also[]

• Paris–Harrington theorem
• Goodstein's theorem
• Kruskal's tree theorem

References[]

• Kanamori, Akihiro; McAloon, Kenneth (1987), "On Gödel incompleteness and finite combinatorics", Annals of Pure and Applied Logic, 33 (1): 23–41, doi:10.1016/0168-0072(87)90074-1, ISSN 0168-0072, MR 0870685

This mathematical logic-related article is a stub. You can help Wikipedia by .

• v
• t