Mati Pentus

Orcid: 0000-0002-9483-7594

According to our database1, Mati Pentus authored at least 12 papers between 1993 and 2014.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2014
The Monotone Lambek Calculus Is NP-Complete.
Proceedings of the Categories and Types in Logic, Language, and Physics, 2014

2010
Complexity of the Lambek Calculus and Its Fragments.
Proceedings of the Advances in Modal Logic 8, 2010

2006
Lambek calculus is NP-complete.
Theor. Comput. Sci., 2006

1999
Provability, complexity, grammars.
American Mathematical Society translations series 2 192, American Mathematical Society, ISBN: 978-0-8218-1078-1, 1999

1997
Product-Free Lambek Calculus and Context-Free Grammars.
J. Symb. Log., 1997

Equivalence of Multiplicative Fragments of Cyclic Linear Logic and Noncommutative Linear Logic.
Proceedings of the Logical Foundations of Computer Science, 4th International Symposium, 1997

1995
IGPL/FoLLI Prize.
Log. J. IGPL, 1995

Models for the Lambek Calculus.
Ann. Pure Appl. Log., 1995

Lambek Calculus and Formal Languages.
Proceedings of the Annual European Summer Meeting of the Association of Symbolic Logic, 1995

1994
The conjoinability relation in Lambek calculus and linear logic.
J. Log. Lang. Inf., 1994

Language Completeness of the Lambek Calculus
Proceedings of the Ninth Annual Symposium on Logic in Computer Science (LICS '94), 1994

1993
Lambek Grammars Are Context Free
Proceedings of the Eighth Annual Symposium on Logic in Computer Science (LICS '93), 1993


  Loading...