Universal computably enumerable equivalence relations U Andrews, S Lempp, JS Miller, KM Ng, L San Mauro, A Sorbi The Journal of Symbolic Logic 79 (1), 60-88, 2014 | 83 | 2014 |

Learning families of algebraic structures from informant N Bazhenov, E Fokina, L San Mauro Information and Computation 275, 104590, 2020 | 20 | 2020 |

Speech acts in mathematics M Ruffino, L San Mauro, G Venturi Synthese 198 (10), 10063-10087, 2021 | 15 | 2021 |

On the structure of computable reducibility on equivalence relations of natural numbers U Andrews, DF Belin, L San Mauro The Journal of Symbolic Logic 88 (3), 1038-1063, 2023 | 13 | 2023 |

Limit learning equivalence structures E Fokina, T Kötzing, L San Mauro Algorithmic Learning Theory, 383-403, 2019 | 13 | 2019 |

Classifying equivalence relations in the Ershov hierarchy N Bazhenov, M Mustafa, L San Mauro, A Sorbi, M Yamaleev Archive for Mathematical Logic 59 (7), 835-864, 2020 | 12 | 2020 |

Degrees of bi-embeddable categoricity N Bazhenov, E Fokina, D Rossegger, L San Mauro Computability 10 (1), 1-16, 2021 | 11 | 2021 |

Degrees of bi-embeddable categoricity of equivalence structures N Bazhenov, E Fokina, D Rossegger, L San Mauro Archive for Mathematical Logic 58, 543-563, 2019 | 11 | 2019 |

Bi‐embeddability spectra and bases of spectra E Fokina, D Rossegger, L San Mauro Mathematical Logic Quarterly 65 (2), 228-236, 2019 | 10 | 2019 |

Trial and error mathematics II: Dialectical sets and quasidialectical sets, their degrees, and their distribution within the class of limit sets J Amidei, D Pianigiani, L San Mauro, A Sorbi The Review of Symbolic Logic 9 (4), 810-835, 2016 | 9 | 2016 |

Trial and error mathematics I: Dialectical and quasidialectical systems J Amidei, D Pianigiani, L San Mauro, G Simi, A Sorbi The review of symbolic logic 9 (2), 299-324, 2016 | 9 | 2016 |

Naturalness in mathematics LS Mauro, G Venturi From logic to practice: Italian studies in the philosophy of mathematics …, 2014 | 9 | 2014 |

Word problems and ceers V Delle Rose, L San Mauro, A Sorbi Mathematical Logic Quarterly 66 (3), 341-354, 2020 | 8 | 2020 |

On the Turing complexity of learning finite families of algebraic structures N Bazhenov, L San Mauro Journal of Logic and Computation 31 (7), 1891-1900, 2021 | 7 | 2021 |

On logicality and natural logic S Pistoia-Reda, L San Mauro Natural Language Semantics 29, 501-506, 2021 | 7 | 2021 |

At least one black sheep: Pragmatics and mathematical language M Ruffino, L San Mauro, G Venturi Journal of Pragmatics 160, 114-119, 2020 | 7 | 2020 |

Measuring the complexity of reductions between equivalence relations E Fokina, D Rossegger, L San Mauro Computability 8 (3-4), 265-280, 2019 | 7 | 2019 |

Learning algebraic structures with the help of Borel equivalence relations N Bazhenov, V Cipriani, L San Mauro Theoretical Computer Science 951, 113762, 2023 | 6 | 2023 |

Computable bi-embeddable categoricity NA Bazhenov, EB Fokina, D Rossegger, L San Mauro Algebra and Logic 57 (5), 392-396, 2018 | 5 | 2018 |

Forma e complessita. Uno studio dei gradi delle relazioni di equivalenza ricorsivamente enumerabili L San Mauro University of Siena, 2011 | 5 | 2011 |