Sciweavers

ECCC
2010
72views more  ECCC 2010»
13 years 11 months ago
Paris-Harrington tautologies
We initiate the study of the proof complexity of propositional encoding of (weak cases of) concrete independence results. In particular we study the proof complexity of Paris-Harr...
Lorenzo Carlucci, Nicola Galesi, Massimo Lauria