| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
On Combinatorial Proofs for Modal Logic
Abstract : 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.
Cited literature [33 references]
https://hal.inria.fr/hal-02390400
Contributor : Lutz Straßburger <>
Submitted on : Tuesday, December 10, 2019 - 9:39:09 AM
Last modification on : Thursday, January 7, 2021 - 3:40:15 PM
Long-term archiving on: : Wednesday, March 11, 2020 - 3:02:23 PM
Contributor : Lutz Straßburger <>
Submitted on : Tuesday, December 10, 2019 - 9:39:09 AM
Last modification on : Thursday, January 7, 2021 - 3:40:15 PM
Long-term archiving on: : Wednesday, March 11, 2020 - 3:02:23 PM
File
CPKfinal.pdf
Files produced by the author(s)