Luca San Mauro

According to our database, Luca San Mauro authored at least 20 papers between 2014 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

Classifying word problems of finitely generated algebras via computable reducibility.

Valentino Delle Rose, Luca San Mauro, Andrea Sorbi

Int. J. Algebra Comput., June, 2023

Learning algebraic structures with the help of Borel equivalence relations.

Nikolay Bazhenov, Vittorio Cipriani, Luca San Mauro

Theor. Comput. Sci., March, 2023

On the Structure of Computable Reducibility on Equivalence Relations of Natural numbers.

Uri Andrews, Daniel F. Belin, Luca San Mauro

J. Symb. Log., 2023

2022

Primitive recursive equivalence relations and their primitive recursive complexity.

Nikolay Bazhenov, Keng Meng Ng, Luca San Mauro, Andrea Sorbi

Comput., 2022

Calculating the Mind Change Complexity of Learning Algebraic Structures.

Nikolay Bazhenov, Vittorio Cipriani, Luca San Mauro

Proceedings of the Revolutions and Revelations in Computability, 2022

2021

Speech acts in mathematics.

Marco Ruffino, Luca San Mauro, Giorgio Venturi

Synth., 2021

On the Turing complexity of learning finite families of algebraic structures.

Nikolay Bazhenov, Luca San Mauro

J. Log. Comput., 2021

Degrees of bi-embeddable categoricity.

Nikolay Bazhenov, Ekaterina B. Fokina, Dino Rossegger, Luca San Mauro

Comput., 2021

Approximating Approximate Reasoning: Fuzzy Sets and the Ershov Hierarchy.

Nikolay Bazhenov, Manat Mustafa, Sergei Ospichev, Luca San Mauro

Proceedings of the Logic, Rationality, and Interaction - 8th International Workshop, 2021

2020

Word problems and ceers.

Valentino Delle Rose, Luca San Mauro, Andrea Sorbi

Math. Log. Q., 2020

Learning families of algebraic structures from informant.

Nikolay Bazhenov, Ekaterina B. Fokina, Luca San Mauro

Inf. Comput., 2020

Classifying equivalence relations in the Ershov hierarchy.

Nikolay Bazhenov, Manat Mustafa, Luca San Mauro, Andrea Sorbi, Mars M. Yamaleev

Arch. Math. Log., 2020

2019

Bi-embeddability spectra and bases of spectra.

Ekaterina B. Fokina, Dino Rossegger, Luca San Mauro

Math. Log. Q., 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

Measuring the complexity of reductions between equivalence relations.

Ekaterina B. Fokina, Dino Rossegger, Luca San Mauro

Comput., 2019

Degrees of bi-embeddable categoricity of equivalence structures.

Nikolay Bazhenov, Ekaterina B. Fokina, Dino Rossegger, Luca San Mauro

Arch. Math. Log., 2019

Limit Learning Equivalence Structures.

Ekaterina B. Fokina, Timo Kötzing, Luca San Mauro

Proceedings of the Algorithmic Learning Theory, 2019

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

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

2014

Universal computably Enumerable Equivalence Relations.

Uri Andrews, Steffen Lempp, Joseph S. Miller, Keng Meng Ng, Luca San Mauro, Andrea Sorbi

J. Symb. Log., 2014