Article contents
Towards an algorithmic construction of cut-elimination procedures†
Published online by Cambridge University Press: 01 February 2008
Abstract
We investigate cut elimination in propositional substructural logics. The problem is to decide whether a given calculus admits (reductive) cut elimination. We show that for commutative single-conclusion sequent calculi containing generalised knotted structural rules and arbitrary logical rules the problem can be decided by resolution-based methods. A general cut-elimination proof for these calculi is also provided.
- Type
- Paper
- Information
- Mathematical Structures in Computer Science , Volume 18 , Special Issue 1: in memory of Sauro Tulipani , February 2008 , pp. 81 - 105
- Copyright
- Copyright © Cambridge University Press2008
References
- 4
- Cited by