Switch to: References

Add citations

You must login to add citations.
  1. Nonā€Associative Lambek Categorial Grammar in Polynomial Time.Erik Aarts & Kees Trautwein - 1995 - Mathematical Logic Quarterly 41 (4):476-484.
    We present a new axiomatization of the non-associative Lambek calculus. We prove that it takes polynomial time to reduce any non-associative Lambek categorial grammar to an equivalent context-free grammar. Since it is possible to recognize a sentence generated by a context-free grammar in polynomial time, this proves that a sentence generated by any non-associative Lambek categorial grammar can be recognized in polynomial time.
    Direct download (2 more)  
    Export citation  
    Bookmark   2 citations