On the Proof Complexity of Paris-Harrington and...

ACM Transactions on Computational Logic 2016 / 09 Vol. 17; Iss. 4

On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies

Carlucci, Lorenzo, Galesi, Nicola, Lauria, Massimo
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
17
Language:
english
Journal:
ACM Transactions on Computational Logic
DOI:
10.1145/2946801
Date:
September, 2016
File:
PDF, 322 KB
english, 2016
Conversion to is in progress
Conversion to is failed