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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abrusci, V. M., ‘A comparison between Lambek syntactic calculus and intuitionistic linear propositional logic’, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik36 (1990), 11-15.
Buszkowski, W., ‘Algebraic models of categorial grammars’, in Foundations of Logic and Linguistics: Problems and Their Solutions, G. Dorn, P. Weingartner (eds.), Plenum Press, New York-London 1985, pp. 403-426.
Buszkowski, W., ‘The logic of types’, in Initiatives in Logic, J. Srzednicki (ed.), M. Nijhoff, Amsterdam 1987, pp. 180-206.
Janssen, T., ‘On properties of the Zielonka-Lambek calculus’, in Proceedings of the Eighth Amsterdam Colloquium, Amsterdam 1991, pp. 303-308.
Kandulski, M., ‘The non-associative Lambek calculus]’, in Categorial Grammars, W. Buszkowski, W. Marciszewski, J. van Benthem (eds.), Benjamins, Amsterdam-Philadelphia 1988, pp. 141-151.
Lambek, J., ‘The mathematics of sentence structure’, American Mathematical Monthly65 (1958), 154-170.
Lambek, J., ‘On the calculus of syntactic types’, in Structure of Language and Its Mathematical Aspects, R. Jakobson (ed.), AMS, Providence 1961, pp. 166-178.
Moortgat, M., Categorial Investigations: Logical and Linguistic Aspects of the Lambek Calculus, Foris, Dordrecht 1988.
Roorda, D., Resource Logics: Proof-theoretical Investigations, Ph.D. Thesis, Amsterdam 1991.
Zielonka, W., ‘Axiomatizability of Ajdukiewicz-Lambek calculus by means of cancellation schemes’, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik27 (1981), 215-224.
Zielonka, W., ‘Zagadnienia równoważności w teorii rachunków typów syntaktycznych’. Ph.D. Thesis, Poznań 1981.
Zielonka, W., ‘Cut-rule axiomatization of product-free Lambek calculus with the empty string’. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik34 (1988), 135-142.
Zielonka, W., ‘A simple and general method of solving the finite axiomatizability problems for Lambek's syntactic calculi’, Studia Logica48 (1989), 35-40.
Zielonka, W., ‘Cut-rule axiomatization of the syntactic calculus NL 0’, Journal of Logic, Language and Information9 (2000), 339-352.
Zielonka, W., ‘Cut-rule axiomatization of the syntactic calculus L 0’, Journal of Logic, Language and Information10 (2001), 233-236.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Zielonka, W. On Reduction Systems Equivalent to The Lambek Calculus with the Empty String. Studia Logica 71, 31–46 (2002). https://doi.org/10.1023/A:1016382907414
Issue Date:
DOI: https://doi.org/10.1023/A:1016382907414