Bound Anaphora and Type Logical Grammar
Abstract
(Though it is now known that many pronouns once lumped under ”bound variables” are in fact referential indefinites or other phenomena better accounted for in a DRT-like view of referents, there remain many true instances of sentenceinternally bound anaphora: this talk concerns only the latter.) Almost all versions of categorial grammar (CG) are differentiated from other syntactic theories in treating a multi-argument verb as an Ò-place predicate phrase (PrdP) that combines with a NP or other argument to yield a (Ò-1)-place PrdP (which, if (n–1) 1, then combines with another argument to yield a ´Ò ¾µ-place PrdP, until a sentence (0-place PrdP) results) – a ”curried function” account of argument structure. (In CG, Ú ÔÜ ÒÔ · ÒÔ Üµ. A number of CG analyses of Ú Ô bound anaphora (Bach & Partee 1980, Chierchia 1988, Szabolcsi 1992, Jacobson 1991, Dowty 1993, Jacobson 1999), though otherwise diverse, have in common that they treat anaphoric binding as a process that affects (only) a predicate phrase (PrdP) — usually (finite or non-finite) Ú Ô, else ÚÔ ÒÔ — by binding an internal pronoun, i.e. ”binding at the VP level”; semantically, this is usually indicated ´Üµ . The result of this binding is that the next argument the..