← 研踪 PaperTrailarXiv:2506.14307 · v2
Non-Wellfounded and Labelled Sequent Calculi for Bimodal Provability Logics
首次提交 2025-06-17 16:35
版本更新 2026-11-17 00:44
雷达观测 2026-11-17 16:10
摘要
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.
作者备注:40 pages
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v2 · 2026-11-17 00:44 · 最新观测版本
Non-Wellfounded and Labelled Sequent Calculi for Bimodal Provability Logics
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.
查看此版本解读 →查看此版本原文 ↗