Lorenzo Carlucci

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