Journal of Logic and Computation Advance Access originally published online on December 27, 2006
Journal of Logic and Computation 2007 17(2):299-310; doi:10.1093/logcom/exl041
| ||||||||||||||||||||||||||||||||||||||||||||||||||||
Original Articles |
On Reduction Systems Equivalent to the Non-associative Lambek Calculus with the Empty String
University of Warmia and Mazury, Faculty of Mathematics and Computer Science,
o
nierska 14a, 10-561 Olsztyn, Poland.
E-mail: zielonka{at}uwm.edu.pl
Received 20 June 2005.
| Abstract |
|---|
The article concludes a series of results on cut-rule axiomatizability of the Lambek calculus. It is proved that the non-associative product-free Lambek calculus with the empty string (NL0) is not finitely axiomatizable if the only rule of inference admitted is Lambek's cut rule. The proof makes use of the (infinitely) cut-rule axiomatized calculus NC designed by the author exactly for that purpose.
Keywords: Lambek calculus; cut rule; axiomatizability
![]()
CiteULike
Connotea
Del.icio.us What's this?
This article has been cited by other articles:
![]() |
W. Zielonka On the directional Lambek calculus Logic Jnl IGPL, September 9, 2009; (2009) jzp048v1. [Abstract] [PDF] |
||||
