Lorenzo Carlucci

发表

Learning correction grammars

John Case, Sanjay Jain, Lorenzo Carlucci, 2007, The Journal of Symbolic Logic.

A Note on Hindman-Type Theorems for Uncountable Cardinals

Lorenzo Carlucci, 2019, Order.

A Note on Ramsey Theorems and Turing Jumps

Lorenzo Carlucci, Konrad Zdanowski, K. Zdanowski, 2012, CiE.

Some cognitively-motivated learning paradigms in algorithmic learning theory

John Case, Lorenzo Carlucci, 2006 .

Learning correction grammars

John Case, Sanjay Jain, Lorenzo Carlucci, 2009 .

Worms, gaps, and hydras

Lorenzo Carlucci, 2005, Math. Log. Q..

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

Massimo Lauria, Lorenzo Carlucci, Nicola Galesi, 2016, ACM Trans. Comput. Log..

Memory-Limited U-Shaped Learning

John Case, Sanjay Jain, Frank Stephan, 2006, COLT.

On the Necessity of U-Shaped Learning

John Case, Lorenzo Carlucci, J. Case, 2013, Top. Cogn. Sci..

Variations on U-shaped learning

Sanjay Jain, Frank Stephan, Efim B. Kinber, 2006, Inf. Comput..

Variations on U-Shaped Learning

Sanjay Jain, Frank Stephan, Efim B. Kinber, 2005, COLT.

Paris-Harrington Tautologies

Massimo Lauria, Lorenzo Carlucci, Nicola Galesi, 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.

U-shaped learning may be necessary 3

John Case, Frank Stephan, Sanjay Jain, 2004 .

Learning with ordinal-bounded memory from positive data

Sanjay Jain, Frank Stephan, Lorenzo Carlucci, 2012, J. Comput. Syst. Sci..

A weak variant of Hindman’s Theorem stronger than Hilbert’s Theorem

Lorenzo Carlucci, 2018, Arch. Math. Log..

New bounds on the strength of some restrictions of Hindman's Theorem

Lorenzo Carlucci, Konrad Zdanowski, Leszek Aleksander Kołodziejczyk, 2020, Comput..

Results on memory-limited U-shaped learning

John Case, Sanjay Jain, Frank Stephan, 2007, Inf. Comput..

Incremental Learning with Ordinal Bounded Example Memory

Lorenzo Carlucci, 2009, ALT.

Non U-Shaped Vacillatory and Team Learning

John Case, Sanjay Jain, Frank Stephan, 2005, ALT.

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

Leszek Aleksander Kolodziejczyk, Lorenzo Carlucci, Konrad Zdanowski, 2017, CiE.

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

Lorenzo Carlucci, L. Carlucci, 2003, Theor. Comput. Sci..

Non-U-shaped vacillatory and team learning

Lorenzo Carlucci, John Case, Sanjay Jain, 2008, J. Comput. Syst. Sci..

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

Michael Rathjen, Lorenzo Carlucci, Leonardo Mainardi, 2019, CiE.

The strength of Ramsey Theorem for coloring relatively large sets pdf

Lorenzo Carlucci, Konrad Zdanowski, K. Zdanowski, 2012, ArXiv.

Sharp thresholds for hypergraph regressive Ramsey numbers

Gyesik Lee, Andreas Weiermann, Lorenzo Carlucci, 2011, J. Comb. Theory, Ser. A.

Upper bounds on positional Paris-Harrington games

Massimo Lauria, Lorenzo Carlucci, Massimo Lauria, 2021, Discret. Math..

Restrictions of Hindman's Theorem: An Overview

Lorenzo Carlucci, 2021, CiE.

CLASSIFYING THE PHASE TRANSITION THRESHOLD FOR REGRESSIVE RAMSEY FUNCTIONS

Gyesik Lee, Andreas Weiermann, Lorenzo Carlucci, 2006 .

Unprovability results involving braids

Patrick Dehornoy, Andreas Weiermann, Lorenzo Carlucci, 2007, 0711.3785.

“Weak yet strong” restrictions of Hindman’s Finite Sums Theorem

Lorenzo Carlucci, L. Carlucci, 2016 .

Long games on braids

Andrey Bovykin, Lorenzo Carlucci, A. Bovykin, 2006 .