inria-00614040, version 1
Consistency Implies Cut Admissibility
PSATTT'11: International Workshop on Proof-Search in Axiomatic Theories and Type Theories (2011)
Abstract: For any finite and consistent first-order theory, we can find a presentation as a rewriting system that enjoys cut admissibility.
- 1: Centre d'Etude et De Recherche en Informatique du Cnam (CEDRIC)
- Conservatoire National des Arts et Métiers (CNAM)
- Domain : Computer Science/Logic in Computer Science
- inria-00614040, version 1
- http://hal.inria.fr/inria-00614040
- oai:hal.inria.fr:inria-00614040
- From: Assia Mahboubi
- Submitted on: Monday, 8 August 2011 21:39:17
- Updated on: Wednesday, 10 August 2011 12:48:45
Associated documents
Export