Talks
Invited talks
(12/2024) On the complexity of infinite argumentation
Applications of Logic workshop, Institute of Philosophy of the Slovak Academy of Sciences(07/2024) A new way of classifying word problems
AMS-UMI International Joint Meeting, University of Palermo (special session on Computability Theory)(05/2024) On the learning power of equivalence relations
ASL North American Meeting 2024, Iowa State University (special session on Computability Theory)(05/2024) Exploring the learning power of Borel equivalence relations
Equivalences, Numberings, Reducibilities 2024, Nazarbayev University, Astana(01/2023) Learning the intended model of arithmetic
Torino-Pisa-Konstanz workshop, University of Konstanz(01/2023) Settling algebraic questions with logic
World Logic Day 2023, Nazarbayev University, Astana(11/2022) Effectivizing the theory of Borel equivalence relations
Midwest Computability Seminar, University of Chicago(09/2022) Learning mathematical structures
Logic and Philosophy of Mathematics workshop, Scuola Normale Superiore, Pisa(09/2022) A computable analog of the theory of Borel equivalence relations
AILA meeting 2022, University of Campania(07/2022) Classifying equivalence relations on the natural numbers
Latin American Symposium on Mathematical Logic 2022, University of Costa Rica(06/2022) Computable reductions of equivalence relations
Logic Colloquium 2022, Reykjavik University (tutorial)(03/2021) Classifying word problems
Computability Theory and Applications Online Seminar(12/2020) Revisiting the complexity of word problems
Torino-Udine Logic seminar(06/2020) Learning algebraic structures
Computability in Europe 2020, University of Salerno (special session on Algorithmic Learning Theory)(06/2020) Word problems and ceers
Reverse mathematics, numberings, and equivalence relations workshop(02/2020) Beyond isomorphism: The interplay between structures and computation
Structuralist Foundations workshop, University of Vienna(12/2019) The global structure of degrees of equivalence relations
First Workshop on Digitalization and Computable Models, Novosibirsk State University(12/2019) The complexity of punctual equivalence relations
Studies in Mathematical Logic workshop, University of São Paulo(06/2019) Computable reducibility and its variants
Computability, Complexity, and Randomness 2019, Nazarbayev University, Nur-Sultan(09/2016) Trial and error mathematics
17th Logic Workshop: Computation-Arithmetics-Cognition (tutorial)
Contributed talks
More than 50 contributed talks given, including several editions of Logic Colloquium, Computability in Europe, and Computability, Complexity and Randomness
SEMINAR talks
University of Warsaw, Sapienza University of Rome, University of Udine, University of Florence, University of Chieti-Pescara, University of Turin, University of Konstanz, University of Padua, University of Wisconsin-Madison, University of Pavia, Scuola Normale Superiore in Pisa, Sobolev Institute of Mathematics (Novosibirsk), Vita-Salute San Raffaele University (Milan), Hasso Plattner Institute (Potsdam), University of Campinas, University of Bologna, University of Urbino, University of Buenos Aires