Towards an algorithmic construction of cut-elimination procedures†

Authors:
Agata Ciabattoni;Alexander Leitsch
Affiliations:
Institut für diskrete mathematik und geometrie, tu wien, austria;Institut für computersprachen, tu wien, austria
Venue:
Mathematical Structures in Computer Science
Year:
2008

Citing 8
Cited 1

Implication of clauses is undecidable

Theoretical Computer Science
The resolution calculus

The resolution calculus
Cut-elimination and redundancy-elimination by resolution

Journal of Symbolic Computation - Special issue on advances in first-order theorem proving
Automated complexity analysis based on ordered resolution

Journal of the ACM (JACM)
Using Linear Logic to Reason about Sequent Systems

TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Analytic calculi for monoidal t-norm based logic

Fundamenta Informaticae
Non-deterministic Multiple-valued Structures

Journal of Logic and Computation
On the specification of sequent systems

LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning

Cut elimination for shallow modal logics

TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods

Quantified Score

Hi-index	0.00

Visualization

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.