A simple and general method of solving the finite axiomatizability problems for Lambek's syntactic calculi (Q1825185)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A simple and general method of solving the finite axiomatizability problems for Lambek's syntactic calculi |
scientific article; zbMATH DE number 4120152
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple and general method of solving the finite axiomatizability problems for Lambek's syntactic calculi |
scientific article; zbMATH DE number 4120152 |
Statements
A simple and general method of solving the finite axiomatizability problems for Lambek's syntactic calculi (English)
0 references
1989
0 references
Results of earlier papers on the same subject by the author [Z. Math. Logik Grundlagen Math. 27, 215-224 (1981; Zbl 0467.03020)] and \textit{M. Kandulski} [``The non-associative Lambek calculus, In: Categorial grammar, 141-151 (Benjamins, Amsterdam, 1988)] are generalized with extreme simplification of the non-finite-axiomatizability proofs.
0 references
syntactic type calculi
0 references
axiomatizability
0 references
Lambek calculi
0 references
categorial grammar
0 references
