NLQ: a modular type-logical grammar for quantifier movement, scope islands, and more

Abstract

In this thesis, I will discuss the grammar logic NLQ, an extension of the non-associative Lambek calculus based on Barker and Shan’s (2014) NLCL. For this logic, derivability is decidable. In addition, it is free of spurious ambiguity, can analyse scope islands, distinguish between strong and weak quantifiers, and more.