On reduction systems equivalent to the Lambek calculus with the empty string

Studia Logica 71 (1):31-46 (2002)
  Copy   BIBTEX

Abstract

The paper continues a series of results on cut-rule axiomatizability of the Lambek calculus. It provides a complete solution of a problem which was solved partially in one of the author''s earlier papers. It is proved that the product-free Lambek Calculus with the empty string (L 0) 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 C designed by the author exactly for this purpose.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2009-01-28

Downloads
21 (#718,251)

6 months
10 (#251,846)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Shifting Priorities: Simple Representations for Twenty-seven Iterated Theory Change Operators.Hans Rott - 2009 - In Jacek Malinowski David Makinson & Wansing Heinrich (eds.), Towards Mathematical Philosophy. Springer. pp. 269–296.
On the directional Lambek calculus.Wojciech Zielonka - 2010 - Logic Journal of the IGPL 18 (3):403-421.

Add more citations

References found in this work

The Mathematics of Sentence Structure.Joachim Lambek - 1958 - Journal of Symbolic Logic 65 (3):154-170.
The logic of types.Wojciech Buszkowski - 1987 - In Jan T. J. Srzednicki (ed.), Initiatives in Logic. M. Nijhoff. pp. 180--206.
Axiomatizability of Ajdukiewicz-Lambek Calculus by Means of Cancellation Schemes.Wojciech Zielonka - 1981 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 27 (13-14):215-224.

Add more references