A simple and general method of solving the finite axiomatizability problems for Lambek's syntactic calculi (Q1825185): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 2 users not shown)
Property / reviewed by
 
Property / reviewed by: Wiesław Zielonka / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Wiesław Zielonka / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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

Revision as of 11:11, 20 June 2024

scientific article
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

    Statements

    A simple and general method of solving the finite axiomatizability problems for Lambek's syntactic calculi (English)
    0 references
    0 references
    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
    0 references
    syntactic type calculi
    0 references
    axiomatizability
    0 references
    Lambek calculi
    0 references
    categorial grammar
    0 references