Proof Nets for Lambek Calculus

Dirk Roorda

doi:10.1093/logcom/2.2.211

Proof Nets for Lambek Calculus

Dirk Roorda

DANS-KNAW

Research output: Contribution to journal/periodical › Article › Scientific › peer-review

14 Citations (Scopus)

Abstract

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.

Original language	English
Pages (from-to)	211-231
Journal	Journal of Logic and Computation
Volume	2
Issue number	2
DOIs	https://doi.org/10.1093/logcom/2.2.211
Publication status	Published - 1992

Access to Document

10.1093/logcom/2.2.211Licence: CC BY

Cite this

@article{78149de83e2d47209316efa19dbd0770,

title = "Proof Nets for Lambek Calculus",

abstract = "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.",

author = "Dirk Roorda",

year = "1992",

doi = "10.1093/logcom/2.2.211",

language = "English",

volume = "2",

pages = "211--231",

journal = "Journal of Logic and Computation",

issn = "0955-792X",

publisher = "Oxford University Press",

number = "2",

}

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 -

Proof Nets for Lambek Calculus

Abstract

Access to Document

Fingerprint

Cite this