Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference3 articles.
1. Some bounds for the Ramsey-Paris-Harrington numbers;Erdős;J. Combin. Theory Ser. A,1981
2. Some graph theoretic results associated with Ramsey's theorem;Graver;J. Combin. Theory,1968
3. A mathematical incompleteness in Peano arithmetic;Paris,1977
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Upper bounds on positional Paris–Harrington games;Discrete Mathematics;2021-03
2. On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies;ACM Transactions on Computational Logic;2016-11-15
3. Paris-Harrington Tautologies;2011 IEEE 26th Annual Conference on Computational Complexity;2011-06
4. Regressive Ramsey Numbers Are Ackermannian;Journal of Combinatorial Theory, Series A;1999-04