On Combinatorial Proofs for Modal Logic - Archive ouverte HAL Access content directly
Conference Papers Year : 2019

On Combinatorial Proofs for Modal Logic

(1, 2) , (2, 3)


In this paper we extend Hughes’ combinatorial proofs to modal logics. The crucial ingredient for modeling the modalities is the use of a self-dual non-commutative operator that has first been observed by Retoré through pomset logic. Consequently, we had to generalize the notion of skew fibration from cographs to Guglielmi’s relation webs. Our main result is a sound and complete system of combinatorial proofs for all normal and non-normal modal logics in the S4-tesseract. The proof of soundness and completeness is based on the sequent calculus with some added features from deep inference.
Fichier principal
Vignette du fichier
CPKfinal.pdf (467.12 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02390400 , version 1 (10-12-2019)



Matteo Acclavio, Lutz Strassburger. On Combinatorial Proofs for Modal Logic. TABLEAUX 2019 - 28t International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, Sep 2019, London, United Kingdom. pp.223-240, ⟨10.1007/978-3-030-29026-9_13⟩. ⟨hal-02390400⟩
64 View
226 Download



Gmail Facebook Twitter LinkedIn More