Kanamori-McAloon Theorem
Get Kanamori%E2%80%93McAloon Theorem essential facts below. View Videos or join the Kanamori%E2%80%93McAloon Theorem discussion. Add Kanamori%E2%80%93McAloon Theorem to your PopFlock.com topic list for future reference or share this resource on social media.
Kanamori%E2%80%93McAloon 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

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 article uses material from the Wikipedia page available here. It is released under the Creative Commons Attribution-Share-Alike License 3.0.

Kanamori%E2%80%93McAloon_theorem
 



 



 
Music Scenes