A new proof-theoretic proof of the independence of Kirby-Paris' Hydra Theorem. - Lorenzo Carlucci (Theor. Comput. Sci., 2003)

Worms, gaps, and hydras. - Lorenzo Carlucci (Math. Log. Q., 2005)

Memory-Limited U-Shaped Learning. - Lorenzo Carlucci; John Case; Sanjay Jain 001; Frank Stephan 001 (COLT, 2006)

Variations on U-shaped learning. - Lorenzo Carlucci; Sanjay Jain 001; Efim B. Kinber; Frank Stephan 001 (Inf. Comput., 2006)

Results on memory-limited U-shaped learning. - Lorenzo Carlucci; John Case; Sanjay Jain 001; Frank Stephan 001 (Inf. Comput., 2007)

Non-U-shaped vacillatory and team learning. - Lorenzo Carlucci; John Case; Sanjay Jain 001; Frank Stephan 001 (J. Comput. Syst. Sci., 2008)

Incremental Learning with Ordinal Bounded Example Memory. - Lorenzo Carlucci (ALT, 2009)

Learning correction grammars. - Lorenzo Carlucci; John Case; Sanjay Jain 001 (J. Symb. Log., 2009)

Paris-Harrington tautologies. - Lorenzo Carlucci; Nicola Galesi; Massimo Lauria (Electron. Colloquium Comput. Complex., 2010)

Sharp thresholds for hypergraph regressive Ramsey numbers. - Lorenzo Carlucci; Gyesik Lee; Andreas Weiermann (J. Comb. Theory A, 2011)

A Note on Ramsey Theorems and Turing Jumps. - Lorenzo Carlucci; Konrad Zdanowski (CiE, 2012)

The strength of Ramsey Theorem for coloring relatively large sets - Lorenzo Carlucci; Konrad Zdanowski (CoRR, 2012)

Learning with ordinal-bounded memory from positive data. - Lorenzo Carlucci; Sanjay Jain 001; Frank Stephan 001 (J. Comput. Syst. Sci., 2012)

On the Necessity of U-Shaped Learning. - Lorenzo Carlucci; John Case (Top. Cogn. Sci., 2013)

The strength of Ramsey's Theorem for Coloring Relatively Large Sets. - Lorenzo Carlucci; Konrad Zdanowski (J. Symb. Log., 2014)

On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies. - Lorenzo Carlucci; Nicola Galesi; Massimo Lauria (ACM Trans. Comput. Log., 2016)

A weak variant of Hindman's Theorem stronger than Hilbert's Theorem. - Lorenzo Carlucci (Arch. Math. Log., 2018)

A Note on the Ordinal Analysis of mathbf RCA_0 + mathrm WO( mathbf σ ) RCA 0 + WO ( σ ). - Lorenzo Carlucci; Leonardo Mainardi; Michael Rathjen (CiE, 2019)

A Note on Hindman-Type Theorems for Uncountable Cardinals. - Lorenzo Carlucci (Order, 2019)

New bounds on the strength of some restrictions of Hindman's Theorem. - Lorenzo Carlucci; Leszek Aleksander Kolodziejczyk; Francesco Lepore; Konrad Zdanowski (Comput., 2020)

Restrictions of Hindman's Theorem: An Overview. - Lorenzo Carlucci (CiE, 2021)

Upper bounds on positional Paris-Harrington games. - Lorenzo Carlucci; Massimo Lauria (Discret. Math., 2021)

Hindman's theorem for sums along the full binary tree, Σ 02-induction and the Pigeonhole principle for trees. - Lorenzo Carlucci; Daniele Tavernelli (Arch. Math. Log., 2022)

Regressive versions of Hindman's theorem. - Lorenzo Carlucci; Leonardo Mainardi (Arch. Math. Log., 2024)