An analytic propositional proof system on graphs

Acclavio, Matteo and Horne, Ross and Straßburger, Lutz (2022) An analytic propositional proof system on graphs. Logical Methods in Computer Science, 18 (4). 1:1-1:80. ISSN 1860-5974 (https://doi.org/10.46298/LMCS-18(4:1)2022)

[thumbnail of Acclavio-etal-LMCS-2022-An-analytic-propositional-proof-system-on-graphs]
Preview
 Text. Filename: Acclavio_etal_LMCS_2022_An_analytic_propositional_proof_system_on_graphs.pdf
Final Published Version
License: Creative Commons Attribution 4.0 logo
Download (958kB)| Preview

Abstract

In this paper we present a proof system that operates on graphs instead of formulas. Starting from the well-known relationship between formulas and cographs, we drop the cograph-conditions and look at arbitrary (undirected) graphs. This means that we lose the tree structure of the formulas corresponding to the cographs, and we can no longer use standard proof theoretical methods that depend on that tree structure. In order to overcome this difficulty, we use a modular decomposition of graphs and some techniques from deep inference where inference rules do not rely on the main connective of a formula. For our proof system we show the admissibility of cut and a generalisation of the splitting property. Finally, we show that our system is a conservative extension of multiplicative linear logic with mix, and we argue that our graphs form a notion of generalised connective.

CORE (COnnecting REpositories)