Extensions of Lambek calculi
From MaRDI portal
Publication:5014595
Recommendations
Cites work
- scientific article; zbMATH DE number 3959364 (Why is no real title available?)
- scientific article; zbMATH DE number 3974258 (Why is no real title available?)
- scientific article; zbMATH DE number 4020448 (Why is no real title available?)
- scientific article; zbMATH DE number 1341534 (Why is no real title available?)
- scientific article; zbMATH DE number 549971 (Why is no real title available?)
- scientific article; zbMATH DE number 742720 (Why is no real title available?)
- scientific article; zbMATH DE number 976409 (Why is no real title available?)
- scientific article; zbMATH DE number 1786547 (Why is no real title available?)
- scientific article; zbMATH DE number 1907195 (Why is no real title available?)
- scientific article; zbMATH DE number 2120362 (Why is no real title available?)
- scientific article; zbMATH DE number 842687 (Why is no real title available?)
- scientific article; zbMATH DE number 3222127 (Why is no real title available?)
- scientific article; zbMATH DE number 3251420 (Why is no real title available?)
- scientific article; zbMATH DE number 3254899 (Why is no real title available?)
- scientific article; zbMATH DE number 3024527 (Why is no real title available?)
- scientific article; zbMATH DE number 3050845 (Why is no real title available?)
- A BRIEF SURVEY OF FRAMES FOR THE LAMBEK CALCULUS
- Algebraic proof theory for substructural logics: cut-elimination and completions
- Classical conservative extensions of Lambek calculus
- Classical non-associative Lambek calculus
- Constructive logic with strong negation is a substructural logic. I
- Constructive logic with strong negation is a substructural logic. II
- Cut elimination and strong separation for substructural logics: an algebraic approach
- Decidable and undecidable logics with a binary modality
- Deductive systems and categories
- Disjunction property and complexity of substructural logics
- Distributive full Lambek calculus has the finite model property
- FULL LAMBEK CALCULUS WITH CONTRACTION IS UNDECIDABLE
- Free compact 2-categories
- From word to sentence. A computational algebraic approach to grammar
- Interpolation and FEP for logics of residuated algebras
- Lambek calculus is NP-complete
- Lambek grammars with the unit
- Language and grammar. Studies in mathematical linguistics and natural language
- Language in action. Categories, lambdas and dynamic logic
- Lattices and ordered algebraic structures
- Linear logic
- Logics without the contraction rule
- Metamathematics of fuzzy logic
- Modal logic
- Models for the Lambek calculus
- Multimodal linguistic inference
- On Action Logic: Equational Theories of Action Algebras
- On classical nonassociative Lambek calculus
- On involutive nonassociative Lambek calculus
- On the complexity of the equational theory of residuated Boolean algebras
- On the finite embeddability property for residuated ordered groupoids
- Quantales and (noncommutative) linear logic
- Relation algebras as expanded FL-algebras
- Relation algebras as residuated Boolean algebras
- Relational semantics of the Lambek calculus extended with classical propositional logic
- Residuated lattices. An algebraic glimpse at substructural logics
- Residuation, structural rules and context freeness
- Sequent systems for compact bilinear logic
- Some Decision Problems in the Theory of Syntactic Categories
- Some lattice models of bilinear logic
- Some syntactic interpretations in different systems of full Lambek calculus
- The Lambek calculus extended with intuitionistic propositional logic
- The Mathematics of Sentence Structure
- The finite embeddability property for residuated lattices, pocrims and BCK-algebras.
- The finite model property for various fragments of intuitionistic linear logic
- The finite model property for various fragments of linear logic
- The logic of categorial grammars. A deductive account of natural language syntax and semantics
- Undecidability of consequence relation in full non-associative Lambek calculus
- Weak Implicational Logics Related to the Lambek Calculus—Gentzen versus Hilbert Formalisms
Cited in
(25)- Classical conservative extensions of Lambek calculus
- Type similarity for the Lambek-Grishin calculus revisited
- Hybrid categorial type logics and the formal treatment of Chinese
- Sequent-systems and groupoid models. I
- Proof-theoretic aspects of hybrid type-logical grammars
- Polarized classical non-associative Lambek calculus and formal semantics
- Full Lambek Calculus in natural deduction
- Logical foundations for hybrid type-logical grammars
- Multi-sorted residuation
- A Sign-Based Extension to the Lambek Calculus for Discontinuous Constituency
- Theory and Applications of Relational Structures as Knowledge Instruments
- On Lambek's restriction in the presence of exponential modalities
- De Morgan interpretation of the Lambek-Grishin calculus
- Non-associative Lambek calculus with modalities: interpolation, complexity and FEP
- On associative Lambek calculus extended with basic proper axioms
- Joachim Lambek: the interplay of mathematics, logic, and linguistics
- Multimodality in the Hypergraph Lambek Calculus
- scientific article; zbMATH DE number 724626 (Why is no real title available?)
- Iterative division in the distributive full non-associative Lambek calculus
- Extended Lambek calculi and first-order linear logic
- scientific article; zbMATH DE number 7568186 (Why is no real title available?)
- Lambek calculus with restricted contraction and expansion
- A rule-extension of the non-associative Lambek calculus
- Extraction in the Lambek-Grishin Calculus
- Some syntactic interpretations in different systems of full Lambek calculus
This page was built for publication: Extensions of Lambek calculi
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5014595)
