| Lambek grammars are context free M Pentus [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science …, 1993 | 300 | 1993 |
| Lambek calculus is NP-complete M Pentus Theoretical Computer Science 357 (1-3), 186-201, 2006 | 148 | 2006 |
| Product-free Lambek calculus and context-free grammars M Pentus The Journal of Symbolic Logic 62 (2), 648-660, 1997 | 80 | 1997 |
| Models for the Lambek calculus M Pentus Annals of Pure and Applied Logic 75 (1-2), 179-213, 1995 | 70 | 1995 |
| Method and system for implementing process-based Web applications H Lienhard, B Buetler, M Poli, R Weiss, UM Kuenzi, M Pentus US Patent App. 09/756,347, 2002 | 52 | 2002 |
| Method and system for implementing process-based Web applications H Lienhard, B Buetler, M Poli, R Weiss, UM Kuenzi, M Pentus US Patent App. 09/756,347, 2002 | 52 | 2002 |
| Method and system for implementing process-based Web applications H Lienhard, B Buetler, M Poli, R Weiss, UM Kuenzi, M Pentus US Patent App. 09/756,347, 2002 | 52 | 2002 |
| Information technology system for the definition, optimization and control of processes H Lienhard, B Buetler, M Poli, R Weiss, UM Kuenzi, M Pentus US Patent 6,778,863, 2004 | 36 | 2004 |
| Free monoid completeness of the Lambek calculus allowing empty premises M Pentus Logic colloquium 96, 9-15, 1998 | 34 | 1998 |
| Language completeness of the Lambek calculus M Pentus Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science, 487-496, 1994 | 29 | 1994 |
| Lambek calculus is L-complete M Pentus | 25 | 1993 |
| Equivalent types in Lambek calculus and linear logic M Pentus Preprint, 41-64, 1992 | 24 | 1992 |
| Formal and informal semantics of telicity E Paducheva, M Pentus Theoretical and crosslinguistic approaches to the semantics of aspect 110, 191, 2008 | 22 | 2008 |
| Lambek calculus and formal grammars M Pentus Translations of the American Mathematical Society-Series 2 192, 57, 1999 | 22* | 1999 |
| A polynomial-time algorithm for Lambek grammars of bounded order M Pentus Linguistic Analysis 36 (1), 441-471, 2010 | 21 | 2010 |
| Lambek calculus and formal grammars M Pentus Translations of the American Mathematical Society-Series 2 192, 57, 1999 | 17 | 1999 |
| The conjoinability relation in Lambek calculus and linear logic. ILLC Prepublication Series ML–93–03 M Pentus Institute for Logic, Language and Computation, University of Amsterdam, 1993 | 16 | 1993 |
| Lambek calculus is NP-complete. CUNY Ph. D M Pentus Program in Computer Science Technical Report TR–2003005, CUNY Graduate …, 2003 | 13 | 2003 |
| The conjoinability relation in Lambek calculus and linear logic M Pentus Journal of Logic, Language and Information 3, 121-140, 1994 | 13 | 1994 |
| Type similarity for the Lambek-Grishin calculus M Moortgat, M Pentus Proceedings 12th Conference on Formal Grammar, Dublin, 2007 | 9 | 2007 |
Lev BeklemishevSteklov Mathematical Institute and NRU Higher School of EconomicsVerified email at mi.ras.ru
