On the Completeness of Lambek Calculus with Respect to Cofinite Language Models

DOI10.1007/978-3-642-31262-5_16zbMath1291.03064OpenAlexW182127195MaRDI QIDQ4981260

Alexey Sorokin

Publication date: 24 June 2014

Published in: Logical Aspects of Computational Linguistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31262-5_16

Mathematics Subject Classification ID

Logic of natural languages (03B65) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)

Related Items (max. 100)

COMPLEXITY OF THE INFINITARY LAMBEK CALCULUS WITH KLEENE STAR

This page was built for publication: On the Completeness of Lambek Calculus with Respect to Cofinite Language Models