Skip Navigation


Journal of Logic and Computation Advance Access originally published online on November 11, 2007
Journal of Logic and Computation 2008 18(1):171-199; doi:10.1093/logcom/exm063
This Article
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
18/1/171    most recent
exm063v1
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 Ilic, M. I.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

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

Original Articles

Cut Elimination and Decidability for Classical Lambek Logic

Mirjana Isakovic Ilic

Faculty of Forestry, University of Belgrade, Kneza Viseslava 1, 11000 Belgrade, Serbia. E-mail: isakm{at}yubc.net

Received 14 December 2006.


  Abstract

In this article we give a cut elimination procedure for two-sided sequent system of classical Lambek logic and, on the basis of the presented procedure, a new proof of decidability for this logic.

Keywords: Classical Lambek logic; Cut-elimination theorem; Decidability


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.