On Kripke-style Semantics for the Provability Logic of Gödel's Proof Predicate with Quantifiers on Proofs
Abstract
Index Terms
- On Kripke-style Semantics for the Provability Logic of Gödel's Proof Predicate with Quantifiers on Proofs
Recommendations
A Finitary Treatment of the Closed Fragment of Japaridze's Provability Logic
We study a propositional polymodal provability logic GLP introduced by G. Japaridze. Previous treatments of this logic, due to Japaridze and Ignatiev, heavily relied on some non-finitary principles such as transfinite induction up to ε0 or reflection ...
Mechanising Gödel–Löb Provability Logic in HOL Light
AbstractWe introduce our implementation in HOL Light of the metatheory for Gödel–Löb provability logic (GL), covering soundness and completeness w.r.t. possible world semantics and featuring a prototype of a theorem prover for GL itself. The strategy we ...
Kripke Semantics for Modal Substructural Logics
We introduce Kripke semantics for modal substructural logics, and prove the completeness theorems with respect to the semantics. The completeness theorems are proved using an extended Ishihara's method of canonical model construction (Ishihara, 2000). The ...
Comments
Information & Contributors
Information
Published In
Publisher
Oxford University Press, Inc.
United States
Publication History
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in