Paperlane

no. 16 · Tuesday 17 November 2026

Non-Wellfounded and Labelled Sequent Calculi for Bimodal Provability Logics

Justus Becker

math.LO · v2 · 40 pp

Abstract

Bimodal provability logics are modal logics where the two modalities are interpreted as two formal provability predicates of arithmetic theories. We present modular labelled calculi for four different bimodal provability logics, whose rules arise from the relational semantics of these logics, while the second-order property of Noetherianity of models is enforced using techniques from cyclic proof theory. Completeness with respect to the semantics is established via proof search and countermodel construction. We further present regular and finite variants of the calculi via proof transformations.

comments
40 pages
fields
Logic
pdf ↗ page arXiv:2506.14307 ↗