The Generative Capacity of the Lambek-Grishin Calculus: A New Lower Bound

  title={The Generative Capacity of the Lambek-Grishin Calculus: A New Lower Bound},
  author={Matthijs Melissen},
The Lambek-Grishin calculus LG is a categorial type logic obtained by adding a family of connectives {⊕,???,???} dual to the family {⊗, /, \}, and adding interaction postulates between the two families of connectives thus obtained. In this paper, we prove a new lower bound on the generative capacity of LG, namely the class of languages that are the intersection of a context-free language and the permutation closure of a context-free language. This implies that LG recognizes languages like the… 
Tableaux for the Lambek-Grishin calculus
A theory of labeled modal tableaux for LG is developed, inspired by the interpretation of its connectives as binary modal operators in the relational semantics of Kurtonina and Moortgat, and it is shown that grammars based on LG are context-free through use of an interpolation lemma.
Symmetric Categorial Grammar
The Lambek-Grishin calculus is a symmetric version of categorial grammar obtained by augmenting the standard inventory of type-forming operations with a dual family: coproduct, left and right difference.
The Product-Free Lambek-Grishin Calculus Is NP-Complete
It is proved that the derivability problem for the product-free fragment of LG is NPcomplete, thus improving on Bransen (2010) where this was shown for LG with product.
Categorical Foundations for Extended Compositional Distributional Models of Meaning
This thesis gives a categorical characterization of the Lambek-Grishin Calculus and develops a language to reason graphically about morphism structure and equality in terms of string diagrams and shows that finite-dimensional vector spaces are also an instance of linear distributive categories, which creates the possibility of extended compositional distributional models of meaning.
The Lambek-Grishin Calculus Is NP-Complete
It is proved that the derivability problem for Lambek-Grishin calculus LG is NP-complete.
Logic and the Interactive Rationality
This paper presents an approach to quantifying how much information each particular agent in a system has, or how important the agent is, with respect to some fact represented as a goal formula, and analyses the properties of this notion of information-based power in detail.
Game-theory and Logic for Non-repudiation Protocols and Attack Analysis
A game-based protocol semantics is developed, by modeling protocols as concurrent game structures instead of in labeled transition systems, that allows to define security properties on Cremers–Mauw protocol specifications in logics of strategic ability, such as Alternating-time Temporal Logic.
On the complexity of the Lambek-Grishin calculus


Symmetries in Natural Language Syntax and Semantics: The Lambek-Grishin Calculus
It is shown that LG naturally accommodates non-local semantic construal and displacement -- phenomena that are problematic for the original Lambek calculi.
Lambek–Grishin Calculus Extended to Connectives of Arbitrary Arity
A cut-free presentation of the Lambek–Grishin calculus for n-ary connectives is showed, proving the decidability of the calculus and the symmetries are investigated by making use of group theory.
Lambek grammars are context free
  • M. Pentus
  • Computer Science, Linguistics
    [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science
  • 1993
The Chomsky conjecture, that all languages recognized by the Lambek calculus are context-free, is proved and thus every basic categorial grammar is equivalent to a Lambek grammar.
On Context-Free Languages
In this report, certain properties of context-free (CF or type 2) Grammars are investigated, like that of Chomsky, and it is shown that this type of grammar is essentially stronger than type 2 grammars and has the advantage over type 1 grammARS that the phrase structure of a grammatical sentence is unique, once the derivation is given.
Language in Action: Categories, Lambdas and Dynamic Logic
Van Benthem presents the categorial processing of syntax and semantics as a central component in a more general dynamic logic of information flow, in tune with computational developments in artificial intelligence and cognitive science.
Lambek Grammars, Tree Adjoining Grammars and Hyperedge Replacement Grammars
Two recent extension of the non-associative Lambek calculus are shown to generate the same class of languages as tree adjoining grammars, using (tree generating) hyperedge replacement Grammars as an intermediate step.
Introduction to the Theory of Computation
Throughout the book, Sipser builds students' knowledge of conceptual tools used in computer science, the aesthetic sense they need to create elegant systems, and the ability to think through problems on their own.
The equivalence of Nonassociative Lambek Categorial Grammars and Context-Free Grammars
Range Concatenation Grammars
Range Concatenation Grammars are more powerful than Linear Context-Free Rewriting Systems though this power is not reached to the detriment of efficiency since its sentences can always be parsed in polynomial time.
Tree Adjunct Grammars