Abstract
Axiomatics which do not employ rules of inference other than the cut rule are given for commutative product-free Lambek calculus in two variants: with and without the empty string. Unlike the former variant, the latter one turns out not to be finitely axiomatizable in that way.
Similar content being viewed by others
References
J. van Benthem, The semantics of variety in categorial grammar, In: W. Buszkowski, W. Marciszewski, J. van Benthem (eds.), Categorial Grammar, J. Benjamins, Amsterdam-Philadelphia 1988.
W. Buszkowski, The logic of types, In: J. Srzednicki (ed.), Initiatives in Logic, M. Nijhoff, Amsterdam 1987.
G. Gentzen, Untersuchungen ueber das logische Schliessen, Mathematische Zeitschrift 39 (1935), pp. 176–210, 405–431.
M. Kàndulski, The non-associative Lambek calculus, In: W. Buszkowski, W. Marciszewski, J. van Benthem (eds.), Categorial Grammar, J. Benjamins, Amsterdam 1988.
J. Lambek, The mathematics of sentence structure, American Mathematical Monthly 65 (1958), pp. 154–170.
W. Zielonka, Axiomatizability of Ajdukiewicz-Lambek calculus by means of cancellation schemes, Zeitschrift für mathematische Logik und Grundlagen der Mathematik 27 (1981), pp. 215–224.
W. Zielonka, Cut-rule axiomatization of product-free Lambek calculus with the empty string, Zeitschrift für mathematische Logik und Grundlagen der Mathematik 34 (1988), pp. 135–142.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Zielonka, W. Linear axiomatics of commutative product-free Lambek calculus. Studia Logica 49, 515–522 (1990). https://doi.org/10.1007/BF00370162
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00370162