This paper explores proof-theoretic aspects of hybrid type-logical grammars, a logic combining Lambek grammars with lambda grammars. We prove some basic properties the calculus, such as normalisation and subformula property also present both sequent proof net calculus for In addition to clarifying logical foundations current study opens way variants extensions original system, including but not...
