Towards an algorithmic construction of cut-elimination procedures-Reference-Cited by-同舟云学术

Towards an algorithmic construction of cut-elimination procedures

Published:2008-02 Issue:1 Volume:18 Page:81-105
ISSN:0960-1295
Container-title:Mathematical Structures in Computer Science
language:en
Short-container-title:Math. Struct. Comp. Sci.

Author:

CIABATTONI AGATA,LEITSCH ALEXANDER

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.

Publisher

Cambridge University Press (CUP)

Subject

Computer Science Applications,Mathematics (miscellaneous)

Reference18 articles.

1. Using Linear Logic to reason about sequent systems;Miller;Springer-Verlag Lecture Notes in Artificial Intelligence,2002

2. The Resolution Calculus

3. Automated complexity analysis based on ordered resolution

4. Extending intuitionistic linear logic with knotted structural rules.

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Way We Were: Structural Operational Semantics Research in Perspective;Electronic Proceedings in Theoretical Computer Science;2023-09-14

2. Cut-Elimination and Proof Schemata;Logic, Language, and Computation;2015

3. Extension without cut;Annals of Pure and Applied Logic;2012-12

4. Cut Elimination for Shallow Modal Logics;Lecture Notes in Computer Science;2011