scientific article; zbMATH DE number 1841813

zbMath0999.03054MaRDI QIDQ4783301

Lutz Straßburger, Alessio Guglielmi

Publication date: 4 December 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2142/21420054

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items

MELL in the calculus of structures ⋮ Deep sequent systems for modal logic ⋮ A Subatomic Proof System for Decision Trees ⋮ An Analytic Propositional Proof System on Graphs ⋮ A deep inference system for the modal logic S5 ⋮ On the Power of Substitution in the Calculus of Structures ⋮ Combinatorial flows as bicolored atomic flows ⋮ A System of Interaction and Structure III: The Complexity of BV and Pomset Logic ⋮ Non-crossing Tree Realizations of Ordered Degree Sequences ⋮ On linear rewriting systems for Boolean logic and some applications to proof theory ⋮ On the decision problem for MELL ⋮ Sufficient conditions for cut elimination with complexity analysis ⋮ System NEL is Undecidable ⋮ Extension without cut ⋮ From truth to computability. I. ⋮ Termination orders for three-dimensional rewriting ⋮ The problem of proof identity, and why computer scientists should care about Hilbert's 24th problem ⋮ Some Observations on the Proof Theory of Second Order Propositional Multiplicative Linear Logic ⋮ Deep inference and expansion trees for second-order multiplicative linear logic ⋮ Constructing weak simulations from linear implications for processes with private names ⋮ On linear logic planning and concurrency ⋮ Pomset Logic ⋮ Non-associative, non-commutative multi-modal linear logic ⋮ Cut elimination inside a deep inference system for classical predicate logic