Linear axiomatics of commutative product-free Lambek calculus (Q2277257): Difference between revisions

The author deals with the linear axiomatization problem [see \textit{W. Buszkowski}, The logic of types, in: \textit{J. Srzednicki} (ed.), Initiatives in logic (M. Nijhoff, Amsterdam 1987)] for the commutative product-free Lambek calculus [see \textit{J. Lambek}, Am. Math. Mon. 65, 154-170 (1958; Zbl 0080.007)]. Two variants of the calculus have been considered: \(CL_ 0\) and CL, which does and does not admit the empty string, respectively. It is shown that CL is not finitely linearly axiomatizable. The paper is written very clearly.