An Analytic Propositional Proof System on Graphs
-
Published:2022-10-21
Issue:
Volume:Volume 18, Issue 4
Page:
-
ISSN:1860-5974
-
Container-title:Logical Methods in Computer Science
-
language:en
-
Short-container-title:
Author:
Acclavio MatteoORCID,
Horne Ross,
Straßburger Lutz
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.
Publisher
Centre pour la Communication Scientifique Directe (CCSD)
Subject
General Computer Science,Theoretical Computer Science
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Enumerating Independent Linear Inferences;Logical Methods in Computer Science;2023-05-19