Weak Implicational Logics Related to the Lambek Calculus—Gentzen versus Hilbert Formalisms
From MaRDI portal
Publication:3600569
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
- scientific article; zbMATH DE number 4134014 (Why is no real title available?)
- A comparison between lambek syntactic calculus and intuitionistic linear propositional logic
- Axiomatizability of Ajdukiewicz‐Lambek Calculus by Means of Cancellation Schemes
- Completeness of weak implication
- Cut-Rule Axiomatization of Product-Free Lambek Calculus With the Empty String
- Cut-rule axiomatization of the syntactic calculus \(L_0\)
- Cut-rule axiomatization of the syntactic calculus \(NL_0\)
- 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
- The Mathematics of Sentence Structure
- The equivalence of two concepts of categorial grammar
Cited in
(8)- scientific article; zbMATH DE number 465603 (Why is no real title available?)
- scientific article; zbMATH DE number 4134014 (Why is no real title available?)
- 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
- Categorial grammars and their logics
- scientific article; zbMATH DE number 6131419 (Why is no real title available?)
- Extensions of Lambek calculi
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3600569)