Situation semantics as conceived in Kratzer (1989) has been shown to be a valuable companion to the e-type pronoun analysis of donkey sentences (Heim 1990, and recently refined in Elbourne 2001b), and more generally binding out of DP (BOOD; Tomioka 1999; Büring 2001). The present paper proposes a fully compositional version of such a theory, which is designed to capture instances of crossover in BOOD.

Formal semantics is an approach to SEMANTICS1, the study of meaning, with roots in logic, the philosophy of language, and linguistics, and since the 1980’s a core area of linguistic theory. Characteristics of formal semantics to be treated in this article include the following: Formal semanticists treat meaning as mind-independent (though abstract), contrasting with the view of meanings as concepts “in the head” (see I-LANGUAGE AND E-LANGUAGE and MEANING EXTERNALISM AND INTERNALISM); formal semanticists distinguish semantics from knowledge of semantics (Lewis (...) 1975, Cresswell 1978), which has consequences for the notion of semantic COMPETENCE. A central part of the meaning of a sentence on this approach is its TRUTH CONDITIONS, and most although not all formal semantics is model-theoretic, relating linguistic expressions to model-theoretically constructed semantic values cast in terms of truth, REFERENCE, and possible worlds. This sets formal semantics apart from approaches which view semantics as relating a sentence just to a representation on another linguistic “level” (LOGICAL FORM) or a representation in an innate LANGUAGE OF THOUGHT. The formal semanticist could accept such representations as an aspect of semantics but would insist on asking what the model-theoretic semantic interpretation of the given representationlanguage is (Lewis 1970). Formal semantics is centrally concerned with COMPOSITIONALITY at the SYNTAX-SEMANTICS INTERFACE, how the meanings of larger constituents are built up from the meanings of their parts on the basis of their syntactic structure, and with the relation between compositional SENTENCE MEANING and meaning in discourse. (shrink)

The facts aboutsuch, then, indicate not just thatsuch is a pro-adjective, but also that binding conditions apply broadly to pro-ADJs and pro-CNs, as well as to a wide range of pro-arguments. If this is true, the CN binding process accomplished by rules (40) and (41) might better be expressed in a system that uses a Cooper (1979) store mechanism. In fact, Stump (p. 144) notes that this could easily be done. Meanings of the type of∨ P n could be stored, (...) just as NP meanings are, until an appropriate binding CN phrase was encountered. Binding conditions would simply require that a∨ P n meaning not come out of storage until the derivation had emerged from its governing category. The behavior of the pro-adjectivesuch suggests that an expression of any category, if it is legitimately translatable as a variable, may be a fullfledged proform; many principles and mechanisms described to account for the widely studied pronouns in fact apply to nonargument categories. (shrink)

We started from the fact that type theory, in the way it was implemented in IL, makes it costly to deal with nominalization processes. We have also argued that the type hierarchy as such doesn't play any real role in a grammar; the classification it provides for different semantic objects is already contained, in some sense, in the categorial structure of the grammar itself. So, on the basis of a theory of properties (Cocchiarella's HST*) we have tried to build a (...) language (IL*) whose syntax does not contain any explicit typing of expressions. Some of the consequences that this move brings about in the overall organization of the grammar can be summarized as follows:it allows for a simple treatment of infinitives, gerunds, factives and, in general, all those phenomena which might be analyzed as cases of nominalization;it provides a simpler and more constrained semantics than IL, since IL* doesn't go beyond second order, and its non-modal basis is axiomatizable;it suggests that the role of logical form in a theory of grammar could be that of a family of theories of semantic objects;it eliminates the extrinsic limitations of a type hierarchy on the choice of the system of syntactic categories.I think that it is interesting to notice how having an explicit semantic framework helps to provide a sense in which it is legitimate to regard the syntax of a language as ‘autonomous’. (shrink)

This volume is about abstract objects and the ways we refer to them in natural language. Asher develops a semantical and metaphysical analysis of these entities in two stages. The first reflects the rich ontology of abstract objects necessitated by the forms of language in which we think and speak. A second level of analysis maps the ontology of natural language metaphysics onto a sparser domain--a more systematic realm of abstract objects that are fully analyzed. This second level reflects the (...) commitments of real metaphysics. The models for these commitments assign truth conditions to natural language discourse. Annotation copyright by Book News, Inc., Portland, OR. (shrink)

In this paper I provide novel arguments for the predicative approach to proper names, which claims that argument proper names are definite descriptions containing a naming predicate . I first argue that modified proper names, such as the incomparable Maria Callas or the other Francis Bacon cannot be handled on the hypothesis that argument proper names have no internal structure and uniformly denote entities. I then discuss cases like every Adolf, which would normally be interpreted as every individual named Adolf (...) and show that the predicative approach to proper names can straightforwardly account for the distribution of a detectable naming component in proper names. Finally, I address the issue of proper names used as common nouns and plural proper names and demonstrate that they do not form a homogenous group yet can be clearly distinguished on both syntactic and semantic grounds from proper names involving a detectable naming component. (shrink)

