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

Lorenzo Carlucci, Nicola Galesi, Massimo Lauria (2016)

Details and statistics

DOI: 10.1145/2946801

access: closed

type: Journal Article

metadata version: 2022-08-16

a service of  Schloss Dagstuhl - Leibniz Center for Informatics