Introducing Proof Tree Automata and Proof Tree Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2022

Introducing Proof Tree Automata and Proof Tree Graphs

Abstract

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.
Fichier principal
Vignette du fichier
SLSS2022-postprint.pdf (82.06 Ko) Télécharger le fichier

Dates and versions

hal-03698581 , version 1 (21-06-2022)

Identifiers

  • HAL Id : hal-03698581 , version 1

Cite

Valentin D. Richard. Introducing Proof Tree Automata and Proof Tree Graphs: Extended abstract. SLSS 2022 - 11th Scandinavian Logic Symposium, Åsa Hirvonen; Fernando Velázquez-Quesada, Jun 2022, Bergen, Norway. pp.10-12. ⟨hal-03698581⟩
59 View
53 Download

Share

Gmail Facebook X LinkedIn More