![On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies | ACM Transactions on Computational Logic On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies | ACM Transactions on Computational Logic](https://dl.acm.org/cms/asset/0160c26a-0dcd-4643-a23f-81542eb5744d/2996393.cover.jpg)
On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies | ACM Transactions on Computational Logic
AN UNPROVABLE RAMSEY-TYPE THEOREM only. The validity of FRT* for values p , k , n , and N will be denoted in short by N -U (n)&q
![Gödel's Incompleteness Theorems (Elements in Philosophy and Logic): Amazon.co.uk: Kennedy, Juliette: 9781108986991: Books Gödel's Incompleteness Theorems (Elements in Philosophy and Logic): Amazon.co.uk: Kennedy, Juliette: 9781108986991: Books](https://images-eu.ssl-images-amazon.com/images/I/41DhdnBtX8L._AC_UL600_SR600,600_.jpg)