CARLUCCI, LORENZO

CARLUCCI, LORENZO  

DIPARTIMENTO DI MATEMATICA  

Mostra prodotti
Risultati 1 - 20 di 29 (tempo di esecuzione: 0.047 secondi).
Titolo Data di pubblicazione Autore(i) File
"Weak yet strong" restrictions of Hindman's Finite Sums Theorem 2018 Carlucci, Lorenzo
A new proof-theoretic proof of the independence of Kirby-Paris' Hydra Theorem 2003 Carlucci, Lorenzo
A note on Hindman-Type Theorems for uncountable cardinals 2019 Carlucci, Lorenzo
A note on Ramsey theorems and Turing jumps 2012 Carlucci, Lorenzo; Konrad, Zdanowski
A note on the ordinal analysis of RCA0 + WO(σ) 2019 Carlucci, Lorenzo; Mainardi, Leonardo; Rathjen, Michael
A weak variant of Hindman’s Theorem stronger than Hilbert’s Theorem 2018 Carlucci, Lorenzo
Hindman's theorem for sums along the full binary tree, Sigma02-induction and the Pigeonhole principle for trees 2022 Carlucci, Lorenzo; Tavernelli, Daniele
Incremental Learning with Ordinal Bounded Example Memory 2009 Carlucci, Lorenzo
Learning Correction Grammars 2007 Carlucci, Lorenzo; J., Case; S., Jain
LEARNING CORRECTION GRAMMARS 2009 Carlucci, Lorenzo; John, Case; Sanjay, Jain
Learning with ordinal-bounded memory from positive data 2012 Carlucci, Lorenzo; Jain, Sanjay; Stephan, Frank
Memory-Limited U-shaped Learning 2006 Carlucci, Lorenzo; J., Case; S., Jain; F., Stephan
New Bounds on the Strength of Some Restrictions of Hindman’s Theorem 2020 Carlucci, Lorenzo; Aleksander Kolodziejczyk, Leszek; Lepore, Francesco; Zdanowski, Konrad
New bounds on the strength of some restrictions of Hindman’s Theorem 2017 Carlucci, Lorenzo; Aleksander Kolodziejczyk, Leszek; Lepore, Francesco; Zdanowski, Konrad
Non U-shaped Vacillatory and Team Learning 2005 Carlucci, Lorenzo; J., Case; S., Jain; F., Stephan
Non-U-shaped vacillatory and team learning 2008 Carlucci, Lorenzo; John, Case; Sanjay, Jain; Frank, Stephan
On the Necessity of U-Shaped Learning 2013 Carlucci, Lorenzo; John, Case
On the proof complexity of Paris-harrington and off-diagonal ramsey tautologies 2016 Carlucci, Lorenzo; Galesi, Nicola; Lauria, Massimo
Paris-Harrington tautologies 2011 Carlucci, Lorenzo; Galesi, Nicola; Lauria, Massimo
Regressive versions of Hindman’s theorem 2024 Carlucci, Lorenzo; Mainardi, Leonardo