An application of proof-nets to the study of fragments of the Lambek calculus

DOI10.1070/IM2011V075N03ABEH002547zbMath1231.03022MaRDI QIDQ5198508

Yu. V. Savateev

Publication date: 8 August 2011

Published in: Izvestiya: Mathematics (Search for Journal in Brave)

zbMATH Keywords

algorithmic complexityLambek calculusproof-nets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Structure of proofs (03F07) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) 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) Complexity of proofs (03F20)

Related Items (3)

The atomic theory of left division of two-sided ideals of semirings with unit ⋮ Proof nets for the Lambek calculus with one division and a negative-polarity modality for weakening ⋮ Complexity of the Lambek calculus with one division and a negative-polarity modality for weakening

This page was built for publication: An application of proof-nets to the study of fragments of the Lambek calculus