Extensions of Lambek Calculi
From MaRDI portal
Publication:5014595
DOI10.1007/978-3-030-66545-6_4zbMath1500.03008OpenAlexW3136905166MaRDI QIDQ5014595
Publication date: 8 December 2021
Published in: Joachim Lambek: The Interplay of Mathematics, Logic, and Linguistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-66545-6_4
Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Proof-theoretic aspects of linear logic and other substructural logics (03F52)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The Lambek calculus extended with intuitionistic propositional logic
- Algebraic proof theory for substructural logics: cut-elimination and completions
- The logic of categorial grammars. A deductive account of natural language syntax and semantics
- Relational semantics of the Lambek calculus extended with classical propositional logic
- Disjunction property and complexity of substructural logics
- Linear logic
- Cut elimination and strong separation for substructural logics: an algebraic approach
- Residuated lattices. An algebraic glimpse at substructural logics
- Constructive logic with strong negation is a substructural logic. I
- Constructive logic with strong negation is a substructural logic. II
- Distributive full Lambek calculus has the finite model property
- Language in action. Categories, lambdas and dynamic logic
- Metamathematics of fuzzy logic
- Relation algebras as residuated Boolean algebras
- Residuation, structural rules and context freeness
- The finite embeddability property for residuated lattices, pocrims and BCK-algebras.
- Lattices and ordered algebraic structures
- Classical conservative extensions of Lambek calculus
- Classical non-associative Lambek calculus
- Models for the Lambek calculus
- Some lattice models of bilinear logic
- Decidable and undecidable logics with a binary modality
- Multimodal linguistic inference
- Relation algebras as expanded FL-algebras
- On involutive nonassociative Lambek calculus
- Lambek calculus is NP-complete
- On the Complexity of the Equational Theory of Residuated Boolean Algebras
- Interpolation and FEP for logics of residuated algebras
- On Classical Nonassociative Lambek Calculus
- Lambek Grammars with the Unit
- FULL LAMBEK CALCULUS WITH CONTRACTION IS UNDECIDABLE
- The Mathematics of Sentence Structure
- On Action Logic: Equational Theories of Action Algebras
- Free compact 2-categories
- Quantales and (noncommutative) linear logic
- Weak Implicational Logics Related to the Lambek Calculus—Gentzen versus Hilbert Formalisms
- Logics without the contraction rule
- Some Decision Problems in the Theory of Syntactic Categories
- The finite model property for various fragments of intuitionistic linear logic
- A BRIEF SURVEY OF FRAMES FOR THE LAMBEK CALCULUS
- The finite model property for various fragments of linear logic
- Sequent systems for compact bilinear logic
- Some Syntactic Interpretations in Different Systems of Full Lambek Calculus
- On the finite embeddability property for residuated ordered groupoids
- UNDECIDABILITY OF CONSEQUENCE RELATION IN FULL NON-ASSOCIATIVE LAMBEK CALCULUS
- Deductive systems and categories
This page was built for publication: Extensions of Lambek Calculi