Generalized Computability Theory, March 2027, Oberwolfach, Germany (upcoming)
Mathematical Logic: Proof Theory, Constructive Mathematics, November 2026, Oberwolfach, Germany (upcoming)
Colloquium Logicum, September 2026, Würzburg, Germany (upcoming)
Invited Talk: Well-Ordering Principles across Reverse Mathematics (PhD Colloquium)
45es Journées sur les Arithmétiques Faibles, September 2026, Warsaw, Poland (upcoming)
Invited Talk: TBD
22nd Conference on Computability in Europe, July 2026, Trier, Germany (upcoming)
Talk: The more Gödels, the better
Logic Colloquium, June 2026, Swansea, UK
Talk: Independence of premise for IZF
Twenty-Second International Conference on Computability and Complexity in Analysis, September 2025, Kyoto, Japan
Invited Talk: Computable transformations of Turing degrees
Weihrauch Complexity: Structuring the Realm of Non-Computability, March 2025, Dagstuhl, Germany
Talk: Weihrauch degrees without roots
Leeds Computability Days, July 2024, Leeds, UK
Invited Talk: Weihrauch degrees without roots
Logic Colloquium, June 2024, Gothenburg, Sweden
Talk: Sequences with gap condition and binary trees with ascending labels
Trends in Proof Theory 2024, February 2024, Vienna, Austria
Talk: Gap sequences and ascending trees
Autumn school "Proof and Computation", September 2023, Herrsching, Germany
Summer School and Workshop on Proof Theory and its Applications, July 2023, Barcelona, Spain
Logic Colloquium, June 2023, Milan, Italy
Talk: On inverse Goodstein sequences
Trends in Proof Theory, January 2023, Ghent, Belgium
Talk: On inverse Goodstein sequences
Autumn school "Proof and Computation", September 2022, Fischbachau, Germany
Logic Colloquium, June 2022, Reykjavik, Iceland
Talk: Weak and Strong Versions of Effective Transfinite Recursion
Leeds-Ghent Virtual Logic Seminar, March 2022, Online
Invited Talk: Weak and Strong Versions of Effective Transfinite Recursion
"Computability Theory and Applications" Online Seminar, September 2020, Online
Invited Talk: The characterization of Weihrauch reducibility in systems containing E-PAω + QF-AC0,0
Measuring the Complexity of Computational Content, September 2018, Dagstuhl, Germany
Talk: Proof-theoretic characterization of Weihrauch reducibility