Which structural rules admit cut elimination? An algebraic criterion

DOI10.2178/jsl/1191333839zbMath1128.03048OpenAlexW2170289322MaRDI QIDQ5422301

Kazushige Terui

Publication date: 17 October 2007

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.jsl/1191333839

zbMATH Keywords

cut eliminationLambek calulus

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items (12)

Logic and majority voting ⋮ Strong negation in intuitionistic style sequent systems for residuated lattices ⋮ Weakening-free, non-associative fuzzy logics: micanorm-based logics ⋮ Cut elimination, identity elimination, and interpolation in super-Belnap logics ⋮ Algebraic proof theory for substructural logics: cut-elimination and completions ⋮ Cut elimination and strong separation for substructural logics: an algebraic approach ⋮ Sufficient conditions for cut elimination with complexity analysis ⋮ Residuated frames with applications to decidability ⋮ A phase semantics for polarized linear logic and second order conservativity ⋮ Completion and finite embeddability property for residuated ordered algebras. ⋮ Expanding the Realm of Systematic Proof Theory ⋮ Towards a semantic characterization of cut-elimination

Cites Work

• Language in action. Categories, lambdas and dynamic logic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Which structural rules admit cut elimination? An algebraic criterion