Infinets: The parallel syntax for non-wellfounded proof-theory - Archive ouverte HAL Access content directly
Conference Papers Year : 2019

Infinets: The parallel syntax for non-wellfounded proof-theory

Abstract

Logics based on the µ-calculus are used to model inductive and coinductive reasoning and to verify reactive systems. A well-structured proof-theory is needed in order to apply such logics to the study of programming languages with (co)inductive data types and automated (co)inductive theorem proving. While traditional proof system suffers some defects, non-wellfounded (or infinitary) and circular proofs have been recognized as a valuable alternative, and significant progress have been made in this direction in recent years. Such proofs are non-wellfounded sequent derivations together with a global validity condition expressed in terms of progressing threads. The present paper investigates a discrepancy found in such proof systems , between the sequential nature of sequent proofs and the parallel structure of threads: various proof attempts may have the exact threading structure while differing in the order of inference rules applications. The paper introduces infinets, that are proof-nets for non-wellfounded proofs in the setting of multiplicative linear logic with least and greatest fixed-points (µMLL ∞) and study their correctness and sequentialization.
Fichier principal
Vignette du fichier
output.pdf (447.53 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02337286 , version 1 (29-10-2019)

Identifiers

  • HAL Id : hal-02337286 , version 1

Cite

Abhishek De, Alexis Saurin. Infinets: The parallel syntax for non-wellfounded proof-theory. TABLEAUX 2019 - 28th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, Sep 2019, London, United Kingdom. ⟨hal-02337286⟩
83 View
70 Download

Share

Gmail Facebook X LinkedIn More