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

Guillaume Burel
Centre d'études et de recherche en informatique et communications

Abstract

For any finite and consistent first-order theory, we can find a presentation as a rewriting system that enjoys cut admissibility.

Domains

Logic in Computer Science [cs.LO]
Fichier principal
Vignette du fichier
Burel.pdf (197.07 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Assia Mahboubi  : Connect in order to contact the contributor

https://inria.hal.science/inria-00614040

Submitted on : Monday, August 8, 2011-9:39:17 PM

Last modification on : Monday, January 29, 2024-11:15:31 AM

Long-term archiving on: Wednesday, November 9, 2011-2:26:01 AM

Download

Dates and versions

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

Identifiers

  • HAL Id : inria-00614040 , version 1

Cite

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⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNAM PSATTT11 CEDRIC-CNAM HESAM
77 View
100 Download

Share

Gmail Facebook X LinkedIn More