Citations of work:

Erik Aarts (1994). Proving Theorems of the Second Order Lambek Calculus in Polynomial Time.

Order:
Are we missing citations?

PhilPapers citations & references are currently in beta testing. We expect to add many more in the future.

Meanwhile, you can use our bibliography tool to import references for this or another work.

Or you can directly add citations for the above work:

Search for work by author name and title
Add directly by record ID

  1.  19
    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 (5 more)  
     
    Export citation  
     
    Bookmark   1 citation