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 Abstract Freely available
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 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.

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



References

  1. Abrusci VM. Phase semantics and sequent calculus for pure noncomutative classical linear propositional logic. The Journal of Symbolic Logic (1991) 56:1403–1451.[CrossRef]
  2. Gentzen G. Investigations into Logical Deduction. The Collected Papers of Gerhard Gentzen—Szabo ME, ed. (1969) North-Holland, Amsterdam.
  3. Hudelmaier J, Schroeder-Heister P. Classical Lambek Logic, Theorem Proving with Analytic Tableaux and Related Methods. Baumgartner Peter, Hähnle Reiner, Posegga Joachim, eds. (1995) Berlin, Heidelberg: Springer. 245–262.
  4. Lafont Y. The finite model property for various fragments of linear logic. The Journal of Symbolic Logic (1997) 62:1202–1208.[CrossRef]
  5. Lambek J. The mathematics of sentence structure. The American Mathematical Monthly (1958) 65:154–170.[CrossRef]
  6. Lambek J. From Categorial Grammar to Bilinear Logic. Substructural Logics—Schroeder-Heister P, Dosen K, eds. (1993) Oxford: Oxford University Press. 207–237.

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



This Article
Right arrow Abstract Freely available
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 Ilic, M. I.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?