Consistency Implies Cut Admissibility - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

Consistency Implies Cut Admissibility


For any finite and consistent first-order theory, we can find a presentation as a rewriting system that enjoys cut admissibility.
Fichier principal
Vignette du fichier
Burel.pdf (197.07 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

inria-00614040 , version 1 (08-08-2011)


  • HAL Id : inria-00614040 , version 1


Guillaume Burel. Consistency Implies Cut Admissibility. PSATTT'11: International Workshop on Proof-Search in Axiomatic Theories and Type Theories, Germain Faure, Stéphane Lengrand, Assia Mahboubi, Aug 2011, Wroclaw, Poland. ⟨inria-00614040⟩
77 View
102 Download


Gmail Mastodon Facebook X LinkedIn More