L-Completeness of the Lambek Calculus with the Reversal Operation Allowing Empty Antecedents

DOI10.1007/978-3-642-54789-8_15zbMath1285.03015OpenAlexW18206778MaRDI QIDQ5414969

Stepan Kuznetsov

Publication date: 8 May 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-54789-8_15

Mathematics Subject Classification ID

Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)

Cites Work

• Unnamed Item
• Models for the Lambek calculus
• Lambek grammars with one division and one primitive type
• The Mathematics of Sentence Structure
• Product-Free Lambek Calculus Is NP-Complete
• Compatibility of a Categorial Grammar With an Associated Category System
• L-Completeness of the Lambek Calculus with the Reversal Operation

This page was built for publication: L-Completeness of the Lambek Calculus with the Reversal Operation Allowing Empty Antecedents