## Journal papers

**2****2****.****On the structure of computable reducibility on equivalence relations of natural numbers**

online first in*Journal of Symbolic Logic*, 2022**21****.****Primiti****ve recursive****equivalence relations and their****primitive recursive****complexity**

online first in*Computab**ility*, 2022**20****.****The category of equivalence relations***Algebra and Logic*, 60(5), 295-307, 2021**19.****On the Turing complexity of learning finite families of algebraic structures***Journal of Logic and Computation*, 31(7), 1891-1900, 2021**18****.****Thin objects are not transparent**

(with M. Plebani and G. Venturi)

online first in*Theoria*, 2021**17.****On****logicality****and natural****logic**

(with S. Pistoia Reda)*Natural Language Semantics*, 29, 501-506, 2021**1****6****.****Degrees of bi-embeddable categoricity**

(with N. Bazhenov, E. Fokina, D. Rossegger)*Computability*, 10(1), 1-16, 2021**1****5****.****Speech acts in mathematics**

(with M. Ruffino and G. Venturi)*Synthese*, 198, 10063-10087, 2021**1****4****.****What is to believe in a mathematical assertion?**

(with G. Venturi)*Italian Journal of Philosophy of Language*, 15(1), 154-157, 2021**13.****Word problems and ceers**

(with V. Delle Rose and A. Sorbi)

*Mathematical Logic Quarterly*, 66(3), 341-354, 2020**12.****Learning families of algebraic structures from informant**

(with N. Bazhenov and E. Fokina)*Information and Computation*, 275, 104590, 2020**11.****Classifying equivalence relations in the Ershov hierarchy**

(with N. Bazhenov, M. Mustafa, A. Sorbi, and M. Yamaleev)*Archive for Mathematical Logic*, 59(7/8), 835-864, 2020**10.****Minimal Equivalence Relations in Hyperarithmetical and Analytical Hierarchies**

(with N. Bazhenov, M. Mustafa, and M. Yamaleev)*Lobachevskii Journal of Mathematics*, 41, 145-150, 2020**9.****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**7.****Measuring the complexity of reductions between equivalence relations**

(with E. Fokina and D. Rossegger)*Computability*, 8(3/4), 265-280, 2019**6.****Degrees of bi-embeddable categoricity of equivalence structures***Archive for Mathematical Logic*, 58(5/6), 543-563, 2019**5.****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**4.****Computable bi-embeddable categoricity**

(with N. Bazhenov, E. Fokina, and D. Rossegger)*Algebra and Logic*, 57(5), 392-396, 2018**3.****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**2.****Trial and error mathematics I: Dialectical and quasidialectical systems***Review of Symbolic Logic*, 9(2), 299-324, 2016**1.****Universal computably enumerable equivalence relations***Journal of Symbolic Logic*, 79(1), 60-88, 2014

## BOOK CHAPTERS AND CONFERENCE PAPERS

**12****.****Calculating the mind-change complexity of learning algebraic structures**

(with N. Bazhenov and V. Cipriani)

in U. Berger, J. Franklin, F. Manea, and A. Pauly (eds.)*CiE 2022: Revolutions and Revelations in Computability*, Springer (LNCS 13359), 1-12, 2022**11.****Computability theory as a philosophical achievement**

(with M. Plebani)

online first in*Clinical Chemistry and Laboratory Medicine*, 2022**10.****Approximating approximate reasoning: fuzzy sets and the Ershov hierarchy**

(with N. Bazhenov, M. Mustafa, and S. Ospichev)

in S. Ghosh and T. Icard (eds.),*Logic, Rationality, and Interaction*, Springer (LNCS 13039), 2021**9.****On the computational content of the theory of Borel equivalence relations**

(with N. Bazhenov, B. Monin, and R. Zamora)*Oberwolfach Preprints*, OWP 2021(06), 2021**8.****Limit learning equivalence structures**

(with E. Fokina and T. Koetzing)*Proceedings of Machine Learning Research*, 98, 383-403, 2019**7.****Ragionare per reclutare: la logica nei (e dei) convegni pubblici***Convegno Annuale Associazione Italiana Professori di Diritto Amministrativo*, 2019**6.****Church-Turing thesis, in practice**

in M. Piazza and G. Pulcini (eds),*Truth, Existence and Explanation*, Springer, 225-248, 2018**5.****Direzioni della logica in Italia: la teoria (classica) della ricorsivitĂ**

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**3.****Computable bi-embeddable categoricity of equivalence structures***Proceedings of the 11th Panhellenic Logic Symposium*, 126-132, 2017**2.****Reducibility and bi-reducibility spectra of equivalence relations**

(with E. Fokina and D. Rossegger)*Proceedings of the 11th Panhellenic Logic Symposium*, 83-89, 2017**1.****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

**7. On the complexity of word problems for semigroups**(with V. Delle Rose and A. Sorbi)**6****.****Investigating the computable Friedman-Stanley jump****5****.****How to make (mathematical) assertions with directives**

(with L. Caponetto and G. Venturi)**4. Buridan's cell**(with L. Ferrone)**3. How to approximate fuzzy sets: mind-changes and the Ershov hierarchy**

(with N. Bazhenov, M. Mustafa, and S. Ospichev)

**2.****Learning algebraic structures with the help of Borel equivalence relations****1.****C****omparing the isomorphism type of equivalence structures and preorders**

(with N. Bazhenov)