Propositional logic and modal logic—A connection via relational semantics

Abstract In this paper, by slightly generalizing an observation of Dalla Chiara and Giuntini in their chapter on quantum logic in Handbook of Philosophical Logic, we propose a relational semantics for propositional language with negation and conjunction, which unifies the relational semantics of intuitionistic logic and that of ortho-logic. We study the semantic and syntactic consequence relations and prove the soundness and completeness theorems for five propositional logics: $\textbf{BL}$, $\textbf{PL}$, $\textbf{IL}$, $\textbf{OL}$ and $\textbf{CL}$. Moreover, we prove that they can be translated into the modal logics $\textbf{K}$, $\textbf{T}$, $\textbf{S4}$, $\textbf{KTB}$ and $\textbf{S5}$, respectively, and thus establish a systematic connection between propositional logics and modal logics. The paper ends with a discussion about the possibility and difficulty of incorporating disjunction into our framework.

Authors

Institutions

Publication Details

Journal
Journal of Logic and Computation
Published
2024-09-23
DOI
https://doi.org/10.1093/logcom/exae060
Citations
1
Primary Topic
Logic, Reasoning, and Knowledge
Type
article
Field-Weighted Citation Impact
0.35

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Propositional logic and modal logic—A connection via relational semantics

Shengyang Zhong
1 citations
Journal of Logic and Computation
Logic, Reasoning, and Knowledge
0.35
article

Propositional logic and modal logic—A connection via relational semantics

Shengyang Zhong
article en
1 citations

Abstract

Abstract In this paper, by slightly generalizing an observation of Dalla Chiara and Giuntini in their chapter on quantum logic in Handbook of Philosophical Logic, we propose a relational semantics for propositional language with negation and conjunction, which unifies the relational semantics of intuitionistic logic and that of ortho-logic. We study the semantic and syntactic consequence relations and prove the soundness and completeness theorems for five propositional logics: $\textbf{BL}$, $\textbf{PL}$, $\textbf{IL}$, $\textbf{OL}$ and $\textbf{CL}$. Moreover, we prove that they can be translated into the modal logics $\textbf{K}$, $\textbf{T}$, $\textbf{S4}$, $\textbf{KTB}$ and $\textbf{S5}$, respectively, and thus establish a systematic connection between propositional logics and modal logics. The paper ends with a discussion about the possibility and difficulty of incorporating disjunction into our framework.

Journal of Logic and ComputationVol. 35(6)
Peking University (CN)
National Office for Philosophy and Social Sciences
Openalex Percentile: Top 33%
Logic, Reasoning, and Knowledge
0.35
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.