Using tableaux to automate the Lambek and other categorial calculi

DOI10.1006/INCO.1999.2853zbMath1006.03008OpenAlexW2005322816MaRDI QIDQ1854380

Saturnino F. Luz

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1999.2853

zbMATH Keywords

Lambek calculusnatural language processingautomated theorem provingcategorial grammarslabeled analytic tableauxlabeled deductionLLKE tableaux system

Mathematics Subject Classification ID

Logic of natural languages (03B65) Mechanization of proofs and logical operations (03B35) Natural language processing (68T50) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lambek calculus and its relational semantics: Completeness and incompleteness
• A generalization of analytic deduction via labelled deductive systems. I: Basic substructural logics
• The Mathematics of Sentence Structure
• Axiomatizability of Ajdukiewicz‐Lambek Calculus by Means of Cancellation Schemes
• The Taming of the Cut. Classical Refutations with Analytic Cut
• On the Logic of Information Flow
• Clausal Proofs and Discontinuity

This page was built for publication: Using tableaux to automate the Lambek and other categorial calculi