Axiomatizability of Ajdukiewicz‐Lambek Calculus by Means of Cancellation Schemes

DOI10.1002/malq.19810271306zbMath0467.03020OpenAlexW2106556109MaRDI QIDQ3919680

Wojciech Zielonka

Publication date: 1981

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19810271306

zbMATH Keywords

categorial grammarsyntactic typescategorial calculusproduct-free Lambek calculus

Mathematics Subject Classification ID

Artificial intelligence (68T99) General logic (03B99)

Related Items

Categorial Grammars and Their Logics ⋮ A polynomial algorithm for the membership problem with categorial grammars ⋮ Grammar specification in categorial logics and theorem proving ⋮ Weak Implicational Logics Related to the Lambek Calculus—Gentzen versus Hilbert Formalisms ⋮ Linear axiomatics of commutative product-free Lambek calculus ⋮ A simple and general method of solving the finite axiomatizability problems for Lambek's syntactic calculi ⋮ Using tableaux to automate the Lambek and other categorial calculi