Luca SAN MAURO

Curriculum vitae

Luca Francesco San Mauro è ricercatore di Logica Matematica presso la Technische Universität di Vienna, dove dirige il progetto di ricerca "Classifying equivalence relations via computable reducibility", finanziato dall'Austrian Science Fund. È abilitato alle funzioni di Professore Associato nei settori "Logica e Filosofia della Scienza" (11/C2) e "Logica Matematica" (01/A1).

 

Ha conseguito il titolo di dottore di ricerca presso la Scuola Normale Superiore di Pisa. È stato visiting researcher in diverse università europee, nordamericane, sudamericane, e asiatiche (fra cui, la University of Wisconsin-Madinson, la Nanyang Technological University di Singapore, l’Hasso-Plattner-Institut di Potsdam, e il Sobolev Institute of Mathematics di Novosibirsk). Ha un'estesa rete di collaborazioni internazionali con più di 15 co-autori. Ha partecipato a più di 40 conferenze internazionali.

 

La sua ricerca si concentra sulla teoria della calcolabilità, con particolare riferimento al contenuto computazionale delle strutture algebriche; sui modelli logici per l'inferenza induttiva; e sugli aspetti linguistici della matematica. Ha collaborato a numerosi grant internazionali, finanziati, fra gli altri, dalla São Paulo Research Foundation, dal Bulgarian National Science Fund, e dall’Oberwolfach Research Institute for Mathematics. Pubblica regolarmente sulle maggiori riviste di logica.

 

Dal 2016 insegna logica all’Università di Siena nell'ambito del master "Language and Mind".

Pubblicazioni

JOURNAL PAPERS

  1. Word problems and ceers (with V. Delle Rose and A. Sorbi)
    forthcoming in Mathematical Logic Quarterly, 2020
  2. Learning families of algebraic structures from informant (with N. Bazhenov and E. Fokina)
    forthcoming in Information and Computation, 2020
  3. Degrees of bi-embeddable categoricity (with N. Bazhenov, E. Fokina, D. Rossegger)
    forthcoming in Computability, 2020
  4. Speech acts in mathematics (with M. Ruffino and G. Venturi)
    forthcoming in Synthese, 2020
  5. Classifying equivalence relations in the Ershov hierarchy (with N. Bazhenov, M. Mustafa, A. Sorbi, and M. Yamaleev)
    forthcoming in Archive for Mathematical Logic, 2020
  6. Minimal Equivalence Relations in Hyperarithmetical and Analytical Hierarchies (with N. Bazhenov, M. Mustafa, and M. Yamaleev)
    Lobachevskii Journal of Mathematics, 41, 145-150, 2020
  7. At least one black sheep: Pragmatics and the language of mathematics (with M. Ruffino and G. Venturi)
    Journal of Pragmatics, 160, 114-119, 2020
  8. Bi-embeddability spectra and bases of spectra (with E. Fokina and D. Rossegger)
    Mathematical Logic Quaterly, 65(2), 228-236, 2019
  9. Measuring the complexity of reductions between equivalence relations (with E. Fokina and D. Rossegger)
    Computability, 8(3/4), 265-280, 2019
  10. Degrees of bi-embeddable categoricity of equivalence structures (with N. Bazhenov, E. Fokina, and D. Rossegger)
    Archive for Mathematical Logic, 58(5/6), 543-563, 2019
  11. Trial and error mathematics: Dialectical systems and completions of theories (with J. Amidei, U. Andrews, D. Pianigiani, and A. Sorbi)
    Journal of Logic and Computation, 29(1), 157-184, 2019
  12. Computable bi-embeddable categoricity (with N. Bazhenov, E. Fokina, and D. Rossegger)
    Algebra and Logic, 57(5), 392-396, 2018
  13. Trial and error mathematics II: Dialectical sets and quasidialectical sets, their degrees, and their distribution within the class of limit sets (with J. Amidei, D. Pianigiani and A. Sorbi)
    Review of Symbolic Logic, 9(4), 810-835, 2016
  14. Trial and error mathematics I: Dialectical and quasidialectical systems (with J. Amidei, D. Pianigiani, G. Simi, and A. Sorbi)
    Review of Symbolic Logic, 9(2), 299-324, 2016
  15. Universal computably enumerable equivalence relations (with U. Andrews, S. Lempp, J. S. Miller, K. M. Ng, and A. Sorbi)
    Journal of Symbolic Logic, 79(1), 60-88, 2014

 

BOOK CHAPTERS AND CONFERENCE PAPERS

  1. Limit learning equivalence structures (with E. Fokina and T. Koetzing)
    Proceedings of Machine Learning Research, 98, 383-403, 2019
  2. Church-Turing thesis, in practice
    in M. Piazza and G. Pulcini (eds), Truth, Existence and Explanation, Springer, 225-248, 2018
  3. Direzioni della logica in Italia: la teoria (classica) della ricorsività (with P. Cintioli and A. Sorbi)
    in H. Hosni, G. Lolli, C. Toffalori (eds.), Le direzioni della ricerca logica in Italia 2, Edizioni ETS, 195-234, 2018
  4. Degree spectra of structures with respect to the bi-embeddability relation (with E. Fokina and D. Rossegger)
    Proceedings of the 11th Panhellenic Logic Symposium, 32-38, 2017
  5. Computable bi-embeddable categoricity of equivalence structures (with N. Bazhenov, E. Fokina, and D. Rossegger)
    Proceedings of the 11th Panhellenic Logic Symposium, 126-132, 2017
  6. Reducibility and bi-reducibility spectra of equivalence relations (with E. Fokina and D. Rossegger)
    Proceedings of the 11th Panhellenic Logic Symposium, 83-89, 2017
  7. Naturalness in mathematics (with G. Venturi)
    in G. Lolli, M. Panza, G. Venturi (eds.), From Logic to Practice, Springer, 277-313, 2014

 

SUBMITTED FOR PUBLICATION

  • Comparing the isomorphism type of equivalence structures and preorders (with N. Bazhenov)
  • Notes of the category of equivalence relations (with V. Delle Rose and A. Sorbi)
  • Propositional logicality of language (with S. Pistoia Reda)