Towards an algorithmic construction of cut-elimination procedures
From MaRDI portal
Publication:5458060
DOI10.1017/S0960129507006573zbMATH Open1138.03043MaRDI QIDQ5458060FDOQ5458060
Agata Ciabattoni, Alexander Leitsch
Publication date: 10 April 2008
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Cut-elimination and normal-form theorems (03F05) Mechanization of proofs and logical operations (03B35)
Cites Work
- Title not available (Why is that?)
- Untersuchungen über das logische Schliessen. I
- Non-deterministic Multiple-valued Structures
- Towards a semantic characterization of cut-elimination
- Algebraization, parametrized local deduction theorem and interpolation for substructural logics over FL
- Extending intuitionistic linear logic with knotted structural rules
- Automated complexity analysis based on ordered resolution
- Cut-elimination and redundancy-elimination by resolution
- Implication of clauses is undecidable
- Bounded contraction and Gentzen-style formulation of Łukasiewicz logics
- On the Specification of Sequent Systems
Cited In (13)
- Computer Science Logic
- Extension without cut
- Cut-Elimination for SBL
- Cut elimination for GLS using the terminability of its regress process
- Book review of: Matthias Baaz and Alexander Leitsch, Methods of cut-elimination
- Algebraic aspects of cut elimination
- Towards Algorithmic Cut-Introduction
- Cut-elimination for \(\omega_{1}\)
- Sufficient conditions for cut elimination with complexity analysis
- Sharpened lower bounds for cut elimination
- Cut-Elimination and Proof Schemata
- Cut Elimination for Shallow Modal Logics
- Cut-elimination and redundancy-elimination by resolution
This page was built for publication: Towards an algorithmic construction of cut-elimination procedures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458060)
