Sfoglia per Autore
A new proof-theoretic proof of the independence of Kirby-Paris' Hydra Theorem
2003 Carlucci, Lorenzo
Variations on U-Shaped Learning
2005 Carlucci, Lorenzo; S., Jain; E., Kinber; F., Stephan
Non U-shaped Vacillatory and Team Learning
2005 Carlucci, Lorenzo; J., Case; S., Jain; F., Stephan
Worms, gaps, and hydras
2005 Carlucci, Lorenzo
Memory-Limited U-shaped Learning
2006 Carlucci, Lorenzo; J., Case; S., Jain; F., Stephan
Variations on U-shaped learning
2006 Carlucci, Lorenzo; S., Jain; E., Kinber; F., Stephan
Learning Correction Grammars
2007 Carlucci, Lorenzo; J., Case; S., Jain
Results on memory-limited U-shaped learning
2007 Carlucci, Lorenzo; John, Case; Sanjay, Jain; Frank, Stephan
Non-U-shaped vacillatory and team learning
2008 Carlucci, Lorenzo; John, Case; Sanjay, Jain; Frank, Stephan
LEARNING CORRECTION GRAMMARS
2009 Carlucci, Lorenzo; John, Case; Sanjay, Jain
Incremental Learning with Ordinal Bounded Example Memory
2009 Carlucci, Lorenzo
Paris-Harrington tautologies
2011 Carlucci, Lorenzo; Galesi, Nicola; Lauria, Massimo
Unprovability results involving braids
2011 Carlucci, Lorenzo; P., Dehornoy; A., Weiermann
Sharp thresholds for hypergraph regressive Ramsey numbers
2011 Carlucci, Lorenzo; Gyesik, Lee; Andreas, Weiermann
A note on Ramsey theorems and Turing jumps
2012 Carlucci, Lorenzo; Konrad, Zdanowski
Learning with ordinal-bounded memory from positive data
2012 Carlucci, Lorenzo; Jain, Sanjay; Stephan, Frank
On the Necessity of U-Shaped Learning
2013 Carlucci, Lorenzo; John, Case
THE STRENGTH OF RAMSEY’S THEOREM FOR COLORING RELATIVELY LARGE SETS
2014 Carlucci, Lorenzo; Konrad, Zdanowski
On the proof complexity of Paris-harrington and off-diagonal ramsey tautologies
2016 Carlucci, Lorenzo; Galesi, Nicola; Lauria, Massimo
New bounds on the strength of some restrictions of Hindman’s Theorem
2017 Carlucci, Lorenzo; Aleksander Kolodziejczyk, Leszek; Lepore, Francesco; Zdanowski, Konrad
Titolo | Data di pubblicazione | Autore(i) | File |
---|---|---|---|
A new proof-theoretic proof of the independence of Kirby-Paris' Hydra Theorem | 2003 | Carlucci, Lorenzo | |
Variations on U-Shaped Learning | 2005 | Carlucci, Lorenzo; S., Jain; E., Kinber; F., Stephan | |
Non U-shaped Vacillatory and Team Learning | 2005 | Carlucci, Lorenzo; J., Case; S., Jain; F., Stephan | |
Worms, gaps, and hydras | 2005 | Carlucci, Lorenzo | |
Memory-Limited U-shaped Learning | 2006 | Carlucci, Lorenzo; J., Case; S., Jain; F., Stephan | |
Variations on U-shaped learning | 2006 | Carlucci, Lorenzo; S., Jain; E., Kinber; F., Stephan | |
Learning Correction Grammars | 2007 | Carlucci, Lorenzo; J., Case; S., Jain | |
Results on memory-limited U-shaped learning | 2007 | Carlucci, Lorenzo; John, Case; Sanjay, Jain; Frank, Stephan | |
Non-U-shaped vacillatory and team learning | 2008 | Carlucci, Lorenzo; John, Case; Sanjay, Jain; Frank, Stephan | |
LEARNING CORRECTION GRAMMARS | 2009 | Carlucci, Lorenzo; John, Case; Sanjay, Jain | |
Incremental Learning with Ordinal Bounded Example Memory | 2009 | Carlucci, Lorenzo | |
Paris-Harrington tautologies | 2011 | Carlucci, Lorenzo; Galesi, Nicola; Lauria, Massimo | |
Unprovability results involving braids | 2011 | Carlucci, Lorenzo; P., Dehornoy; A., Weiermann | |
Sharp thresholds for hypergraph regressive Ramsey numbers | 2011 | Carlucci, Lorenzo; Gyesik, Lee; Andreas, Weiermann | |
A note on Ramsey theorems and Turing jumps | 2012 | Carlucci, Lorenzo; Konrad, Zdanowski | |
Learning with ordinal-bounded memory from positive data | 2012 | Carlucci, Lorenzo; Jain, Sanjay; Stephan, Frank | |
On the Necessity of U-Shaped Learning | 2013 | Carlucci, Lorenzo; John, Case | |
THE STRENGTH OF RAMSEY’S THEOREM FOR COLORING RELATIVELY LARGE SETS | 2014 | Carlucci, Lorenzo; Konrad, Zdanowski | |
On the proof complexity of Paris-harrington and off-diagonal ramsey tautologies | 2016 | Carlucci, Lorenzo; Galesi, Nicola; Lauria, Massimo | |
New bounds on the strength of some restrictions of Hindman’s Theorem | 2017 | Carlucci, Lorenzo; Aleksander Kolodziejczyk, Leszek; Lepore, Francesco; Zdanowski, Konrad |
Legenda icone
- file ad accesso aperto
- file disponibili sulla rete interna
- file disponibili agli utenti autorizzati
- file disponibili solo agli amministratori
- file sotto embargo
- nessun file disponibile