The Generative Capacity of the Lambek–Grishin Calculus: A New Lower Bound [chapter]

Matthijs Melissen
2011 Lecture Notes in Computer Science  
The Lambek-Grishin calculus LG is a categorial grammar obtained by turning the one-sided sequents of the non-associative Lambek calculus NL into two-sided sequents, 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
more » ... languages like {a n b n c n d n e n | n ∈ N} and the permutation closure of {a n b n c n | n ∈ N}.
doi:10.1007/978-3-642-20169-1_8 fatcat:hiiuarcp2jeirpovzbmmeztfqm