Some syntactic interpretations in different systems of full Lambek calculus

DOI10.1007/978-3-662-47197-5_2zbMATH Open1429.03089OpenAlexW1210449879MaRDI QIDQ5213652FDOQ5213652

Authors: Wojciech Buszkowski 

Publication date: 4 February 2020

Published in: Modality, Semantics and Interpretations (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-47197-5_2

Recommendations

• An interpretation of full Lambek calculus in its variant without empty antecedents of sequents
• Extensions of Lambek calculi
• Logical Aspects of Computational Linguistics
• Non-associative Lambek calculus with modalities: interpolation, complexity and FEP
• On involutive nonassociative Lambek calculus

Mathematics Subject Classification ID

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) Relative consistency and interpretations (03F25)

Cites Work

• Linear logic
• Residuated lattices. An algebraic glimpse at substructural logics
• Finite models of some substructural logics
• From word to sentence. A computational algebraic approach to grammar
• The finite model property for various fragments of intuitionistic linear logic
• The logic of categorial grammars. A deductive account of natural language syntax and semantics
• The Mathematics of Sentence Structure
• Distributive full Lambek calculus has the finite model property
• The Lambek calculus enriched with additional connectives
• Interpolation and FEP for logics of residuated algebras
• Nonassociative Lambek Calculus with Additives and Context-Free Languages
• Completeness Results for Lambek Syntactic Calculus
• Cut elimination and strong separation for substructural logics: an algebraic approach
• Multimodal linguistic inference
• Title not available (Why is that?)
• Algebraic aspects of cut elimination
• Logics without the contraction rule
• Title not available (Why is that?)
• Disjunction property and complexity of substructural logics
• A learnable representation for syntax using residuated lattices
• Language and grammar. Studies in mathematical linguistics and natural language
• Modal nonassociative Lambek calculus with assumptions: complexity and context-freeness
• Lambek grammars with the unit
• The finite embeddability property for residuated groupoids.
• An interpretation of full Lambek calculus in its variant without empty antecedents of sequents
• Distributive full nonassociative Lambek calculus with \(\mathrm{S4}\)-modalities is context-free

Cited In (2)

• Extensions of Lambek Calculi
• An interpretation of full Lambek calculus in its variant without empty antecedents of sequents

This page was built for publication: Some syntactic interpretations in different systems of full Lambek calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5213652)