Seguir
Lorenzo Carlucci
Título
Citado por
Citado por
Año
On the Necessity of U‐Shaped Learning
L Carlucci, J Case
Topics in cognitive Science 5 (1), 56-88, 2013
902013
Results on memory-limited U-shaped learning
L Carlucci, J Case, S Jain, F Stephan
Information and Computation 205 (10), 1551-1573, 2007
44*2007
Variations on U-shaped learning
L Carlucci, S Jain, E Kinber, F Stephan
Information and Computation 204 (8), 1264-1294, 2006
222006
Unprovability results involving braids
L Carlucci, P Dehornoy, A Weiermann
Proceedings of the London Mathematical Society 102 (1), 159-192, 2011
212011
Non U-shaped vacillatory and team learning
L Carlucci, J Case, S Jain, F Stephan
Algorithmic Learning Theory: 16th International Conference, ALT 2005 …, 2005
212005
Sharp thresholds for hypergraph regressive Ramsey numbers
L Carlucci, G Lee, A Weiermann
Journal of Combinatorial Theory, Series A 118 (2), 558-585, 2011
162011
Non-U-shaped vacillatory and team learning
L Carlucci, J Case, S Jain, F Stephan
Journal of Computer and System Sciences 74 (4), 409-430, 2008
162008
Worms, gaps, and hydras
L Carlucci
Mathematical Logic Quarterly 51 (4), 342-350, 2005
162005
Learning correction grammars
L Carlucci, J Case, S Jain
The Journal of Symbolic Logic 74 (2), 489-516, 2009
132009
Variations on U-shaped learning
L Carlucci, S Jain, E Kinber, F Stephan
Learning Theory: 18th Annual Conference on Learning Theory, COLT 2005 …, 2005
132005
New bounds on the strength of some restrictions of Hindman’s Theorem
L Carlucci, LA Kołodziejczyk, F Lepore, K Zdanowski
Computability 9 (2), 139-153, 2020
122020
“Weak yet strong” restrictions of Hindman’s Finite Sums Theorem
L Carlucci
Proceedings of the American Mathematical Society 146 (2), 819-829, 2018
122018
Classifying the phase transition threshold for regressive Ramsey functions
L Carlucci, G Lee, A Weiermann
preprint, 2006
112006
A new proof-theoretic proof of the independence of Kirby–Paris’ Hydra Theorem
L Carlucci
Theoretical Computer Science 300 (1-3), 365-378, 2003
112003
A weak variant of Hindman’s Theorem stronger than Hilbert’s Theorem
L Carlucci
Archive for Mathematical Logic 57 (3), 381-389, 2018
102018
U-shaped learning may be necessary 3
L Carluccia, J Caseb, S Jainc, F Stephand
82005
Restrictions of Hindman’s Theorem: an overview
L Carlucci
Connecting with Computability: 17th Conference on Computability in Europe …, 2021
72021
A note on Hindman-type theorems for uncountable cardinals
L Carlucci
Order 36 (1), 19-22, 2019
72019
The strength of Ramsey’s theorem for coloring relatively large sets
L Carlucci, K Zdanowski
The Journal of Symbolic Logic 79 (1), 89-102, 2014
72014
Leszek Aleksander Ko l odziejczyk, Francesco Lepore, and Konrad Zdanowski
L Carlucci
New bounds on the strength of some restrictions of Hindman’s theorem …, 2020
52020
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20