scientific article; zbMATH DE number 1420859
From MaRDI portal
Publication:4944927
zbMath0949.03058MaRDI QIDQ4944927
Publication date: 2 August 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
cut eliminationlower boundsequent calculusdecision procedurecomplexity of decision problemlinear logic with unrestricted weakening rulepropositional affine logic
Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Cut-elimination and normal-form theorems (03F05) Proof-theoretic aspects of linear logic and other substructural logics (03F52)
Related Items (3)
Nonelementary Complexities for Branching VASS, MELL, and Extensions ⋮ The decidability of the intensional fragment of classical linear logic ⋮ A Logical Autobiography
This page was built for publication:
