2 citations · 10 across the 16 of their papers we have counts for
1 paper · 1 filter
Tikhon Pshenitsyn
In (Van Benthem, 1991) it is proved that all permutation closures of context-free languages can be generated by grammars over the Lambek calculus with the permutation rule (LP-gram…