Precursors. 2.1 Introduction Thus far I have presented an approach to the semantics of plurals in the form of two rather similar grammars for a fragment of English. And I have given a few examples of the kinds of things one can say within this ...

This extended investigation of the semantics of event (and state) sentences in their various forms is a major contribution to the semantics of natural language, simultaneously encompassing important issues in linguistics, philosophy, and logic. It develops the view that the logical forms of simple English sentences typically contain quantification over events or states and shows how this view can account for a wide variety of semantic phenomena. Focusing on the structure of meaning in English sentences at a &"subatomic&" level&-that is, (...) a level below the one most theories accept as basic or &"atomic&"&-Parsons asserts that the semantics of simple English sentences require logical forms somewhat more complex than is normally assumed in natural language semantics. His articulation of underlying event theory explains a wide variety of apparently diverse semantic characteristics of natural language, and his development of the theory shows the importance of seeing the distinction between events and states. Parsons demonstrates that verbs, also, indicate kinds of actions rather than specific, individual actions. Verb phrases, too, he argues, depend on modifiers to make their function and meaning in a sentence specific. An appendix gives many of the details needed to formalize the theory discussed in the body of the text and provides a series of templates that permit the generation of atomic formulas of English. (shrink)

Written by two of the leading figures in the field, this is a lucid and systematic introduction to semantics as applied to transformational grammars of the ...

What is the relation between models, as used in model-theoretic semantics, and the “world” which models represent? More specifically, let us consider the question of whether a single individual, event, time or other element in a model might be used to represent more than one individual, event, time or other object in the real world.

The Montagovian hypothesis of direct model-theoretic interpretation of syntactic surface structures is supported by an account of the semantics of binding that makes no use of variables, syntactic indices, or assignment functions & shows that the interpretation of a large portion of so-called variable-binding phenomena can dispense with the level of logical form without incurring equivalent complexity elsewhere in the system. Variable-free semantics hypothesizes local interpretation of each surface constituent; binding is formalized as a type-shifting operation on expressions that denote (...) functions, & sentences containing a free pronoun are analyzed as a function from individuals to propositions having a meaning of type (e,t). Standard weak crossover effects & binding patterns in sentences with multiple pronouns are shown to submit to straightforward type-theoretic treatments that do not rely on indexation. The variable-free semantics smoothly implements full surface compositionality & requires less machinery than standard accounts to handle functional questions, their answers, sloppy inferences, & across-the-board binding. 73 References. J. Hitchcock. (shrink)

This book introduces an important group of logics that have come to be known under the umbrella term 'susbstructural'. Substructural logics have independently led to significant developments in philosophy, computing and linguistics. _An Introduction to Substrucural Logics_ is the first book to systematically survey the new results and the significant impact that this class of logics has had on a wide range of fields.The following topics are covered: * Proof Theory * Propositional Structures * Frames * Decidability * Coda Both (...) students and professors of philosophy, computing, linguistics, and mathematics will find this to be an important addition to their reading. (shrink)

We present a general theory of scope and binding in which both crossover and superiority violations are ruled out by one key assumption: that natural language expressions are normally evaluated (processed) from left to right. Our theory is an extension of Shan’s (2002) account of multiple-wh questions, combining continuations (Barker, 2002) and dynamic type-shifting. Like other continuation-based analyses, but unlike most other treatments of crossover or superiority, our analysis is directly compositional (in the sense of, e.g., Jacobson, 1999). In particular, (...) it does not postulate a level of Logical Form or any other representation distinct from surface syntax. One advantage of using continuations is that they are the standard tool for modeling order-of-evaluation in programming languages. This provides us with a natural and independently motivated characterization of what it means to evaluate expressions from left to right. We give a combinatory categorial grammar that models the syntax and the semantics of quantifier scope and wh-question formation. It allows quantificational binding but not crossover, in-situ wh but not superiority violations. In addition, the analysis automatically accounts for a variety of sentence types involving binding in the presence of pied piping, including reconstruction cases such as Whose criticism of hisi mother did each personi resent? (shrink)

In the spring of 1978, one of the authors of this book was sitting in on a course in logic for linguists given by the other author. In attempting to present some of Montague's insights in an elementary way, the authors began dis cussions aimed towards the construction of a simple model-theoretical semantic apparatus which could be applied directly to a small English-like language and used to illustrate the methods of formal logical interpretation. In these discussions two points impressed themselves (...) on us. First, our task could be simplified by using boolean algebras and boolean homomorphisms in the models; and second, the boolean approach we were developing had much more widespread relevance to the logical structure of English than we first thought. During the summer and fall of 1978 we continued work on the system, proving the more fundamental theorems and outlining the way in which an intensional interpretation scheme could be developed which made use of the boolean approach. We presented our findings in a monograph which the UCLA Linguistics Department kindly published as part of their series called Occa sional Papers in Linguistics; one of the authors also presented the system at a colloquium held at the Winter Meeting of the Linguistic Society of America in December 1978. (shrink)

