Skip Navigation


Journal of Logic and Computation Advance Access originally published online on February 1, 2008
Journal of Logic and Computation 2008 18(2):239-256; doi:10.1093/logcom/exm089
This Article
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
18/2/239    most recent
exm089v1
Right arrow References
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 Morrill, G.
Right arrow Articles by Fadda, M.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author, 2008. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Original Articles

Proof Nets for Basic Discontinuous Lambek Calculus

Glyn Morrill and Mario Fadda

Universitat Politècnica de Catalunya E-mail: mfadda{at}lsi.upc.edu, morrill{at}lsi.upc.edu


  Abstract

The theory of proof nets for continuity based on the Lambek calculus is well-developed, but we need a compatible extension to include discontinuity. Earlier work set out ingredients: hypersequent calculus and proof nets expanded with parameter edges. This article completes a preliminary line by finalizing a version of proof nets for the basic discontinuous Lambek calculus BDLC (the minimal system with one point of discontinuity) and proving correctness with respect to the hypersequent calculus.


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.