Lorenzo Carlucci

According to our database, Lorenzo Carlucci authored at least 24 papers between 2003 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Regressive versions of Hindman's theorem.

Lorenzo Carlucci, Leonardo Mainardi

Arch. Math. Log., May, 2024

2022

Hindman's theorem for sums along the full binary tree, Σ ^0₂-induction and the Pigeonhole principle for trees.

Lorenzo Carlucci, Daniele Tavernelli

Arch. Math. Log., 2022

2021

Upper bounds on positional Paris-Harrington games.

Lorenzo Carlucci, Massimo Lauria

Discret. Math., 2021

Restrictions of Hindman's Theorem: An Overview.

Lorenzo Carlucci

Proceedings of the Connecting with Computability, 2021

2019

A Note on Hindman-Type Theorems for Uncountable Cardinals.

Lorenzo Carlucci

Order, 2019

A Note on the Ordinal Analysis of \mathbf RCA_0 + \mathrm WO(\mathbf σ ) RCA 0 + WO ( σ ).

Lorenzo Carlucci, Leonardo Mainardi, Michael Rathjen

Proceedings of the Computing with Foresight and Industry, 2019

2018

A weak variant of Hindman's Theorem stronger than Hilbert's Theorem.

Lorenzo Carlucci

Arch. Math. Log., 2018

2017

New Bounds on the Strength of Some Restrictions of Hindman's Theorem.

Lorenzo Carlucci, Leszek Aleksander Kolodziejczyk, Francesco Lepore, Konrad Zdanowski

Proceedings of the Unveiling Dynamics and Complexity, 2017

2016

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

Lorenzo Carlucci, Nicola Galesi, Massimo Lauria

ACM Trans. Comput. Log., 2016

2014

The strength of Ramsey's Theorem for Coloring Relatively Large Sets.

Lorenzo Carlucci, Konrad Zdanowski

J. Symb. Log., 2014

2013

On the Necessity of U-Shaped Learning.

Lorenzo Carlucci, John Case

Top. Cogn. Sci., 2013

2012

Learning with ordinal-bounded memory from positive data.

Lorenzo Carlucci, Sanjay Jain, Frank Stephan

J. Comput. Syst. Sci., 2012

The strength of Ramsey Theorem for coloring relatively large sets

Lorenzo Carlucci, Konrad Zdanowski

CoRR, 2012

A Note on Ramsey Theorems and Turing Jumps.

Lorenzo Carlucci, Konrad Zdanowski

Proceedings of the How the World Computes, 2012

2011

Sharp thresholds for hypergraph regressive Ramsey numbers.

Lorenzo Carlucci, Gyesik Lee, Andreas Weiermann

J. Comb. Theory A, 2011

Paris-Harrington Tautologies.

Lorenzo Carlucci, Nicola Galesi, Massimo Lauria

Proceedings of the 26th Annual IEEE Conference on Computational Complexity, 2011

2009

Incremental Learning with Ordinal Bounded Example Memory.

Lorenzo Carlucci

Proceedings of the Algorithmic Learning Theory, 20th International Conference, 2009

2007

Results on memory-limited U-shaped learning.

Lorenzo Carlucci, John Case, Sanjay Jain, Frank Stephan

Inf. Comput., 2007

Learning Correction Grammars.

Lorenzo Carlucci, John Case, Sanjay Jain

Proceedings of the Learning Theory, 20th Annual Conference on Learning Theory, 2007

2006

Memory-Limited U-Shaped Learning.

Lorenzo Carlucci, John Case, Sanjay Jain, Frank Stephan

Proceedings of the Learning Theory, 19th Annual Conference on Learning Theory, 2006

2005

Worms, gaps, and hydras.

Lorenzo Carlucci

Math. Log. Q., 2005

Variations on U-Shaped Learning.

Lorenzo Carlucci, Sanjay Jain, Efim B. Kinber, Frank Stephan

Proceedings of the Learning Theory, 18th Annual Conference on Learning Theory, 2005

Non U-Shaped Vacillatory and Team Learning.

Lorenzo Carlucci, John Case, Sanjay Jain, Frank Stephan

Proceedings of the Algorithmic Learning Theory, 16th International Conference, 2005

2003

A new proof-theoretic proof of the independence of Kirby-Paris' Hydra Theorem.

Lorenzo Carlucci

Theor. Comput. Sci., 2003