Journal

1. L. Carlucci, A new proof-theoretic proof of the independence of Kirby-Paris' Hydra Theorem, Theoretical Computer Science 300 (2003), 365-378.
2. L. Carlucci, Worms, Gaps and Hydras, Mathematical Logic Quarterly, 51:4, (2005), 342-350.
3. L. Carlucci, S. Jain, E. Kinber, and F. Stephan, Variations on U-shaped learning. Information and Computation, 204:8, (2006), 1264-1294. Technical report version here.
4. L. Carlucci, J. Case, S. Jain, and F. Stephan, Results on memory-limited U-shaped learning. Information and Computation, 205:10, (2007), 1551-1573. Technical report version here.
5. L. Carlucci, J. Case, S. Jain, and F. Stephan, Non-U-shaped vacillatory and team learning, Journal of Computer and System Sciences, 74:4, (2008), 409-430. Technical report version here.
6. L. Carlucci, J. Case, and S. Jain, Learning Correction Grammars, Journal of Symbolic Logic, 74:2, (2009), 489-516.
7. L. Carlucci, P. Dehornoy, and A. Weiermann, Unprovability Results involving Braids. Proceedings of the London Mathematical Society, 102(1), (2011), 159-192.
8. L. Carlucci, G. Lee, and A. Weiermann Sharp thresholds for hypergraph regressive Ramsey numbers. Journal of Combinatorial Theory, Series A, 118(2) (2011), 558-585.
9. L. Carlucci, F. Stephan and S. Jain Learning with ordinal-bounded memory from positive data. Journal of Computer and Systems Science, 78(5) (2012), 1623-1636.
10. L. Carlucci and J. Case On the necessity of U-shaped learning. Invited paper, Topics in Cognitive Science, 5 (2013), 56-88, Special issue on Why Formal Learning Theory matters for Cognitive Science.