LORENZO CARLUCCI

Appelli straordinari 2024/2025 

Per i corsi di Logica Matematica (Matematica) e Metodi Matematici per Informatica (Informatica):
lo scritto si terrà in aula G0 Viale Regina Elena 295 il 12 Novembre dalle 10 alle 12. 

Logica Matematica 2025/2026

Inizio lezioni lunedì 29 Settembre
sito = https://sites.google.com/uniroma1.it/logicamatematica2526/home-page

Metodi Matematici per Informatica 2025/2026 canale 1

Inizio lezioni lunedì 29 Settembre
sito = https://sites.google.com/uniroma1.it/mmi2526/home

Ph.D. in Computer Science, May 2006, Dept. of Computer and Information Sciences, University of Delaware, Newark, DE, U.S.A. Title: Cognitively-motivated results in Algorithmic Learning Theory, Advisor: Prof.John Case.

Ph.D. in Mathematical Logic and Theoretical Computer Science, February 2006, Dept.~of Mathematics, University of Siena, Siena, Italy. Title: Some results on unprovable theorems. Advisor: Prof.Franco Montagna. External Referees: Prof.Lev Beklemishev, Prof.Herman R. Jervell. Distinction: Excellent.

Diplome in Philosophical Disciplines, Summa Cum Laude, January 2000, Scuola Normale Superiore di Pisa, Pisa, Italy.Title: Ennio De Giorgi's theories for the Foundations of Mathematics. Advisors: Prof.Marco Forti, Prof.Ettore Casari.

Laurea in Philosophy (quadriennale), Summa Cum Laude, November 1999, Pisa University, Pisa, Italy. Title: Independence proofs of Kirby-Paris' Hydra Theorem from Peano Arithmetic. Advisors: Prof.Marco Forti (Dept.of Mathematics, University of Pisa), Prof.Enrico Moriconi (Dept.of Philosophy, University of Pisa).

2020: Habilitation to Full Professor in Mathematical Logic (Abilitazione Scientifica Nazionale Professore di I Fascia 01/A1)

I work at Sapienza since 2008. I have been at the Department of Computer Science untill 2022, then I moved to the Department of Mathematics.
I have previously been a Research Fellow at the Scuola Normale Superiore di Pisa, and a Research Assistant and Teaching Assistant at the Department of Computer and Information Sciences of the University of Delaware (US).

Research Summary

I have worked mostly in two areas: Proof theory and Reverse Mathematics of Arithmetic and Analysis and Computability-theoretic Learning Theory. In the first area I have worked on Reverse Mathematics and independence results from systems of arithmetic and analysis, and on the connection between classical combinatorics (e.g., Ramsey Theory, well-quasi-ordering theory, Braid groups, Banach Space Theory, Hindman's Theorem) and unprovability results. In the second area I worked on a number of new learning paradigms in the context of inductive learning theory with a special emphasis on non-monotonic learning and on models featuring the use of notations for transfinite ordinal numbers. I also have an interest in Propositional Proof Complexity.

My work on the proof-theoretic and computational strength of combinatorial theorems has appeared in the Proceedings of the American Mathematical Society, Proceedings of the London Mathematical Society, the Journal of Combinatorial Theory Series A, and the Journal of Symbolic Logic. My work in learning theory has appeared in the Journal of Symbolic Logic, the Journal of Computer and Systems Science, Information and Computation, and has been presented at the major conferences of the field such as COLT
and ALT. My only paper in Complexity Theory so far (joint with Galesi and Lauria) appeared in 2011 in the reference conference CCC and a journal version in the ACM Transactions on Computational Logic. I collaborated with prominent researchers in my research areas such as, e.g., Andreas Weiermann (University of Ghent), Patrick Dehornoy (University of Caen), Sanjay Jain, and Frank Stephan (University of Singapore), Ludovic Patey (Paris).