Luca San Mauro

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 21

Top Topics

Equivalence Relation

Rough Set Theory

Top Venues

J. Log. Comput.

Arch. Math. Log.

Publications

Uri Andrews, Luca San Mauro
Investigating the Computable Friedman-Stanley jump. J. Symb. Log. 89 (2) (2024)
Dariusz Kalocinski, Luca San Mauro, Michal Wroclawski
Punctual Presentability in Certain Classes of Algebraic Structures. MFCS (2024)
Uri Andrews, Daniel F. Belin, Luca San Mauro
On the Structure of Computable Reducibility on Equivalence Relations of Natural numbers. J. Symb. Log. 88 (3) (2023)
Nikolay Bazhenov, Vittorio Cipriani, Luca San Mauro
Learning algebraic structures with the help of Borel equivalence relations. Theor. Comput. Sci. 951 (2023)
Valentino Delle Rose, Luca San Mauro, Andrea Sorbi
Classifying word problems of finitely generated algebras via computable reducibility. Int. J. Algebra Comput. 33 (4) (2023)
Nikolay Bazhenov, Keng Meng Ng, Luca San Mauro, Andrea Sorbi
Primitive recursive equivalence relations and their primitive recursive complexity. Comput. 11 (3-4) (2022)
Nikolay Bazhenov, Vittorio Cipriani, Luca San Mauro
Calculating the Mind Change Complexity of Learning Algebraic Structures. CiE (2022)
Marco Ruffino, Luca San Mauro, Giorgio Venturi
Speech acts in mathematics. Synth. 198 (10) (2021)
Nikolay Bazhenov, Ekaterina B. Fokina, Dino Rossegger, Luca San Mauro
Degrees of bi-embeddable categoricity. Comput. 10 (1) (2021)
Nikolay Bazhenov, Manat Mustafa, Sergei Ospichev, Luca San Mauro
Approximating Approximate Reasoning: Fuzzy Sets and the Ershov Hierarchy. LORI (2021)
Nikolay Bazhenov, Luca San Mauro
On the Turing complexity of learning finite families of algebraic structures. J. Log. Comput. 31 (7) (2021)
Nikolay Bazhenov, Manat Mustafa, Luca San Mauro, Andrea Sorbi, Mars M. Yamaleev
Classifying equivalence relations in the Ershov hierarchy. Arch. Math. Log. 59 (7-8) (2020)
Nikolay Bazhenov, Ekaterina B. Fokina, Luca San Mauro
Learning families of algebraic structures from informant. Inf. Comput. 275 (2020)
Valentino Delle Rose, Luca San Mauro, Andrea Sorbi
Word problems and ceers. Math. Log. Q. 66 (3) (2020)
Ekaterina B. Fokina, Timo Kötzing, Luca San Mauro
Limit Learning Equivalence Structures. ALT (2019)
Nikolay Bazhenov, Ekaterina B. Fokina, Dino Rossegger, Luca San Mauro
Degrees of bi-embeddable categoricity of equivalence structures. Arch. Math. Log. 58 (5-6) (2019)
Ekaterina B. Fokina, Dino Rossegger, Luca San Mauro
Bi-embeddability spectra and bases of spectra. Math. Log. Q. 65 (2) (2019)
Ekaterina B. Fokina, Dino Rossegger, Luca San Mauro
Measuring the complexity of reductions between equivalence relations. Comput. 8 (3-4) (2019)
Jacopo Amidei, Uri Andrews, Duccio Pianigiani, Luca San Mauro, Andrea Sorbi
Trial and error mathematics: Dialectical systems and completions of theories. J. Log. Comput. 29 (1) (2019)
Jacopo Amidei, Duccio Pianigiani, Luca San Mauro, Andrea Sorbi
Trial and error Mathematics II: Dialectical Sets and Quasidialectical Sets, their Degrees, and their Distribution within the class of Limit Sets. Rev. Symb. Log. 9 (4) (2016)
Jacopo Amidei, Duccio Pianigiani, Luca San Mauro, Giulia Simi, Andrea Sorbi
Trial and error Mathematics I: Dialectical and Quasidialectical Systems. Rev. Symb. Log. 9 (2) (2016)
Uri Andrews, Steffen Lempp, Joseph S. Miller, Keng Meng Ng, Luca San Mauro, Andrea Sorbi
Universal computably Enumerable Equivalence Relations. J. Symb. Log. 79 (1) (2014)