Lorenzo Carlucci

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 10

Top Topics

Relational Database Design

Efficiently Computable

Top Venues

Arch. Math. Log.

ACM Trans. Comput. Log.

Publications

Lorenzo Carlucci, Leonardo Mainardi
Regressive versions of Hindman's theorem. Arch. Math. Log. 63 (3-4) (2024)
Lorenzo Carlucci, Daniele Tavernelli
-induction and the Pigeonhole principle for trees. Arch. Math. Log. 61 (5-6) (2022)
Lorenzo Carlucci
Restrictions of Hindman's Theorem: An Overview. CiE (2021)
Lorenzo Carlucci, Massimo Lauria
Upper bounds on positional Paris-Harrington games. Discret. Math. 344 (3) (2021)
Lorenzo Carlucci, Leszek Aleksander Kolodziejczyk, Francesco Lepore, Konrad Zdanowski
New bounds on the strength of some restrictions of Hindman's Theorem. Comput. 9 (2) (2020)
Lorenzo Carlucci
A Note on Hindman-Type Theorems for Uncountable Cardinals. Order 36 (1) (2019)
Lorenzo Carlucci, Leonardo Mainardi, Michael Rathjen
A Note on the Ordinal Analysis of \mathbf RCA_0 + \mathrm WO(\mathbf σ ) RCA 0 + WO ( σ ). CiE (2019)
Lorenzo Carlucci
A weak variant of Hindman's Theorem stronger than Hilbert's Theorem. Arch. Math. Log. 57 (3-4) (2018)
Lorenzo Carlucci, Leszek Aleksander Kolodziejczyk, Francesco Lepore, Konrad Zdanowski
New Bounds on the Strength of Some Restrictions of Hindman's Theorem. CiE (2017)
Lorenzo Carlucci, Nicola Galesi, Massimo Lauria
On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies. ACM Trans. Comput. Log. 17 (4) (2016)
Lorenzo Carlucci, Konrad Zdanowski
The strength of Ramsey's Theorem for Coloring Relatively Large Sets. J. Symb. Log. 79 (1) (2014)
Lorenzo Carlucci, John Case
On the Necessity of U-Shaped Learning. Top. Cogn. Sci. 5 (1) (2013)
Lorenzo Carlucci, Konrad Zdanowski
The strength of Ramsey Theorem for coloring relatively large sets CoRR (2012)
Lorenzo Carlucci, Sanjay Jain, Frank Stephan
Learning with ordinal-bounded memory from positive data. J. Comput. Syst. Sci. 78 (5) (2012)
Lorenzo Carlucci, Konrad Zdanowski
A Note on Ramsey Theorems and Turing Jumps. CiE (2012)
Lorenzo Carlucci, Gyesik Lee, Andreas Weiermann
Sharp thresholds for hypergraph regressive Ramsey numbers. J. Comb. Theory, Ser. A 118 (2) (2011)
Lorenzo Carlucci, Nicola Galesi, Massimo Lauria
Paris-Harrington Tautologies. Computational Complexity Conference (2011)
Lorenzo Carlucci, Nicola Galesi, Massimo Lauria
Paris-Harrington tautologies. Electron. Colloquium Comput. Complex. 17 (2010)
Lorenzo Carlucci
Incremental Learning with Ordinal Bounded Example Memory. ALT (2009)
Lorenzo Carlucci, John Case, Sanjay Jain
Learning correction grammars. J. Symb. Log. 74 (2) (2009)
Lorenzo Carlucci, John Case, Sanjay Jain, Frank Stephan
Non-U-shaped vacillatory and team learning. J. Comput. Syst. Sci. 74 (4) (2008)
Lorenzo Carlucci, John Case, Sanjay Jain
Learning Correction Grammars. COLT (2007)
Lorenzo Carlucci, John Case, Sanjay Jain, Frank Stephan
Results on memory-limited U-shaped learning. Inf. Comput. 205 (10) (2007)
Lorenzo Carlucci, John Case, Sanjay Jain, Frank Stephan
Memory-Limited U-Shaped Learning. COLT (2006)
Lorenzo Carlucci, Sanjay Jain, Efim B. Kinber, Frank Stephan
Variations on U-shaped learning. Inf. Comput. 204 (8) (2006)
Lorenzo Carlucci
Worms, gaps, and hydras. Math. Log. Q. 51 (4) (2005)
Lorenzo Carlucci, Sanjay Jain, Efim B. Kinber, Frank Stephan
Variations on U-Shaped Learning. COLT (2005)
Lorenzo Carlucci, John Case, Sanjay Jain, Frank Stephan
Non U-Shaped Vacillatory and Team Learning. ALT (2005)
Lorenzo Carlucci
A new proof-theoretic proof of the independence of Kirby-Paris' Hydra Theorem. Theor. Comput. Sci. 300 (1-3) (2003)