Volume 1, Issue 4 (2021)                   jpt 2021, 1(4): 313-339 | Back to browse issues page

‎ 10.58209/jpt.1.4.313

XML Persian Abstract Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
Nabavi L, Mirsanei S. Propositional Provability Logics. jpt 2021; 1 (4) :313-339
URL: http://jpt.modares.ac.ir/article-34-57996-en.html
Propositional Provability Logics
L. Nabavi1, S.A. Mirsanei *2
1- Department of Philosophy, Faculty of Humanities, Tarbiat Modares University, Tehran, Iran
2- Department of Philosophy, Faculty of Humanities, Tarbiat Modares University, Tehran, Iran , sa.mir@modares.ac.ir
Abstract:   (2144 Views)
Discovering the differences between the various systems of modal logics was one of the advantages of inventing Kripke semantics. One of the most obvious examples is interpreting the necessity of provability in provability logic. According to Boolos in The Logic of Provability, by discovering this logic, we can say that the understanding of new issues in the field of argument was opened. In this paper, with a formal approach and with a descriptive-analytical and comparative method, the axiomatic propositional systems of the GL, Grz, and H, and their possible world semantics based on Kripke semantics are studied, as well as the sequent calculus of GL (in Peano arithmetic) and GLS (in the standard model) were introduced. Finally, the meta-theorems of soundness, consistency, and completeness of the GL were interpreted and proved.
Keywords: Provability Logic , Modal Logic , Axiomatic System , Proof Theory , Possible World Semantics , Meta-Theorems
Full-Text [PDF 794 kb]   (1956 Downloads)    
Article Type: Original Research | Subject: Logic and Philosophy of Logic (Modern)
Received: 2021/12/18 | Accepted: 2021/12/27 | Published: 2022/02/5
* Corresponding Author Address: Νο. 94, Αalley 59, Imam St., Qom, Iran Postal code: 3718665835
Add your comments about this article : Your username or Email:
CAPTCHA
Send email to the article author

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.