Abstract
In Zielonka (1981a, 1989), I found an axiomatics for the product-free calculus L of Lambek whose only rule is the cut rule. Following Buszkowski (1987), we shall call such an axiomatics linear. It was proved that there is no finite axiomatics of that kind. In Lambek's original version of the calculus (cf. Lambek, 1958), sequent antecedents are non empty. By dropping this restriction, we obtain the variant L 0 of L. This modification, introduced in the early 1980s (see, e.g., Buszkowski, 1985; Zielonka, 1981b), did not gain much popularity initially; a more common use of L 0 has only occurred within the last few years (cf. Roorda, 1991: 29). In Zielonka (1988), I established analogous results for the restriction of L 0 to sequents without left (or, equivalently, right) division. Here, I present a similar (cut-rule) axiomatics for the whole of L 0.
This paper is an extended, corrected, and completed version of Zielonka (1997). Unlike in Zielonka (1997), the notion of rank of an axiom is introduced which, although inessential for the results given below, may be useful for the expected non-finite-axiomatizability proof.
The paper follows the same way of subject exposition as Zielonka (2000) but it is technically much less complicated. I restrict myself to giving bare results; all the ideological background is exactly the same as in case of the non-associative calculusNL 0 and those who are interested in it are requested to consult the introductory section of Zielonka (2000).
Similar content being viewed by others
References
Buszkowski, W., 1985, “Algebraic models of categorial grammars,” pp. 403–426 in Foundations of Logic and Linguistics: Problems and their Solutions, G. Dorn and P. Weingartner, eds., New York: Plenum Press.
Buszkowski, W., 1987, “The logic of types,” pp. 180–206 in Initiatives in Logic, J. Srzednicki, ed., Amsterdam: Martinus Nijhoff.
Lambek, J., 1958, “The mathematics of sentence structure,” American Mathematical Monthly 65, 154–170.
Roorda, D., 1991, “Resource Logics: Proof-theoretical investigations,” Ph.D. Thesis, Amsterdam.
Zielonka, W., 1981a, “Axiomatizability of Ajdukiewicz-Lambek calculus by means of cancellation schemes,” Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 27, 215–224.
Zielonka, W., 1981b, “Zagadnienia równoważności w teorii rachunków typów syntaktycznych,” Ph.D. Thesis, Pozna´n.
Zielonka, W., 1988, “Cut-rule axiomatization of product-free Lambek calculus with the empty string,” Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 34, 135–142.
Zielonka, W., 1989, “A simple and general method of solving the finite axiomatizability problems for Lambek's syntactic calculi,” Studia Logica 48, 35–40.
Zielonka, W., 1997, “More about the axiomatics of the Lambek calculus,” pp. 319–324 in Euphony and Logos. Essays in Honour of Maria Steffen-Batóg and Tadeusz Batóg, R. Murawski and J. Pogonowski, eds., Amsterdam: Rodopi.
Zielonka, W., 2000, “Cut-rule axiomatization of the syntactic calculus NL0,” Journal of Logic, Language and Information 9, 339–352.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Zielonka, W. Cut-Rule Axiomatization of the Syntactic Calculus L0. Journal of Logic, Language and Information 10, 233–236 (2001). https://doi.org/10.1023/A:1008355810911
Issue Date:
DOI: https://doi.org/10.1023/A:1008355810911