Luca San Mauro

35 papers A 1B 3C 1Journal 23Unranked 7
YearRankTypeTitle / Venue / Authors
2026 J jnl
Classifying different criteria for learning algebraic structures.
Ann. Pure Appl. Log.
Nikolay Bazhenov, Vittorio Cipriani, Sanjay Jain, Luca San Mauro, Frank Stephan
2025 J jnl
Comparing Dialectical Systems: Contradiction and Counterexample in Belief Change (Extended Version).
CoRR
Uri Andrews, Luca San Mauro
2025 — conf
Comparing Dialectical Systems: Contradiction and Counterexample in Belief Change.
JELIA (2)
Uri Andrews, Luca San Mauro
2025 A conf
Complexity in Finitary Argumentation.
ECAI
Uri Andrews, Luca San Mauro
2025 J jnl
Complexity in finitary argumentation (extended version).
CoRR
Uri Andrews, Luca San Mauro
2025 J jnl
On statistical learning of graphs.
CoRR
Vittorio Cipriani, Valentino Delle Rose, Luca San Mauro, Giovanni Soldà
2025 B conf
On the Complexity of the Grounded Semantics for Infinite Argumentation Frameworks.
TARK
Uri Andrews, Luca San Mauro
2025 — conf
SCC-Recursiveness in Infinite Argumentation.
JELIA (1)
Uri Andrews, Luca San Mauro
2025 J jnl
SCC-recursiveness in infinite argumentation (extended version).
CoRR
Uri Andrews, Luca San Mauro
2024 J jnl
Investigating the Computable Friedman-Stanley jump.
J. Symb. Log.
Uri Andrews, Luca San Mauro
2024 — conf
On Computational Problems for Infinite Argumentation Frameworks: Classifying Complexity via Computability.
SAFA
Uri Andrews, Luca San Mauro
2024 — conf
On Computational Problems for Infinite Argumentation Frameworks: Hardness of Finding Acceptable Extensions.
AI³@AI*IA
Uri Andrews, Luca San Mauro
2024 — conf
On Computational Problems for Infinite Argumentation Frameworks: Hardness of Finding Acceptable Extensions.
FCR@KI
Uri Andrews, Luca San Mauro
2024 — conf
On Computational Problems for Infinite Argumentation Frameworks: The Complexity of Finding Acceptable Extensions.
NMR
Uri Andrews, Luca San Mauro
2024 B conf
Punctual Presentability in Certain Classes of Algebraic Structures.
MFCS
Dariusz Kalocinski, Luca San Mauro, Michal Wroclawski
2023 J jnl
Classifying word problems of finitely generated algebras via computable reducibility.
Int. J. Algebra Comput.
Valentino Delle Rose, Luca San Mauro, Andrea Sorbi
2023 J jnl
Learning algebraic structures with the help of Borel equivalence relations.
Theor. Comput. Sci.
Nikolay Bazhenov, Vittorio Cipriani, Luca San Mauro
2023 J jnl
On the Structure of Computable Reducibility on Equivalence Relations of Natural numbers.
J. Symb. Log.
Uri Andrews, Daniel F. Belin, Luca San Mauro
2022 C conf
Calculating the Mind Change Complexity of Learning Algebraic Structures.
CiE
Nikolay Bazhenov, Vittorio Cipriani, Luca San Mauro
2022 J jnl
Primitive recursive equivalence relations and their primitive recursive complexity.
Comput.
Nikolay Bazhenov, Keng Meng Ng, Luca San Mauro, Andrea Sorbi
2021 — conf
Approximating Approximate Reasoning: Fuzzy Sets and the Ershov Hierarchy.
LORI
Nikolay Bazhenov, Manat Mustafa, Sergei Ospichev, Luca San Mauro
2021 J jnl
Degrees of bi-embeddable categoricity.
Comput.
Nikolay Bazhenov, Ekaterina B. Fokina, Dino Rossegger, Luca San Mauro
2021 J jnl
On the Turing complexity of learning finite families of algebraic structures.
J. Log. Comput.
Nikolay Bazhenov, Luca San Mauro
2021 J jnl
Speech acts in mathematics.
Synth.
Marco Ruffino, Luca San Mauro, Giorgio Venturi
2020 J jnl
Classifying equivalence relations in the Ershov hierarchy.
Arch. Math. Log.
Nikolay Bazhenov, Manat Mustafa, Luca San Mauro, Andrea Sorbi, Mars M. Yamaleev
2020 J jnl
Learning families of algebraic structures from informant.
Inf. Comput.
Nikolay Bazhenov, Ekaterina B. Fokina, Luca San Mauro
2020 J jnl
Word problems and ceers.
Math. Log. Q.
Valentino Delle Rose, Luca San Mauro, Andrea Sorbi
2019 J jnl
Bi-embeddability spectra and bases of spectra.
Math. Log. Q.
Ekaterina B. Fokina, Dino Rossegger, Luca San Mauro
2019 J jnl
Degrees of bi-embeddable categoricity of equivalence structures.
Arch. Math. Log.
Nikolay Bazhenov, Ekaterina B. Fokina, Dino Rossegger, Luca San Mauro
2019 B conf
Limit Learning Equivalence Structures.
ALT
Ekaterina B. Fokina, Timo Kötzing, Luca San Mauro
2019 J jnl
Measuring the complexity of reductions between equivalence relations.
Comput.
Ekaterina B. Fokina, Dino Rossegger, Luca San Mauro
2019 J jnl
Trial and error mathematics: Dialectical systems and completions of theories.
J. Log. Comput.
Jacopo Amidei, Uri Andrews, Duccio Pianigiani, Luca San Mauro, Andrea Sorbi
2016 J jnl
Trial and error Mathematics I: Dialectical and Quasidialectical Systems.
Rev. Symb. Log.
Jacopo Amidei, Duccio Pianigiani, Luca San Mauro, Giulia Simi, Andrea Sorbi
2016 J jnl
Trial and error Mathematics II: Dialectical Sets and Quasidialectical Sets, their Degrees, and their Distribution within the class of Limit Sets.
Rev. Symb. Log.
Jacopo Amidei, Duccio Pianigiani, Luca San Mauro, Andrea Sorbi
2014 J jnl
Universal computably Enumerable Equivalence Relations.
J. Symb. Log.
Uri Andrews, Steffen Lempp, Joseph S. Miller, Keng Meng Ng, Luca San Mauro, Andrea Sorbi