A fully labelled proof system for intuitionistic modal logics - Archive ouverte HAL Access content directly
Journal Articles Journal of Logic and Computation Year : 2021

A fully labelled proof system for intuitionistic modal logics

(1) , (2, 3, 4) , (2, 3, 4)
1
2
3
4

Abstract

Labelled proof theory has been famously successful for modal logics by mimicking their relational seman- tics within deductive systems. Simpson in particular designed a framework to study a variety of intuitionistic modal logics integrating a binary relation symbol in the syntax. In this paper, we present a labelled sequent system for intuitionistic modal logics such that there is not only one, but two relation symbols appearing in sequents: one for the accessibility relation associated with the Kripke semantics for normal modal logics and one for the preorder relation associated with the Kripke semantics for intuitionistic logic. This puts our system in close correspondence with the standard birelational Kripke semantics for intuitionistic modal logics. As a consequence it can be extended with arbitrary intuitionistic Scott-Lemmon axioms. We show soundness and completeness, together with an internal cut elimination proof, encompassing a wider array of intuitionistic modal logics than any existing labelled system.
Fichier principal
Vignette du fichier
document.pdf (422.97 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02390454 , version 1 (05-12-2019)
hal-02390454 , version 2 (30-10-2020)
hal-02390454 , version 3 (28-01-2021)

Identifiers

Cite

Sonia Marin, Marianela Morales, Lutz Strassburger. A fully labelled proof system for intuitionistic modal logics. Journal of Logic and Computation, 2021, 31 (3), pp.998-1022. ⟨10.1093/logcom/exab020⟩. ⟨hal-02390454v3⟩
230 View
333 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More