MELL in the calculus of structures

DOI10.1016/S0304-3975(03)00240-8zbMath1065.03042MaRDI QIDQ1884903

Lutz Straßburger

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

cut eliminationlinear logicproof theorycalculus of structures

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items

Deep sequent systems for modal logic, An Analytic Propositional Proof System on Graphs, A logical calculus for controlled monotonicity, On the decision problem for MELL, A Logical Basis for Quantum Evolution and Entanglement, System BV is NP-complete, Maude as a Platform for Designing and Implementing Deep Inference Systems, Extension without cut, The three dimensions of proofs, On structuring proof search for first order linear logic, Subformula linking for intuitionistic logic with application to type theory, Some Observations on the Proof Theory of Second Order Propositional Multiplicative Linear Logic, On linear logic planning and concurrency, Pomset Logic

Uses Software

• Lolli

Cites Work

• Linear logic
• Forum: A multiple-conclusion specification logic
• Logic programming in a fragment of intuitionistic linear logic
• Untersuchungen über das logische Schliessen. I
• Untersuchungen über das logische Schliessen. II
• Focussing and proof construction
• Uniform proofs as a foundation for logic programming
• A Local System for Classical Logic
• The Mathematics of Sentence Structure
• Logic Programming with Focusing Proofs in Linear Logic
• The mix rule
• Games and full completeness for multiplicative linear logic
• System NEL is Undecidable
• A system of interaction and structure
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item