Log In Sign Up

Introducing Proof Tree Automata and Proof Tree Graphs

by   Valentin D. Richard, et al.

In structural proof theory, designing and working on large calculi make it difficult to get intuitions about each rule individually and as part of a whole system. We introduce two novel tools to help working on calculi using the approach of graph theory and automata theory. The first tool is a Proof Tree Automaton (PTA): a tree automaton which language is the derivation language of a calculus. The second tool is a graphical representation of a calculus called Proof Tree Graph (PTG). In this directed hypergraph, vertices are sets of terms (e.g. sequents) and hyperarcs are rules. We explore properties of PTA and PTGs and how they relate to each other. We show that we can decompose a PTA as a partial map from a calculus to a traditional tree automaton. We formulate that statement in the theory of refinement systems. Finally, we compare our framework to proof nets and string diagrams.


page 1

page 2

page 3

page 4


Proof Nets and the Linear Substitution Calculus

Since the very beginning of the theory of linear logic it is known how t...

The Logic for a Mildly Context-Sensitive Fragment of the Lambek-Grishin Calculus

While context-free grammars are characterized by a simple proof-theoreti...

Sequentialization for full N-Graphs via sub-N-Graphs

Since proof-nets for MLL- were introduced by Girard (1987), several stud...

Ultimate TreeAutomizer (CHC-COMP Tool Description)

We present Ultimate TreeAutomizer, a solver for satisfiability of sets o...

A Finite Axiomatisation of Finite-State Automata Using String Diagrams

We develop a fully diagrammatic approach to finite-state automata, based...

Cirquent calculus in a nutshell

This paper is a brief and informal presentation of cirquent calculus, a ...

Graphical Conjunctive Queries

The Calculus of Conjunctive Queries (CCQ) has foundational status in dat...