Abstract
We use the Boyer-Moore Prover, Nqthm, to verify the Paris-Harrington version of Ramsey's theorem. The proof we verify is a modification of the one given by Ketonen and Solovay. The theorem is not provable in Peano Arithmetic, and one key step in the proof requires ε0 induction.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Basin, D. and Kaufmann, M.: The Boyer-Moore Prover and Nuprl: An Experimental Comparison, Technical Report #58, Computational Logic, Inc., 1990.
Boyer, R. S. and Moore, J. S.:A Computational Logic Handbook, Academic Press, New York, 1988.
Gentzen, G.: Die Widerspruchsfreiheit der reinen Zahlentheorie,Mathematische Annalen 112 (1936), 493–565.
Ketonen, J. and Solovay, R.: Rapidly growing Ramsey functions,Annals of Math. 113 (1981), 267–314.
Paris, J. and Harrington, L.: A mathematical incompleteness in Peano arithmetic, in J. Barwise (ed.),Handbook of Mathematical Logic, North-Holland, Amsterdam, 1978, pp. 1133–1142.
Author information
Authors and Affiliations
Additional information
Author supported by NSF Grant DMS-9100665.
Rights and permissions
About this article
Cite this article
Kunen, K. A Ramsey theorem in Boyer-Moore logic. J Autom Reasoning 15, 217–235 (1995). https://doi.org/10.1007/BF00881917
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00881917