Notizie
Esame Logica Matematica 24/25 Sessione Straordinaria
L'esame di svolgerà in Aula G0 Viale Regina Elena 295 Palazzina G Piano Terra.
Lo scritto si svolgerà il 29 Aprile dalle 10:00 alle 12:00
L'orale si svolgerà il 30 Aprile a partire dalle 10. Le convocazioni per gli orali saranno inviate il 29 Aprile.
Esami I sessione 2024-2025
Logica Matematica: 22 Gennaio Aula Volterra 14-16:30 (esame scritto)
Metodi Matematici per Informatica: 23 Gennaio Aula 3 Via del Castro Laurenziano 7a 10:00 - 12:30
Date esami 2024-2025
Logica Matematica:
22 Gennaio, 18 Febbraio, 24 Giugno, 21 Luglio, 3 Settembre
Metodi Matematici:
23/01/2025, 24/02/2025, 10/06/2025, 24/07/2025, 09/09/2025
Sessione Straordinaria riservata ad aventi diritto: 28/03/2025 ore 16 Aula G0 V.le Regina Elena 295.
Corsi Primo Semestre 2024-2025
Metodi Matematici per Informatica (Canale 1)
Quando = Martedì 8-11, Mercoledì 11-13
Dove =
Classroom = https://classroom.google.com/c/NzE4OTY5NDEyODgy?cjc=oeqepom
Sito = https://sites.google.com/uniroma1.it/mmi2425/home
Link per lezione del 2/10 = https://uniroma1.zoom.us/j/81579067494?pwd=D1gMJxvBKdpVKIKQJtK6abN4yBxVza.1
Logica Matematica
Quando = Lunedì 9-11, Venerdì 10-12
Dove = Aula Volterra
Classroom = https://classroom.google.com/c/NzE4OTc0NTk4NDQ3?cjc=qxbt2jv
Sito = https://sites.google.com/uniroma1.it/logicamatematica2324/home-page
Orari di ricevimento
su appuntamento tramite mail
Curriculum
General Information
Full Name Lorenzo Carlucci
Date of Birth} 20/04/1976
Spoken Languages Italian, French (fluent), English (fluent), German (intermediate)
Education
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).
Habilitation
2014: Habilitation to Associate Professor in Mathematical Logic (Abilitazione Scientifica Nazionale Professore di II Fascia 01/A1)
Appointments
from December 2008: Assistant Professor (Ricercatore), University of Rome La Sapienza, Computer Science Department.
2007--2008: Post-Doc (Assegnista di Ricerca), University of Rome La Sapienza, Computer Science Department.
2007--2008: Research Fellow of the Scuola Normale Superiore di Pisa.
Spring 2003--Spring 2005: Research Assistant and Teaching Assistant, University of Delaware, Dept.~of Computer and Information Sciences, Newark, DE, U.S.A.
Research Summary
I work mostly in two areas: {\bf proof theory of arithmetic and analysis} and {\bf 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).
Teaching
2010-2018. Logica Matematica per Informatica (Graduate, taught yearly, University of Rome La Sapienza, Dept. of Computer Science).
2007-2018. TA for the following courses at the Computer Science Department of La Sapienza: Progettazione di Algoritmi (Undergraduate, in charge of exercises and exams), Programmazione 2 (Undergraduate, in charge of exercises and exams)), Introduzione agli algoritmi (Undergraduate, in charge of exercises and exams)), Progettazione di Sistemi digitali (Undergraduate, in charge of exercises and exams)),
Metodi matematici per l'informatica (Undergraduate, TA in charge of lectures and exams), Fondamenti di Programmazione
(Undergraduate, TA in charge of lab).
2014. Elective in Computational Learning Theory (Graduate, Head instructor, University of Rome La Sapienza, Dept. of Computer Science).
2007. Introduzione alla Teoria degli Insiemi (PhD course), Scuola Normale Superiore di Pisa.
Spring 2003--Spring 2005. Teaching Assistant, University of Delaware, Dept.~of Computer and Information Sciences, Newark, DE, U.S.A. Introduction to Computer Science (CISC 181, Undergraduate), Bioinformatics (CISC 667, Graduate), Data Structures (CISC 220, Undergraduate).
Awards and Honors
2006 Selected as one of the ten finalists for the prize Kurt G"odel Centenary: Young Scholars' Competition, organized by the Kurt G"odel Society. Award date: 04.28.06.
Funding Information
2008 Research Project ``Shadows of Infinity'' selected for full funding in
the context of the invitation-only RFP ``Exploring the Infinite, Phase I: Mathematics and Mathematical Logic''
by the John Templeton Foundation (100 invitees worldwide, approx.1/5 funded, of which approx.~30\% funded for full amount requested).
2007 Telecom Italia ``Progetto Italia'' Fellowship (approx.75.000 EU for 2 years), awarded through national competition, for research in Mathematical Logic at the Scuola Normale Superiore di Pisa.
Invited Talks
July 2018 - invited talk at the Workshop on Ramsey Theory and Computability, University of Notre Dame Global Gateway, Rome, Italy July 9–13, 2018.
April 2018 - invited talk at the Logic Seminar of the Institute of Mathematics of the Czech Academy of Sciences, Prague.
February 2018 - invited talk at the Workshop on Ramsey Theory of Equations and related topics, 16th-17th February, 2018, Mathematics Department of the University of Pisa.
October 2017 - invited talk at the Workshop on Proof Theory, Modal Logic and Reflection Principles 2017, October 10-13, 2017,
conference will be held at Steklov Mathematical Institute in Moscow, Russia.
September 2016 - invited talk at the Workshop on Proof Theory, Modal Logic and Reflection Principles, Tbilisi, Georgia
Monday, September 5 -- Friday, September 9, 2016. (declined).
January 2016 - invited talk at the conference New Challenges in Reverse Mathematics,
3 -- 16 January 2016, National University of Singapore, Singapore. (declined).
September 2014 - invited talk at the Proof Theory, Modal Logic and Reflection Principles,
Instituto Tecnològico Autònomo de Mexico, Mexico City, Mexico, September 29 - October 2, 2014. (declined).
July 2012 - invited talk at the Model Theory and Proof Theory of Arithmetic, Institute of Mathematics of the Polish Academy of Science, Bedlewo, Poland, 22-27 July, 2012. Title: Three results related to the Paris-Harrington Theorem.
June 2012 - invited talk at the Latin American Symposium on Mathematical Logic, Bogotà, Colombia (declined).
April 2012 - invited talk at the Workshop Proof Theory and Modal Logic, University of Barcelona, Spain.
Title: On Ramsey Theorems and Turing Jumps.
September 2011 - Invited research stay at the Institute of Mathematical Sciences, National University of Singapore, Singapore (invited by Prof. Frank Stephan and Prof. Sanjay Jain)
March 2011 - Paris-Harrington Tautologies, invited talk at the Workshop New Trends in Unprovability, Department of Pure Mathematics and Computer Algebra, University of Ghent, Ghent, Belgium.
April 2007 - Research stay at the Department of Computer Science, University of Liverpool, Liverpool, UK (invited by Prof. A. Bovykin)
December 2007 - Research stay at the Department of Pure Mathematics and Computer Algebra, University of Ghent, Ghent, Belgium
(invited by Prof. A. Weiermann).
April 2006 - Phase transitions for old and new independence results, invited presentation for the G\"odel Centenary: Young Scholars' Competition, University of Vienna, Vienna, Austria.
November 2004 - Research stay, Dept.~of Mathematics, University of Utrecht, Utrecht, The Netherlands (invited by Prof. Lev Beklemishev)
Other academic activities
Program Committee Member Workshop on Ramsey Theory and Computability Theory will be held in Rome, Italy, July 9-13, 2018, University of Notre Dame Global Gateway, Rome
Scientific Committee Member International Conference Interactive Imagination, Rome, Italy, June 6-8, 2016, Istituto Svizzero, Rome
Organizer of the third Bertinoro workshop Ramsey Theory in Logic, Combinatorics and Complexity, July 2018,
(co-organizers: Nicola Galesi, Mauro Di Nasso, William Gasarch).
Organizer of the conference Limits of Theorem proving 2012, Rome 25--27 September
(co-organizers: Olaf Beyersdorff, Nicola Galesi, Toniann Pitassi).
Organizer of the second Bertinoro workshop Ramsey Theory in Logic, Combinatorics and Complexity 2011
(co-organizers: Nicola Galesi, Pavel Pudlàk, Vojtech R"odl, Matteo Viale, Andreas Weiermann).
Organizer of the first Bertinoro Workshop Ramsey Theory in Logic, Combinatorics and Complexity 2009.
(co-organizers: Nicola Galesi, Pavel Pudlàk, Andreas Weiermann).
Organizer of an Oberwolfach miniworkshop (0648b) Logic, Combinatorics and Independence Results (26.11.06--02.12.06).
Reviewer for Mathematical Reviews, and for Zentralblatt.
Referee for Journal of Computer and Systems Science, Bulletin of Symbolic Logic,
Archive for Mathematical Logic, Logical Methods in Computer Science,
Annals of Pure and Applied Logic, Logic Journal of the IGLP, Discrete Mathematics,
Theoretical Computer Science, Journal of Symbolic Logic,
and conferences SAT, CCC, TAMC and CiE.
External Referee for the Ph.D. thesis of Michiel De Smet, Unprovability and phase transitions in Ramsey Theory, discussed June 2011,
Department of Pure Mathematics and Computer Algebra, University of Ghent, Belgium.
External Referee for the Ph.D. thesis of Florian Pelupessy, Connecting the provable with the unprovable, November 2012,
Department of Pure Mathematics and Computer Algebra, University of Ghent, Belgium.
Supervisor for the MS Thesis in Computer Science of Marcello Stanisci, Sulla complessità dei teoremi Thin-Set e Free-Set di
Friedman, September 2013, La Sapienza.
Supervisor for the MA Thesis in Philosophy of Giandomenico Laviola, Complessità computazionale e definibilità logica, March 2013, University of Rome III.
Supervisor for the BS Thesis in Computer Science of Francesco Lepore, The effective content and logical strength of
Hindman's Finite Sums Theorem, discussed December 2016, La Sapienza.
Supervisor for the MS Thesis in Computer Science of Leonardo Mainardi, The Ordinal Analysis of RCA_0 + WO(epsilon_0), discussed March 20 2018, La Sapienza.
Supervisor for Honors students project of Vincenzo Botta, Giovanni Varricchione, and for ``Attività formativa complementare'' (Extra curricular activity) for Manuel Mauro, Roberto Ruccia, Daniele Tavernelli.
Publications
L. Carlucci, A new proof-theoretic proof of the independence of Kirby-Paris' Hydra Theorem, Theoretical Computer Science, 300, (2003), 365--378.
L. Carlucci, Worms, Gaps and Hydras, Mathematical Logic Quarterly, 51:4, (2005), 342--350.
L. Carlucci, J. Case, S. Jain and F. Stephan, Non U-shaped vacillatory and team learning,
Proceedings of the Annual Conference on Algorithmic Learning Theory, ALT 2005,
Lecture Notes in Artificial Intelligence, n.3734, 241--255, Springer.
L.Carlucci, S.Jain, E.Kinber and F.Stephan, Variations on U-shaped learning,
in P.Auer, R.Meir (eds.), Learning Theory, Proceedings of the 18th Annual Conference on Computational Learning Theory, COLT 2005,
Lecture Notes in Computer Science, n.3559, 382--397, Springer 2005.
L.Carlucci, J.Case, S.Jain and F.Stephan, Memory-Limited U-Shaped Learning,
in J.G.Carbonell, J.Siekmann (eds.), Learning Theory,
Proceedings of the 19th Annual Conference on Computational Learning Theory, COLT 2006,
Lecture Notes in Computer Science, n.4005, 244--258, Springer 2006.
L.Carlucci, S.Jain, E.Kinber and F.Stephan, Variations on U-shaped learning, Information and
Computation, 204:8, (2006), 1264--1294.
L.Carlucci, J.Case and S.Jain, Learning Correction Grammars,
in N.H.Bshouty and C.Gentile (eds.),
Proceedings of the 20th Annual Conference on Computational Learning Theory, COLT 2007,
Lecture Notes in Computer Science, n.4539, 203--217, Springer 2007.
L.Carlucci, J.Case, S.Jain and F.Stephan, Results on memory-limited U-shaped learning,
Information and Computation, 205:10, (2007), 1551--1573.
L.Carlucci, J.Case, S.Jain and F.Stephan, Non-U-shaped vacillatory and team learning, in
Journal of Computer and System Sciences, 74:4, (2008), 409--430.
L.Carlucci, Incremental Learning with ordinal bounded example memory,
in R.Gavaldà and G.Lugosi, T.Zeugmann, and S.Zilles, (eds.),
Proceedings of the 20th Annual Conference on Algorithmic Learning Theory, ALT 2009,
Porto, Portugal, 2009, 323--337, Lecture Notes in Artificial Intelligence, n.5809,
Springer Verlag, 2009.
L.Carlucci, J.Case and S.Jain, Learning Correction Grammars,
Journal of Symbolic Logic, 74:2, (2009), 489--516.
L.Carlucci, G.Lee and A.Weiermann, Classifying the phase transition threshold for regressive Ramsey
numbers, Journal of Combinatorial Theory, Series A, 118:2, (2011), 558--585.
L.Carlucci, P.Dehornoy and A.Weiermann, Unprovability results involving braids, Proceedings of the
London Mathematical Society, 102:1, (2011), 159--192.
L.Carlucci, N.Galesi, M.Lauria, Paris-Harrington Tautologies,
in (eds.), Proceedings of IEEE Conference on Computational Complexity 2011, CCC 2011,
San José, USA, 2011, 93--103.
L.Carlucci, K.Zdanowski, A note on Ramsey Theorems and Turing Jumps,
In: Cooper S.B., Dawar A., Löwe B. (eds) How the World Computes. CiE 2012. Lecture Notes in Computer Science, vol 7318. Springer, Berlin, Heidelberg, 2012, pp. 89--95.
L.Carlucci, S.Jain and F.Stephan, Learning with ordinal-bounded memory from positive data,
Journal of Computer and System Sciences, 78, (2012), 1623--1636.
L.Carlucci and J.Case, On the necessity of U-shaped learning, Invited paper in Topics in Cognitive Science, 5, (2013), 56-88,
Special issue on Why Formal Learning Theory matters for Cognitive Science.
L. Carlucci, K.Zdanowski, The strength of Ramsey's Theorem for coloring relatively large
sets, Journal of Symbolic Logic, 79:1, (2014), 89--102.
L. Carlucci, N. Galesi and M. Lauria, On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies,
ACM Transactions on Computational Logic, 17(4), (2016).
L. Carlucci, L.A. Kolodziejczyk, F. Lepore, K. Zdanowski, New bounds on the
strength of restrictions of Hindman's Finite Sums Theorem. In J. Kari, F. Manea, and I. Petre, (editors),
Unveiling Dynamics and Complexity, 13th Conference Computability in Europe 2017 (Turku, Finland, June 12-16, 2017), Springer, 2017, pp. 210--220.
L. Carlucci, A weak variant of Hindman's Theorem stronger than Hilbert's Theorem.
Archive for Mathematical Logic, 57 (2018), 381--389.
L. Carlucci, Weak Yet Strong restrictions of Hindman's Finite Sums Theorem.
Proceedings of the American Mathematical Society, 146 (2018), 819-829.
L. Carlucci, A note on Hindman-type theorems for uncountable cardinals Order, 36:1 (2019), 19-22.
L. Carlucci, L. A. Kolodziewczyk, F. Lepore, K. Zdanowski, New bounds on the strength of some restrictions of Hindman's Finite Sums Theorem, Computability, 9 (2020), 139-153.
L. Carlucci, M. Lauria, Upper bounds on positional Paris-Harrington games, Discrete Mathematics, vol. 344, issue 3, (2021).
L. Carlucci, D. Tavernelli, Hindman's Theorem for sums along the full binary tree, Sigma^0_2-induction and the Pigeonhole Principle for trees, Archive for Mathematical Logic (2022). https://doi.org/10.1007/s00153-021-00814-2.
L. Carlucci, D. F. Breton, The Adjacent Hindman's Theorem for uncountable groups, Colloquium Mathematicum, vol. 173, no. 2, (2023).
L. Carlucci, L. Mainardi, Regressive variants of Hindman's theorem, Archive for Mathematical Logic, vol. 67, (2024), 447-472.