scientific article; zbMATH DE number 1420859

MaRDI QIDQ4944927zbMATH OpenFDO

Authors Alasdair Urquhart

Publication date 2 August 2000

zbMATH Keywords

complexity of decision problemcut eliminationdecision procedurelinear logic with unrestricted weakening rulelower boundpropositional affine logicsequent calculus

Mathematics Subject Classification ID

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)

Recommendations

• Decidability of linear affine logic
• Decision problems for propositional linear logic
• scientific article; zbMATH DE number 786489
• The complexity of decision procedures in relevance logic II
• The finite model property for various fragments of linear logic

Cited in

(4)

• Decidability of linear affine logic
• The decidability of the intensional fragment of classical linear logic
• A Logical Autobiography
• Decidability and complexity in weakening and contraction hypersequent substructural logics

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4944927)