Linear axiomatics of commutative product-free Lambek calculus (Q2277257): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3470458 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3787984 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Untersuchungen über das logische Schliessen. I / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3035262 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Mathematics of Sentence Structure / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Axiomatizability of Ajdukiewicz‐Lambek Calculus by Means of Cancellation Schemes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Cut-Rule Axiomatization of Product-Free Lambek Calculus With the Empty String / rank | |||
Normal rank |
Latest revision as of 16:14, 21 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Linear axiomatics of commutative product-free Lambek calculus |
scientific article |
Statements
Linear axiomatics of commutative product-free Lambek calculus (English)
0 references
1990
0 references
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.
0 references
linear axiomatization problem
0 references
commutative product-free Lambek calculus
0 references