排序方式： 共有1条查询结果，搜索用时 0 毫秒
1
1.
Kenneth Kunen 《Journal of Automated Reasoning》1995,15(2):217-235
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.Author supported by NSF Grant DMS-9100665. 相似文献
1