Eliminating infinitely many cuts in non-wellfounded MLL proof-nets - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2021

Eliminating infinitely many cuts in non-wellfounded MLL proof-nets

Résumé

Non-wellfounded and circular proofs have been recognised over the past decade as a valuable tool to study logics expressing (co)inductive properties, e.g.-calculi. Such proofs are non-wellfounded sequent derivations together with a global validity condition expressed in terms of progressing threads. While the cut-free fragment of circular proofs is satisfactory, cuts are poorly treated and the non-canonicity of sequent proofs becomes a major issue in the non-wellfounded setting. The present paper develops the theory of infinets-proof-nets for non-wellfounded proofs-allowing infinets with infinitely many cuts therefore solving a crucial shortcoming of the previous work [21], characterising sequentialisation and proving a cut-elimination theorem. To that end, we provide an alternate cut reduction for non-wellfounded sequent calculus.
Fichier principal
Vignette du fichier
main.pdf (883.06 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03235591 , version 1 (25-05-2021)

Identifiants

  • HAL Id : hal-03235591 , version 1

Citer

Abhishek De, Luc Pellissier, Alexis Saurin. Eliminating infinitely many cuts in non-wellfounded MLL proof-nets. 2021. ⟨hal-03235591⟩
70 Consultations
70 Téléchargements

Partager

Gmail Facebook X LinkedIn More