Weak Implicational Logics Related to the Lambek Calculus—Gentzen versus Hilbert Formalisms

DOI10.1007/978-1-4020-9084-4_10zbMath1180.03027OpenAlexW140525514MaRDI QIDQ3600569

Wojciech Zielonka

Publication date: 5 February 2009

Published in: Towards Mathematical Philosophy (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4020-9084-4_10

zbMATH Keywords

Lambek calculusfinite axiomatizabilityimplicational logics

Mathematics Subject Classification ID

Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)

Related Items (2)

Categorial Grammars and Their Logics ⋮ Extensions of Lambek Calculi

Cites Work

• Unnamed Item
• Cut-rule axiomatization of the syntactic calculus \(NL_0\)
• On reduction systems equivalent to the Lambek calculus with the empty string
• Cut-Rule Axiomatization of Product-Free Lambek Calculus With the Empty String
• The Mathematics of Sentence Structure
• Axiomatizability of Ajdukiewicz‐Lambek Calculus by Means of Cancellation Schemes
• On Reduction Systems Equivalent to the Non-associative Lambek Calculus with the Empty String
• The equivalence of two concepts of categorial grammar
• Completeness of weak implication
• A comparison between lambek syntactic calculus and intuitionistic linear propositional logic
• Cut-rule axiomatization of the syntactic calculus \(L_0\)

This page was built for publication: Weak Implicational Logics Related to the Lambek Calculus—Gentzen versus Hilbert Formalisms