Using the programming-language concept of continuations, we propose a new, multimodal analysis of quantification in Type Logical Grammar. Our approach provides a geometric view of in-situ quantification in terms of graphs, and motivates the limited use of empty antecedents in derivations. Just as continuations are the tool of choice for reasoning about evaluation order and side effects in programming languages, our system provides a principled, type-logical way to model evaluation order and side effects in natural language. We illustrate with an (...) improved account of quantificational binding, weak crossover, wh-questions, superiority, and polarity licensing. (shrink)

This paper proposes that the meanings of some natural language expressions should be thought of as functions on their own continuations. Continuations are a well-established analytic tool in the theory of programming language semantics; in brief, a continuation is the entire default future of a computation. I show how a continuation-based grammar can unify several aspects of natural language quantification in a new way: merely stating the truth conditions for quantificational expressions in terms of continuations automatically accounts for scope displacement (...) and scope ambiguity. To prove this claim, I exhibit a simple finite context-free grammar with a strictly compositional semantics in which quantificational NPs are interpreted in situ but take semantic scope over larger constituents. There is no Quantifier Raising (nor any use of a level of Logical Form distinct from overt syntax), no Cooper Storage (or similar mechanisms used in many recent HPSG, Categorial, or Type-logical treatments), and no need for type-shifting (as in Hendriks' Flexible Types account). Continuations also provide a natural account of generalized coordination that does not require either type-shifting or type polymorphism. Compositionality issues are discussed in some detail. (shrink)

In this paper, I want to contribute to understanding and improving on Keenan'sintriguing equivalence result about reducible type quantifiers (Keenan, 1992).I give an alternative proof of his result which generalizes to type quantifiers, andI show how the reduction of a reducible type quantifier to (the composition of) ntype quantifiers can be effected.

In sentences like Every teacher laughed we think of every teacher as a unary (=type (1)) quantifier - it expresses a property of one place predicate denotations. In variable binding terms, unary quantifiers bind one variable. Two applications of unary quantifiers, as in the interpretation of No student likes every teacher, determine a binary (= type (2)) quantifier; they express properties of two place predicate denotations. In variable binding terms they bind two variables. We call a binary quantifier Fregean (or (...) reducible) if it can in principle be expressed by the iterated application of unary quantifiers. In this paper we present two mathematical properties which distinguish non-Fregean quantifiers from Fregean ones. Our results extend those of van Benthem (1989) and Keenan (1987a). We use them to show that English presents a large variety of non-Fregean quantifi ers. Some are new here, others are familiar (though the proofs that they are non-Fregean are not). The main point of our empirical work is to inform us regarding the types of quantification natural language presents - in particular (van Benthem, 1989) that it goes beyond the usual (Fregean) analysis which treats it as mere iterated application of unary quantifiers. Secondarily, our results challenge linguistic approaches to "Logical Form" which constrain variable binding operators to "locally" bind just one occurrence of a variable, e.g., the Bijection Principle (BP) of Koopman and Sportiche (1983). The BP (correctly) blocks analyses like For which x, x's mother kissed x? for Who did his mother kiss? since For which x would locally bind two occurrences of x. But some of our irreducible binary quantifiers are naturally represented by operators which do locally bind two variables. This paper is organized as follows: Section 1 provides an explicit formulation of our questions of concern. Section 2 classifies the English constructions which we show to be non-Fregean. Section 3 presents the mathematical properties which test for non-Fregean quantification and applies these tests to the constructions in Section 2. Proofs of the mathema tical properties are given in the Appendix. (shrink)

Functions of type n are characteristic functions on n-ary relations. Keenan [5] established their importance for natural language semantics, by showing that natural language has many examples of irreducible type n functions, i.e., functions of type n that cannot be represented as compositions of unary functions. Keenan proposed some tests for reducibility, and Dekker [3] improved on these by proposing an invariance condition that characterizes the functions with a reducible counterpart with the same behaviour on product relations. The present paper (...) generalizes the notion of reducibility (a quantifier is reducible if it can be represented as a composition of quantifiers of lesser, but not necessarily unary, types), proposes a direct criterion for reducibility, and establishes a diamond theorem and a normal form theorem for reduction. These results are then used to show that every positive n function has a unique representation as a composition of positive irreducible functions, and to give an algorithm for finding this representation. With these formal tools it can be established that natural language has examples of n-ary quantificational expressions that cannot be reduced to any composition of quantifiers of lesser degree. (shrink)