For students

I can offer theses on a wide range of topics related to Mathematical Logic and Computability for Triennale (BSc) and Magistrale (MSc) students.

My students

  • Marcello Stanisci, Sulla complessità dei teoremi Thin-Set e Free-Set di Friedman, MSc Thesis in Computer Science, 2013, La Sapienza.
  • Giandomenico Laviola, Complessità computazionale e definibilità logica, MA Thesis in Philosophy, 2013, University of Rome III.
  • Francesco Lepore, The effective content and logical strength of Hindman's Finite Sums Theorem, BSc Thesis in Computer Science, 2016, La Sapienza.
  • Giovanni Varricchione, Automatic versions of Hindman's Theorem, BSc Thesis in Computer Science, 2017, La Sapienza.
  • Daniele Tavernelli, On the strength of restrictions of Hindman's Theorem, MSc Thesis in Computer Science, 2018, La Sapienza.
  • Leonardo Mainardi, The Ordinal Analysis of RCA0 + WO(ε0), MSc Thesis in Computer Science, 2018, La Sapienza. [Leonardo is currently pursuing his PhD in CS at La Sapienza.]
  • Alfonso Alfaro, Applications of Forcing in the study of the computable strength of combinatorial principles, MSc Thesis in Computer Science, 2019, La Sapienza. [Alfonso is currently a PhD student in Logic in Barcelona.]
  • Mattia Paolacci, Computational Learning Theory: introduzione all'Incremental Learning, BSc Thesis in Computer Science, 2019, La Sapienza.
  • Oriola Gjetaj, Applications of fast-growing functions to the study of Ramsey-type combinatorial principles, MSc Thesis in Computer Science, 2020, La Sapienza. [Oriola is about to start her PhD in Logic at Gent University.]
  • Daniele Tucci, Interactive Proof Systems e Zero Knowledge Proof Systems, BSc Thesis in Mathematics discussed September 2021, Mathematics Department, La Sapienza.
  • Paolo Magnaldi, Analisi non-standard e Combinatoria, BSc Thesis in Mathematics discussed December 2022, Mathematics Department, La Sapienza.
  • Giordano Celli, Gli ultrafiltri e alcune loro applicazioni in Logica Matematica, BSc Thesis in Mathematics of discussed Decembre 2022, with honor, Mathematics Department, La Sapienza.
  • Nicola De Riso Paparo, Aspetti logici e algoritmici del Teorema di Hindman, BSc Thesis in Mathematics discussed March 2022, La Sapienza.