A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
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 LGdoi:10.1007/978-3-642-20169-1_8 fatcat:hiiuarcp2jeirpovzbmmeztfqm