Slides for talks

Towards analysis in VTC^{0},
Proof Complexity 2024, Oxford, September 2024.
[PDF,
PS]

On the theory of exponential integer parts,
Mathematical Logic: Proof Theory, Constructive Mathematics, Oberwolfach, November 2023.
[PDF,
PS]

On the complexity of addition,
Czech Gathering of Logicians, Ostrava, June 2023.
[PDF,
PS]

A simplified lower bound on intuitionistic implicational proofs,
Computer Science Seminar, Palacký University, Olomouc, November 2023.
[PDF,
PS]
Another version: Logic Seminar, Prague, May 2023.
[PDF,
PS]

Elementary analytic functions in VTC^{0},
Complexity Theory with a Human Face, Špindlerův Mlýn, June 2022.
[PDF,
PS]
A version with more background: Czech Gathering of Logicians, Prague, June 2022.
[PDF,
PS]
An expanded technical version: Logic Seminar, Prague, October 2022.
[PDF,
PS]

Hereditarily bounded sets,
Online International Workshop on Gödel’s Incompleteness Theorems, August 2021.
[PDF,
PS]

Disjunction properties in modal proof complexity,
The Utrecht Logic in Progress Series, February 2021.
[PDF,
PS]

Iterated multiplication in VTC^{0},
logic seminar, Prague, October 2020 (abridged version in Oberwolfach meeting Mathematical Logic: Proof Theory, Constructive Mathematics, November 2020).
[PDF,
PS]

Reflection principles in weak and strong arithmetics,
Logic Colloquium,
Prague, August 2019.
[PDF,
PS]

Admissible rules and their complexity,
24th Applications of Logic in Philosophy and the Foundations of Mathematics,
Szklarska Poręba, May 2019.
[PDF,
PS]

Factoring and bounded arithmetic,
Symposium on 50 Years of Complexity Theory: A Celebration of the Work of Stephen Cook, Toronto, May 2019.
[PDF,
PS]

Bounded induction without parameters,
FEALORA Farewell Workshop, Špindlerův Mlýn, November 2018.
[PDF,
PS]

Counting in weak theories,
Logic Colloquium, Stockholm, August 2017.
[PDF,
PS]

Fragments of intuitionistic logic and proof complexity,
Logic, Algebra, and Truth Degrees, Phalaborwa, June 2016.
[PDF,
PS]

Diophantine formulas,
Journées sur les Arithmétiques Faibles 35, Lisbon, June 2016.
[PDF,
PS]

Generalizing the clone–coclone Galois connection,
Topology, Algebra, and Categories in Logic, Ischia, June 2015.
[PDF,
PS]

Recursive functions vs. classification theory,
Utrecht Workshop on Proof Theory, April 2015.
[PDF,
PS]

Parameterfree induction in bounded arithmetic,
Proof Complexity, Vienna, July 2014.
[PDF,
PS]

Complexity of unification and admissibility with parameters in transitive modal logics,
10th International Tbilisi Symposium on Language, Logic and Computation (TbiLLC), Gudauri, September 2013.
[PDF,
PS]

Open induction in a TC^{0} arithmetic,
Logic Colloquium, Évora, July 2013.
[PDF,
PS]
An expanded version: Prague Gathering of Logicians, February 2014.
[PDF,
PS]

Logics with directed unification,
Algebra and Coalgebra meet Proof Theory, Utrecht, April 2013.
[PDF,
PS]

Admissibility and unification with parameters,
Logic, Algebra, and Truth Degrees, Kanazawa, September 2012.
[PDF,
PS]

Rules with parameters in modal logic,
The 26th International Workshop on Unification (UNIF), Manchester, July 2012.
[PDF,
PS]

Root finding in TC^{0} and open induction,
Logical Approaches to Barriers in Complexity II, Cambridge, March 2012.
[PDF,
PS]

Admissible rules and Łukasiewicz logic.
This is a common unifier (not quite the mgu) of
related talks presented at
Algebraic Semantics for Uncertainty and Vagueness (Salerno, May 2011),
Workshop on Admissible Rules and Unification (Utrecht, May 2011),
and, in part, Logic Colloquium (Sofia, July 2009).
[PDF,
PS]

Proofs with monotone cuts,
Logic Colloquium, Paris, July 2010.
[PDF,
PS]

Approximate counting in bounded arithmetic,
29es Journées sur les Arithmétiques Faibles, Warsaw, June 2010.
[PDF,
PS]

On monotone sequent calculus,
Barriers in Computational Complexity workshop, Princeton, August 2009.
[PDF,
PS]

Proof systems for modal logics, Logic Colloquium,
Wrocław, July 2007.
[PDF,
PS]

Canonical rules,
Derivation Rules and Unification (International Workshop on Modal Logic
IWML06), Istanbul, June 2006.
[PDF,
PS]

Approximate counting in bounded arithmetic,
New Directions in Proof Complexity,
Cambridge, April 2006.
[PDF,
PS]