The Non-associative Lambek Calculus with Product in Polynomial Time | Zendy

Philippe de Groote | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

The Non-associative Lambek Calculus with Product in Polynomial Time

Author(s) -

Philippe de Groote

Publication year - 1999

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-66086-0

DOI - 10.1007/3-540-48754-9_14

Subject(s) - associative property , sequent calculus , sequent , p , natural deduction , calculus (dental) , computer science , product (mathematics) , cut elimination theorem , polynomial , algebra over a field , mathematics , algorithm , time complexity , proof calculus , pure mathematics , programming language , medicine , mathematical analysis , geometry , dentistry , mathematical proof

We prove, by introducing a new kind of sequent calculus, that the decision problem for the non-associative Lambek calculus with product belongs to PTIME. This solves an open prolem.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research