Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Propositional logic and modal logic—A connection via relational semantics

View through CrossRef
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.
Title: Propositional logic and modal logic—A connection via relational semantics
Description:
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.

Related Results

Autonomy on Trial
Autonomy on Trial
Photo by CHUTTERSNAP on Unsplash Abstract This paper critically examines how US bioethics and health law conceptualize patient autonomy, contrasting the rights-based, individualist...
Base-extension semantics for modal logic
Base-extension semantics for modal logic
Abstract In proof-theoretic semantics, meaning is based on inference. It may seen as the mathematical expression of the inferentialist interpretation of logic. Much ...
Provability logic
Provability logic
Central to Gödel’s second incompleteness theorem is his discovery that, in a sense, a formal system can talk about itself. Provability logic is a branch of modal logic specifically...
Non-Propositional Evidentiality
Non-Propositional Evidentiality
AbstractThis chapter deals with non-propositional evidentiality, i.e. evidential-like distinctions on markers whose scope is limited to a noun phrase. First, it presents the differ...
Predicate calculus
Predicate calculus
The predicate calculus is the dominant system of modern logic, having displaced the traditional Aristotelian syllogistic logic that had been the previous paradigm. Like Aristotle’s...
Remarks on propositional nominalization
Remarks on propositional nominalization
Moulton’s ‘Remarks on propositional nominalization’ investigates nominalization at the highest reaches of the extended verbal projection, finite CPs. While CPs can express proposit...
A logic of defeasible argumentation: Constructing arguments in justification logic
A logic of defeasible argumentation: Constructing arguments in justification logic
In the 1980s, Pollock’s work on default reasons started the quest in the AI community for a formal system of defeasible argumentation. The main goal of this paper is to provide a l...
Weak Belnapian modal logic
Weak Belnapian modal logic
Abstract In this paper, a new modal logic extending the first-degree entailment (FDE) system is introduced. This system, called weak Belnapian modal logic (WBK), is ...

Back to Top