Universal computably Enumerable Equivalence Relations. - Uri Andrews; Steffen Lempp; Joseph S. Miller; Keng Meng Ng; Luca San Mauro; Andrea Sorbi (J. Symb. Log., 2014)

Trial and error Mathematics II: Dialectical Sets and Quasidialectical Sets, their Degrees, and their Distribution within the class of Limit Sets. - Jacopo Amidei; Duccio Pianigiani; Luca San Mauro; Andrea Sorbi (Rev. Symb. Log., 2016)

Trial and error Mathematics I: Dialectical and Quasidialectical Systems. - Jacopo Amidei; Duccio Pianigiani; Luca San Mauro; Giulia Simi; Andrea Sorbi (Rev. Symb. Log., 2016)

Limit Learning Equivalence Structures. - Ekaterina B. Fokina; Timo Kötzing; Luca San Mauro (ALT, 2019)

Degrees of bi-embeddable categoricity of equivalence structures. - Nikolay Bazhenov 001; Ekaterina B. Fokina; Dino Rossegger; Luca San Mauro (Arch. Math. Log., 2019)

Measuring the complexity of reductions between equivalence relations. - Ekaterina B. Fokina; Dino Rossegger; Luca San Mauro (Comput., 2019)

Trial and error mathematics: Dialectical systems and completions of theories. - Jacopo Amidei; Uri Andrews; Duccio Pianigiani; Luca San Mauro; Andrea Sorbi (J. Log. Comput., 2019)

Bi-embeddability spectra and bases of spectra. - Ekaterina B. Fokina; Dino Rossegger; Luca San Mauro (Math. Log. Q., 2019)

Classifying equivalence relations in the Ershov hierarchy. - Nikolay Bazhenov 001; Manat Mustafa; Luca San Mauro; Andrea Sorbi; Mars M. Yamaleev (Arch. Math. Log., 2020)

Learning families of algebraic structures from informant. - Nikolay Bazhenov 001; Ekaterina B. Fokina; Luca San Mauro (Inf. Comput., 2020)

Word problems and ceers. - Valentino Delle Rose; Luca San Mauro; Andrea Sorbi (Math. Log. Q., 2020)

Approximating Approximate Reasoning: Fuzzy Sets and the Ershov Hierarchy. - Nikolay Bazhenov 001; Manat Mustafa; Sergei Ospichev; Luca San Mauro (LORI, 2021)

Degrees of bi-embeddable categoricity. - Nikolay Bazhenov 001; Ekaterina B. Fokina; Dino Rossegger; Luca San Mauro (Comput., 2021)

On the Turing complexity of learning finite families of algebraic structures. - Nikolay Bazhenov 001; Luca San Mauro (J. Log. Comput., 2021)

Speech acts in mathematics. - Marco Ruffino; Luca San Mauro; Giorgio Venturi (Synth., 2021)

Calculating the Mind Change Complexity of Learning Algebraic Structures. - Nikolay Bazhenov 001; Vittorio Cipriani; Luca San Mauro (CiE, 2022)

Primitive recursive equivalence relations and their primitive recursive complexity. - Nikolay Bazhenov 001; Keng Meng Ng; Luca San Mauro; Andrea Sorbi (Comput., 2022)

On the Structure of Computable Reducibility on Equivalence Relations of Natural numbers. - Uri Andrews; Daniel F. Belin; Luca San Mauro (J. Symb. Log., 2023)

Learning algebraic structures with the help of Borel equivalence relations. - Nikolay Bazhenov 001; Vittorio Cipriani; Luca San Mauro (Theor. Comput. Sci., 2023)

Classifying word problems of finitely generated algebras via computable reducibility. - Valentino Delle Rose; Luca San Mauro; Andrea Sorbi (Int. J. Algebra Comput., 2023)

On Computational Problems for Infinite Argumentation Frameworks: Classifying Complexity via Computability. - Uri Andrews; Luca San Mauro (SAFA@COMMA, 2024)

On Computational Problems for Infinite Argumentation Frameworks: Hardness of Finding Acceptable Extensions. - Uri Andrews; Luca San Mauro (FCR@KI, 2024)

Punctual Presentability in Certain Classes of Algebraic Structures. - Dariusz Kalocinski; Luca San Mauro; Michal Wroclawski (MFCS, 2024)

On Computational Problems for Infinite Argumentation Frameworks: The Complexity of Finding Acceptable Extensions. - Uri Andrews; Luca San Mauro (NMR, 2024)

Investigating the Computable Friedman-Stanley jump. - Uri Andrews; Luca San Mauro (J. Symb. Log., 2024)

SCC-Recursiveness in Infinite Argumentation. - Uri Andrews; Luca San Mauro (JELIA (1), 2025)

Comparing Dialectical Systems: Contradiction and Counterexample in Belief Change. - Uri Andrews; Luca San Mauro (JELIA (2), 2025)

Comparing Dialectical Systems: Contradiction and Counterexample in Belief Change (Extended Version). - Uri Andrews; Luca San Mauro (CoRR, 2025)

SCC-recursiveness in infinite argumentation (extended version). - Uri Andrews; Luca San Mauro (CoRR, 2025)

On statistical learning of graphs. - Vittorio Cipriani; Valentino Delle Rose; Luca San Mauro; Giovanni Solda (CoRR, 2025)

Classifying different criteria for learning algebraic structures. - Nikolay Bazhenov 001; Vittorio Cipriani; Sanjay Jain 001; Luca San Mauro; Frank Stephan 001 (Ann. Pure Appl. Log., 2026)