2020/09/22 by Moot, Richard, Stevens-Guille, Symon
#Computation and Language (cs.CL) #FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO)
paper · doi:10.48550/arxiv.2009.10387
This paper explores proof-theoretic aspects of hybrid type-logical grammars , a logic combining Lambek grammars with lambda grammars. We prove some basic properties of the calculus, such as normalisation and the subformula property and also present both a sequent and a proof net calculus for hybrid type-logical grammars. In addition to clarifying the logical foundations of hybrid type-logical grammars, the current study opens the way to variants and extensions of the original system, including but not limited to a non-associative version and a multimodal version incorporating structural rules and unary modes.