Pré-Publication, Document De Travail Année : 2021

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

Abhishek De
  • Fonction : Auteur
  • PersonId : 1049605
Alexis Saurin

Résumé

Logics based on the µ-calculus are used to model induc-tive 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. Inductive and coinductive reasoning is pervasive in computer science to specify and reason about infinite data as well as reactive properties. Developing appropriate proof systems amenable to automated reasoning over (co)inductive statements is therefore important for designing programs as well as for analyzing computational systems. Various logical settings have been introduced to reason about such inductive and coinductive statements, both at the level of the logical languages modelling (co)induction (such as Martin Löf's inductive predicates or fixed-point logics, also known as µ-calculi) and at the level of the proof-theoretical framework considered (finite proofs with explicit (co)induction rulesà la Park [23] or infinite, non-wellfounded proofs with fixed-point unfold-ings) [6-8, 4, 1, 2]. Moreover, such proof systems have been considered over classical logic [6, 8], intuitionistic logic [9], linear-time or branching-time temporal logic [19, 18, 25, 26, 13-15] or linear logic [24, 16, 4, 3, 14].

Fichier principal
Vignette du fichier
Infinets__The_parallel_syntax_for_non_wellfounded_proof_theory__Long_Version_.pdf (493.56 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-02166199 , version 1 (26-06-2019)
hal-02166199 , version 2 (23-09-2021)

Licence

Identifiants

  • HAL Id : hal-02166199 , version 2

Citer

Abhishek De, Alexis Saurin. Infinets: The parallel syntax for non-wellfounded proof-theory. 2021. ⟨hal-02166199v2⟩

Collections

139 Consultations
503 Téléchargements

Partager

  • More