Multimodal linguistic inference (Q1923840)

The paper studies simple and mixed Lambek systems. Simple Lambek systems are formulated in the language of Lambek Calculus, i.e. with the binary connectives \(\bullet, /, \backslash\). These systems are called monomodal because they can be interpreted in Kripke-type models with a single ternary accessibilty relation (``Došen's semantics''). Mixed (or multimodal) systems may have several connectives of Lambek type: \(\bullet_i, /_i, \backslash_i\). Systems having Lambek connectives and a standard (unary) modal operator are also considered in the paper. The topics discussed are correspondence (both for axioms and structural rules), proof search and cut elimination, and linguistic motivations.