Grammar specification in categorial logics and theorem proving
From MaRDI portal
Publication:4647559
DOI10.1007/3-540-61511-3_123zbMath1412.68284OpenAlexW1481336809MaRDI QIDQ4647559
Publication date: 15 January 2019
Published in: Automated Deduction — Cade-13 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61511-3_123
Logic of natural languages (03B65) Grammars and rewriting systems (68Q42) 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
- Unnamed Item
- Symmetric categorial grammar
- Lambek calculus and its relational semantics: Completeness and incompleteness
- A generalization of analytic deduction via labelled deductive systems. I: Basic substructural logics
- A Beginner's Further Guide to Mathematical Logic
- The Mathematics of Sentence Structure
- Axiomatizability of Ajdukiewicz‐Lambek Calculus by Means of Cancellation Schemes
- The relative efficiency of propositional proof systems
- The Taming of the Cut. Classical Refutations with Analytic Cut
- On the Logic of Information Flow
- Clausal Proofs and Discontinuity