Logical foundations for hybrid type-logical grammars

DOI10.1007/s10849-021-09348-5OpenAlexW4206976517MaRDI QIDQ2135950

Symon Jory Stevens-Guille, Richard Moot

Publication date: 10 May 2022

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

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

zbMATH Keywords

Lambek calculustype-logical grammarproof theoryproof netslambda grammar

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Agnostic hyperintensional semantics
• Linear logic
• Decision problems for propositional linear logic
• Combinatory reduction systems: Introduction and survey
• Combining algebraic rewriting, extensional lambda calculi, and fixpoints
• Proof nets for the multimodal Lambek calculus
• A PSPACE-complete fragment of second-order linear logic
• The complexity of multiplicative-additive Lambek calculus: 25 years later
• Lambek calculus is NP-complete
• On theories with a combinatorial definition of 'equivalence'
• Distinguishing Phenogrammar from Tectogrammar Simplifies the Analysis of Interrogatives
• The Mathematics of Sentence Structure
• Product-Free Lambek Calculus Is NP-Complete
• Some Decision Problems in the Theory of Syntactic Categories
• Gapping as Like-Category Coordination
• Logical Aspects of Computational Linguistics