Infinitary proof theory : the multiplicative additive case

David Baelde 1, * Amina Doumane 2, 3, * Alexis Saurin 3
* Corresponding author
3 PI.R2 - Design, study and implementation of languages for proofs and programs
Inria de Paris, CNRS - Centre National de la Recherche Scientifique, UPD7 - Université Paris Diderot - Paris 7, PPS - Preuves, Programmes et Systèmes
Abstract : Infinitary and regular proofs are commonly used in fixed point logics. Being natural intermediate devices between semantics and traditional finitary proof systems, they are commonly found in completeness arguments, automated deduction, verification, etc. However, their proof theory is surprisingly underdeveloped. In particular, very little is known about the computational behavior of such proofs through cut elimination. Taking such aspects into account has unlocked rich developments at the intersection of proof theory and programming language theory. One would hope that extending this to infinitary calculi would lead, e.g., to a better understanding of recursion and corecursion in programming languages. Structural proof theory is notably based on two fundamental properties of a proof system: cut elimination and focalization. The first one is only known to hold for restricted (purely additive) infinitary calculi, thanks to the work of Santocanale and Fortier; the second one has never been studied in infinitary systems. In this paper, we consider the infinitary proof system μMALL ∞ for multiplicative and additive linear logic extended with least and greatest fixed points, and prove these two key results. We thus establish μMALL ∞ as a satisfying computational proof system in itself, rather than just an intermediate device in the study of finitary proof systems.
Document type :
Preprints, Working Papers, ...
Liste complète des métadonnées
Contributor : Amina Doumane <>
Submitted on : Wednesday, June 29, 2016 - 2:50:30 PM
Last modification on : Friday, January 4, 2019 - 5:33:38 PM
Document(s) archivé(s) le : Friday, September 30, 2016 - 12:48:36 PM


Files produced by the author(s)




  • HAL Id : hal-01339037, version 1


David Baelde, Amina Doumane, Alexis Saurin. Infinitary proof theory : the multiplicative additive case . 2016. ⟨hal-01339037⟩



Record views


Files downloads