Talks

Tutorials (Summer School)

• Tarski-style axiomatic truth theories

  Ali Enayat

• The ubiquitous interpretation

  Albert Visser

• Impredicative ordinal analysis

  Henry Towsner

• Introduction to bounded arithmetic

  Raheleh Jalali

Invited Talks (Workshop)

• In memory of Wolfram Pohlers - a personal account

  Arnold Beckmann

• Predicative foundations of the Mahlo universe in Martin-Löf type theory

  Anton Setzer

• Taming proof systems towards uniform interpolation

  Iris van der Giessen

• The norms of RCA₀

  Juan Pablo Aguilera

• Proof theory of stable ordinals

  Toshiyasu Arai

Contributed Talks (Workshop)

• A modular ordinal analysis for fragments of induction principles

  Koshiro Ichikawa

• Justification logic for intuitionistic modal logic

  Paaras Padhiar

• Interpolation for the two-way modal $\mu$-calculus

  Johannes Kloibhofer

• The modal cube revisited: semantics without worlds

  Elaine Pimentel

• Three alternative systems with alternatives

  Luiz Carlos Pereira

• Predicative set theory: a new foundation for feasible mathematics

  Amirhossein Akbar Tabatabai

• Towards computing uniform interpolants for KM in Rocq

  Ian Shillito

• Non-deterministic operations in applicative theories

  Marcel Ertel

• Proof logging the generalized totalizer encoding

  Carlos Cantero

• Correctness of the AKS primality algorithm in bounded arithmetic

  Raheleh Jalali

• Speedup for Presburger arithmetic and real closed fields

  Julien Daoud

• A classification of the provably total set-recursive functions of KPl, KPl^r and W-KPl

  Anton Fernández

• Definiteness properties of arithmetical theories

  Piotr Gruza

• General inductive definitions and their proof theory from a perspective of knowledge representation

  Robbe Van den Eede

• Bilateralist base-extension semantics with incompatible proofs and refutations

  Victor Barroso Nascimiento, Maria Osório Costa, Elaine Pimentel

• A non-wellfounded and labelled sequent calculus for bimodal provability logic

  Justus Becker

• Non-wellfounded languages and proofs

  Philipp Provenzano

• Extracting computational content from cyclic proofs using higher order recursion schemes

  Giacomo Barlucchi

• Matching (co)patterns with cyclic proofs

  Lide Grotenhuis

• Predicative recursion on the Veblen hierarchy

  Vitor Greati

• Rewrite normalization in tree rewriting calculi for strictly positive logics

  Sofía Santiago-Fernández, David Fernández-Duque, Joost Joosten

• The barrier Ramsey theorem

  Andrea Volpi

• On the non-classical, non-monotonic and uniform proof-theoretic validity of Weak Excluded Middle

  Antonio Piccolomini d'Aragona

• A survey of two strands in proof-theoretic semantics

  Leonardo Ceragioli, Francesco Montesi, Antonio Piccolomini d'Aragona

• Meaningful proof systems and bilateralism

  Robin Martinot

• Unification for weak classical modal logics

  Mojtaba Mojtahedi