Pubblicazioni

On the proof complexity of Paris-harrington and off-diagonal ramsey tautologies

2016 - ACM TRANSACTIONS ON COMPUTATIONAL LOGIC
Carlucci, Lorenzo; Galesi, Nicola; Lauria, Massimo

Narrow proofs may be maximally long

2016 - ACM TRANSACTIONS ON COMPUTATIONAL LOGIC
Atserias, Albert; Lauria, Massimo; Nordström, Jakob

© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma