Cuts for circular proofs: semantics and cut-elimination - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

Cuts for circular proofs: semantics and cut-elimination

Résumé

One of the authors introduced in (Santocanale 2003) a calculus of circular proofs for studying the computability arising from the following categorical operations: finite products, finite coproducts, initial algebras, final coalgebras. The calculus presented (Santocanale 2003) is cut-free; even if sound and complete for provability, it lacked an important property for the semantics of proofs, namely fullness w.r.t. the class of intended categorical models (called μ-bicomplete categories)). In this paper we fix this problem by adding the cut rule to the calculus and by modifying accordingly the syntactical constraint ensuring soundness of proofs. The enhanced proof system fully represents arrows of the canonical model (a free μ-bicomplete category). We also describe a cut-elimination procedure as a a model of computation arising from the above mentioned categorical operations. The procedure constructs a cut-free proof-tree with possibly infinite branches out of a finite circular proof with cuts.
Fichier non déposé

Dates et versions

hal-01260986 , version 1 (22-01-2016)

Identifiants

Citer

Luigi Http://pageperso.Lif.Univ-Mrs.Fr/~luigi.Santocanale/ Santocanale, Jérôme Fortier. Cuts for circular proofs: semantics and cut-elimination. Computer Science Logic 2013, Sep 2013, Torino, Italy. pp.248--262, ⟨10.4230/LIPIcs.CSL.2013.248⟩. ⟨hal-01260986⟩
96 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More