COMPLEXITY OF THE INFINITARY LAMBEK CALCULUS WITH KLEENE STAR

DOI10.1017/S1755020320000209MaRDI QIDQ5027669

Stepan Kuznetsov

Publication date: 7 February 2022

Published in: The Review of Symbolic Logic (Search for Journal in Brave)

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

zbMATH Keywords

complexityKleene starcategorial grammarsnoncommutative linear logicinfinitary action logiclambek calculus

Mathematics Subject Classification ID

Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The logic of categorial grammars. A deductive account of natural language syntax and semantics
• Linear logic
• Residuated lattices. An algebraic glimpse at substructural logics
• Infinitary action logic: complexity, models and grammars
• Lambek calculus and its relational semantics: Completeness and incompleteness
• A completeness theorem for Kleene algebras and the algebra of regular events
• The conjoinability relation in Lambek calculus and linear logic
• The Lambek calculus with iteration: two variants
• The complexity of multiplicative-additive Lambek calculus: 25 years later
• Lambek calculus is NP-complete
• Lambek grammars with one division and one primitive type
• Introduction to Categories and Categorical Logic
• The Mathematics of Sentence Structure
• On Action Logic: Equational Theories of Action Algebras
• Logics without the contraction rule
• Compatibility of a Categorial Grammar With an Associated Category System
• Some Decision Problems in the Theory of Syntactic Categories
• On the Completeness of Lambek Calculus with Respect to Cofinite Language Models
• The Equivalence of Unidirectional Lambek Categorial Grammars and Context‐Free Grammars
• On the Complexity of the Equational Theory of Relational Action Algebras
• A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
• Residuated Lattices

This page was built for publication: COMPLEXITY OF THE INFINITARY LAMBEK CALCULUS WITH KLEENE STAR