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.
| Original language | English |
|---|---|
| Pages (from-to) | 1:1-1:80 |
| Number of pages | 80 |
| Journal | Logical Methods in Computer Science |
| Volume | 18 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - 21 Oct 2022 |
Funding
We are very grateful for insightful discussions with Anupam Das, particularly when exploring relationships between GS and linear inferences in classical logic. We would also like to thank the anonymous referees who made valuable suggestions for improving the content and quality of this article.
Keywords
- analyticity
- proof theory
- cut elimination
- deep inference
- prime graphs
- splitting