Monthly Lecture

Infinitary Provability Logic

Mojtaba Mojtahedi (Ghent University, Belgium)

Abstract

The Gödel–Löb provability logic GL is a modal logic that is complete with respect to transitive, conversely well-founded Kripke frames and, by Solovay's theorem, captures exactly the principles about provability in PA that PA itself proves. In this talk we ask what the infinitary counterpart of GL is, that is, what happens when the modal language is enriched with countably infinite conjunctions and disjunctions. We show that, unlike the finitary case, the usual sequent calculi do not work here; instead we introduce a nested sequent calculus with non-well-founded proofs, in which every infinite branch of a proof must contain infinitely many nested applications of the ☐ rule. The main result is that this calculus is sound and complete with respect to transitive, conversely well-founded Kripke models and that cut is admissible in it, while the Kripke completeness of the corresponding Hilbert system remains an open question.

Finally, we briefly discuss the provability interpretation in Kripke–Platek set theory KP: we show that the provability logic of a suitable extension of KP is a sublogic of the sequent calculus introduced.

Date: Monday, 16 November 2026

Time: 16:00–17:30 (Tehran time)

Format: Online

Join the online session