Language models for some extensions of the Lambek calculus

DOI10.1016/j.ic.2021.104760OpenAlexW3159310018WikidataQ114014312 ScholiaQ114014312MaRDI QIDQ2672665

Stepan Kuznetsov, Andrej Scedrov, Max I. Kanovich

Publication date: 13 June 2022

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2008.00070

zbMATH Keywords

undecidabilityLambek calculusincompletenessrelational modelsdistributive lawlanguage models

Mathematics Subject Classification ID

Logic of natural languages (03B65)

Related Items (2)

Relational Models for the Lambek Calculus with Intersection and Constants ⋮ Relational models for the Lambek calculus with intersection and unit

Uses Software

• llprover

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The logic of categorial grammars. A deductive account of natural language syntax and semantics
• Linear logic
• Axiomatizability of positive algebras of binary relations
• The equational theory of Kleene lattices
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Distributive full Lambek calculus has the finite model property
• The Lambek calculus enriched with additional connectives
• The conjoinability relation in Lambek calculus and linear logic
• Models for the Lambek calculus
• The undecidability of second order multiplicative linear logic
• L-models and R-models for Lambek calculus enriched with additives and the multiplicative unit
• The finite model property for BCI and related systems
• The Mathematics of Sentence Structure
• Logics without the contraction rule
• Compatibility of a Categorial Grammar With an Associated Category System
• The finite model property for various fragments of intuitionistic linear logic
• Undecidable Varieties of Semilattice—ordered Semigroups, of Boolean Algebras with Operators, and logics extending Lambek Calculus
• Trivalent logics arising from L-models for the Lambek calculus with constants
• The undecidability of second order linear logic without exponentials
• On the Complexity of the Equational Theory of Relational Action Algebras
• A comparison between lambek syntactic calculus and intuitionistic linear propositional logic

This page was built for publication: Language models for some extensions of the Lambek calculus