Lecture Notes in Comput. Sci., 2012, Volume 7351, Pages 151–160
L-completeness of the Lambek calculus with the reversal operation
Moscow State University
We extend the Lambek calculus with rules for a unary operation corresponding to language reversal and prove that this calculus is complete with respect to the class of models on subsets of free semigroups (L-models). We also prove that categorial grammars based on this calculus generate precisely all context-free languages without the empty word.
Citing articles on Google Scholar:
Related articles on Google Scholar:
|Number of views:|