The provability logic of all provability predicates
Taishi Kurahashi

TL;DR
This paper characterizes the provability logic of all provability predicates as a specific logic and introduces extensions with arithmetical semantics, covering various classes of provability predicates.
Contribution
It identifies the exact provability logic for all provability predicates and introduces three new logic extensions with their arithmetical semantics.
Findings
The provability logic of all provability predicates is exactly $ ext{N}$.
Introduces three extensions $ ext{N4}$, $ ext{NR}$, $ ext{NR4}$ with specific semantics.
These logics correspond to classes of provability predicates satisfying certain conditions.
Abstract
We prove that the provability logic of all provability predicates is exactly Fitting, Marek, and Truszczy\'nski's pure logic of necessitation . Moreover, we introduce three extensions , , and of and investigate the arithmetical semantics of these logics. In fact, we prove that , , and are the provability logics of all provability predicates satisfying the third condition of the derivabiity conditions, all Rosser's provability predicates, and all Rosser's provability predicates satisfying , respectively.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, Reasoning, and Knowledge · Advanced Algebra and Logic · Logic, programming, and type systems
