Natural language semantics and computability

DOI10.1007/S10849-019-09290-7zbMath1477.03112arXiv1605.04122OpenAlexW2963051799WikidataQ128014532 ScholiaQ128014532MaRDI QIDQ2425328

Richard Moot, Christian Retoré

Publication date: 26 June 2019

Published in: Journal of Logic, Language and Information (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.04122

zbMATH Keywords

complexityproof theorycategorial grammar

Mathematics Subject Classification ID

Logic of natural languages (03B65) Complexity of computation (including implicit computational complexity) (03D15) 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)

Related Items (1)

A Computable Solution to Partee’s Temperature Puzzle

Uses Software

• GitHub
• Grail
• CatLog3
• LinearOne

Cites Work

• Unnamed Item
• Unnamed Item
• The logic of categorial grammars. A deductive account of natural language syntax and semantics
• On the expressive power of abstract categorial grammars: Representing context-free formalisms
• Soft linear logic and polynomial time
• Proof nets for the multimodal Lambek calculus
• Natural language inference in Coq
• Parsing/theorem-proving for logical grammar \textit{CatLog3}
• The displacement calculus
• The Montagovian generative lexicon ΛTyn: a type theoretical framework for natural language semantics
• Product-Free Lambek Calculus Is NP-Complete
• Gapping as Like-Category Coordination
• Catalan Numbers
• Foundations of Software Science and Computation Structures
• Logic and structure
• Linguistic application of first order intuitionistic linear logic

This page was built for publication: Natural language semantics and computability