Weak Implicational Logics Related to the Lambek Calculus—Gentzen versus Hilbert Formalisms
From MaRDI portal
Publication:3600569
DOI10.1007/978-1-4020-9084-4_10zbMATH Open1180.03027OpenAlexW140525514MaRDI QIDQ3600569FDOQ3600569
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
Recommendations
- Cut-Rule Axiomatization of Product-Free Lambek Calculus With the Empty String
- Publication:3035262
- On Reduction Systems Equivalent to the Non-associative Lambek Calculus with the Empty String
- On reduction systems equivalent to the Lambek calculus with the empty string
- Cut-rule axiomatization of the syntactic calculus \(NL_0\)
Cites Work
- The Mathematics of Sentence Structure
- Axiomatizability of Ajdukiewicz‐Lambek Calculus by Means of Cancellation Schemes
- The equivalence of two concepts of categorial grammar
- A comparison between lambek syntactic calculus and intuitionistic linear propositional logic
- Completeness of weak implication
- Title not available (Why is that?)
- 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
- On Reduction Systems Equivalent to the Non-associative Lambek Calculus with the Empty String
- Cut-rule axiomatization of the syntactic calculus \(L_0\)
Cited In (7)
This page was built for publication: Weak Implicational Logics Related to the Lambek Calculus—Gentzen versus Hilbert Formalisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3600569)
