Skip Navigation

Journal of Logic and Computation 2003 13(5):777-797; doi:10.1093/logcom/13.5.777
© 2003 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 Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (4)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Robinson, E.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Original Article

Proof Nets for Classical Logic

Edmund Robinson

Department of Computer Science, Queen Mary, University of London, London E1 4NS, UK. E-mail: E.P.Robinson{at}dcs.qmul.ac.uk

This paper introduces a notion of proof net for classical logic, provides a static correctness condition for these nets, and analyses theconnection between nets and conventional sequent calculus. The main surprise of the paper is that there are no surprises at the static level. Subsequent work reveals that there are few at the dynamic either.

Keywords: Classical logic, sequent calculus, proof nets.

Received 5 February 2002.


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.