All Stories

  1. New bounds on the strength of some restrictions of Hindman’s Theorem

    Article • Computability, May 2020, IOS Press

    Konrad Zdanowski, Lorenzo Carlucci

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

    Article • ACM Transactions on Computational Logic, November 2016, ACM (Association for Computing Machinery)

    Lorenzo Carlucci