English

A modal logic amalgam of classical and intuitionistic propositional logic

Logic in Computer Science 2015-08-05 v2 Logic

Abstract

A famous result, conjectured by G\"odel in 1932 and proved by McKinsey and Tarski in 1948, says that φ\varphi is a theorem of intuitionistic propositional logic IPC iff its G\"odel-translation φ\varphi' is a theorem of modal logic S4. In this paper, we extend an intuitionistic version of modal logic S1+SP, introduced in our previous paper (S. Lewitzka, Algebraic semantics for a modal logic close to S1, J. Logic and Comp., doi:10.1093/logcom/exu067) to a classical modal logic L and prove the following: a propositional formula φ\varphi is a theorem of IPC iff φ\square\varphi is a theorem of L (actually, we show: ΦIPCφ\Phi\vdash_{IPC}\varphi iff ΦLφ\square\Phi\vdash_L\square\varphi, for propositional Φ,φ\Phi,\varphi). Thus, the map φφ\varphi\mapsto\square\varphi is an embedding of IPC into L, i.e. L contains a copy of IPC. Moreover, L is a conservative extension of classical propositional logic CPC. In this sense, L is an amalgam of CPC and IPC. We show that L is sound and complete w.r.t. a class of special Heyting algebras with a (non-normal) modal operator.

Keywords

Cite

@article{arxiv.1306.2068,
  title  = {A modal logic amalgam of classical and intuitionistic propositional logic},
  author = {Steffen Lewitzka},
  journal= {arXiv preprint arXiv:1306.2068},
  year   = {2015}
}

Comments

18 pages

R2 v1 2026-06-22T00:30:47.018Z