Skip Navigation

Journal of Logic and Computation 1992 2(2):211-231; doi:10.1093/logcom/2.2.211
© 1992 by Oxford University Press
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by ROORDA, D.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Original Articles

Proof Nets for Lambek Calculus

DIRK ROORDA

University of Amsterdam, Fac. Math. & Comp. Sc. Plantage Muidergracht 24, 1018 TV Amsterdam, The Netherlands

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.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.