Proof Nets for Lambek Calculus

TY - JOUR

T1 - Proof Nets for Lambek Calculus

AU - Roorda, Dirk

PY - 1992

Y1 - 1992

N2 - The proof nets of linear logic are adapted to the non-commutative Lambek calculus. A different criterion for soundness of proof nets is given, which gives rise to new algorithms for proof search. The order sensitiveness of the Lambek calculus is reflected by the planarity condition on proof nets; this gives rise to a new non-provability check: balance.

AB - The proof nets of linear logic are adapted to the non-commutative Lambek calculus. A different criterion for soundness of proof nets is given, which gives rise to new algorithms for proof search. The order sensitiveness of the Lambek calculus is reflected by the planarity condition on proof nets; this gives rise to a new non-provability check: balance.

U2 - 10.1093/logcom/2.2.211

DO - 10.1093/logcom/2.2.211

M3 - Article

SN - 0955-792X

VL - 2

SP - 211

EP - 231

JO - Journal of Logic and Computation

JF - Journal of Logic and Computation

IS - 2

ER -