This paper argues for the hypothesis of direct compositionality (as in, e.g., Montague 1974), according to which the combinatory syntactic rules specify a set of well-formed expressions while the semantic combinatory rules work in tandem to directly supply a model-theoretic interpretation to each expression as it is "built" in the syntax. (This thus obviates the need for any level like LF and, concomitantly, for any rules mapping surface structures to such a level.) I focus here on one related group of (...) phenomena: the interaction of "paycheck" pronouns with Weak Crossover effects and i-within-i effects. These interactions were studied in Jacobson (1977) as they show up in Back-Peters sentences. There I argued that these interactions show that paycheck pronouns have a complex representation at LF; here I show that all of the observations in this earlier work are compatible with the hypothesis of direct compositionality. The key tool is the adoption of a variation-free semantics (a semantics which makes no use of variables as part of the semantic machinery). In addition to the general consequences for the syntax/semantics interface, there are two other main results. First, I provide new arguments for a variable-free semantics. For example, it will be shown that under this view the paycheck reading of a pronoun comes for free; most other theories posit additional mechanisms and/or an additional lexical meaning for pronouns, and thus paycheck and regular pronouns are only accidentally homophonous. Second, I reiterate one of the central points in Jacobson (1977): this is that the first pronoun in a Bach-Peters sentence is indeed a paycheck pronoun, and hence nothing special needs to be said about these sentences nor does any new machinery need to be invoked for them. (shrink)

Obviation versus Blocking. Two approaches to the distribution of anaphors and pronominals have been explored in Binding Theory. The OBVIATION approach, originating in Lasnik 1976 and extensively developed in the GB tradition, posits autonomous disjoint reference principles which directly filter out illicit coindexations in certain structural domains. The BLOCKING approach treats disjoint reference derivatively, by making anaphors obligatory under coreference in the binding domain, and invoking a syntactic or pragmatic principle that forces disjoint reference pronominals in the “elsewhere” case.

Reductionists about knowledge-wh hold that "s knows-wh" (e.g. "John knows who stole his car") is reducible to "there is a proposition p such that s knows that p, and p answers the indirect question of the wh-clause." Anti-reductionists hold that "s knows-wh" is reducible to "s knows that p, as the true answer to the indirect question of the wh-clause." I argue that both of these positions are defective. I then offer a new analysis of knowledge-wh as a special kind (...) of de re knowledge. (shrink)

This paper develops a semantics with control over scope relations using Vermeulen’s stack valued assignments as information states. This makes available a limited form of scope reuse and name switching. The goal is to have a general system that fixes available scoping effects to those that are characteristic of natural language. The resulting system is called Scope Control Theory, since it provides a theory about what scope has to be like in natural language. The theory is shown to replicate a (...) wide range of grammatical dependencies, including options for, and constraints on, ‘donkey’, ‘binding’, ‘movement’, ‘Control’ and ‘scope marking’ dependencies. (shrink)

This paper shows how the dynamic interpretation of natural language introduced in work by Hans Kamp and Irene Heim can be modeled in classical type logic. This provides a synthesis between Richard Montague's theory of natural language semantics and the work by Kamp and Heim.

This paper is concerned with the relationship between the semantics of specificational and predicational sentences and the Connectivity effects they display. It discusses the advantages and disadvantages of semantic and syntactic approaches to Connectivity (the ‘unconstrained-be theory’, the ‘question-in-disguise theory’, and the ‘unclefting theory’), concluding that a semantic theory of Connectivity is not only preferable, but necessary. The paper also discusses the implications of such a move regarding Binding phenomena (i.e., Principle A, B, and C effects): adopting a semantic theory (...) of Connectivity requires a theory of Binding which is different from the standard GB Binding Theory. (shrink)

From Higgins (1973) to Iatridou and Varlokosta (1998), connectivity has been considered in the literature to be a defining characteristic of specificational pseudoclefts. This paper argues against this view based on an analysis of specificational pseudoclefts in Hebrew. Pseudoclefts in Hebrew are interesting in two ways. First, predicational and specificational pseudoclefts are distinguished lexically in the choice of the copula. Second, specificational pseudoclefts fall into two classes, each exhibiting a different set of connectivity effects. The connectivity pattern in Hebrew is (...) accounted for following Jacobson (1994) and Sharvit (1999), who assume that connectivity effects are independent of each other and derive them as a by-product of semantic equation. It is shown that this pattern cannot be obtained using any single grammatical operation, such as reconstruction or coping, which would necessarily derive all connectivity effects at once. (shrink)