The semantics of directional prepositions is investigated from the perspective of aspect. What distinguishes telic PPs (like to the house) from atelic PPs (like towards the house), taken as denoting sets of paths, is their algebraic structure: atelic PPs are cumulative, closed under the operation of concatenation, telic PPs are not. Not only does this allow for a natural and compositional account of how PPs contribute to the aspect of a sentence, but it also guides our understanding of the lexical (...) semantics of prepositions in important ways. Semantically, prepositions turn out to be quite similar to nouns and verbs. Nominal distinctions (like singular and plural, mass and count) and verbal classes (like semelfactives and degree achievements) have their prepositional counterparts. (shrink)

The article studies two related issues. First, it introduces the notion of the contraposition of quantifiers which is a “dual” notion of symmetry and has similar relations to co-intersectivity as symmetry has to intersectivity. Second, it shows how symmetry and contraposition can be generalised to higher order type quantifiers, while preserving their relations with other notions from generalized quantifiers theory.

A type quantifier F is symmetric iff F ( X, X )( Y ) = F ( Y, Y )( X ). It is shown that quantifiers denoted by irreducible binary determiners in natural languages are both conservative and symmetric and not only conservative.

In this paper I put forward and substantiate a possible defensive move on behalf of the relativist about predicates of personal taste that can be used to block a recent contextualist argument raised against the view: the ‘argument from binding’ proposed in Schaffer (). The move consists in adopting Recanati's “variadic functions” apparatus and applying it to predicates of personal taste like ‘tasty’ and experiencer phrases like ‘for John’. I substantiate the account in a basic relativistic framework and reply to (...) several objections to the variadic-functions approach in general and to its application to the expressions at hand. (shrink)

This paper develops an inference system for natural language within the ‘Natural Logic’ paradigm as advocated by van Benthem, Sánchez and others. The system that we propose is based on the Lambek calculus and works directly on the Curry-Howard counterparts for syntactic representations of natural language, with no intermediate translation to logical formulae. The Lambek -based system we propose extends the system by Fyodorov et~al., which is based on the Ajdukiewicz/Bar-Hillel calculus Bar Hillel,. This enables the system to deal with (...) new kinds of inferences, involving relative clauses, non-constituent coordination, and meaning postulates that involve complex expressions. Basing the system on the Lambek calculus leads to problems with non-normalized proof terms, which are treated by using normalization axioms. (shrink)

We prove a theorem stating that any semantics can be encoded as a compositional semanties, which means that, essentially, the standard definition of compositionality is formally vacuous. We then show that when compositional semantics is required to be systematic (that is, the meaning function cannot be arbitrary, but must belong to some class), it is possible to distinguish between compositional and noncompositional semantics. As a result, we believe that the paper clarifies the concept of compositionality and opens the possibility of (...) making systematic formal comparisons of different systems of grammar. (shrink)

The Strongest Meaning Hypothesis of Dalrymple et al (1994,1998), which was originally proposed as a principle for the interpretation of reciprocals, is extended in this paper into a general principle of plural predication. This principle applies to complex predicates that are composed of lexical predicates that hold of atomic entities, and determines the pluralities in the extension of the predicate. The meaning of such a complex predicate is claimed to be the truth-conditionally strongest meaning that does not contradict lexical properties (...) of the simple predicates it contains. Weak interpretations of reciprocals (as in the books are stacked on top of each other), plural predicate conjunction (e.g. the books are old and new) and ’atomic’ distributivity in general are derived by a unified mechanism, which ’weakens’ the basic universal meanings of strong reciprocals, boolean conjunction and quantification over atomic entities. (shrink)

This paper presents a generalization of the standard notions of left monotonicity (on the nominal argument of a determiner) and right monotonicity (on the VP argument of a determiner). Determiners such as “more than/at least as many as” or “fewer than/at most as many as”, which occur in so-called propositional comparison, are shown to be monotone with respect to two nominal arguments and two VP-arguments. In addition, it is argued that the standard Generalized Quantifier analysis of numerical determiners such as (...) “more than three/at least three” is a simplification which ignores the fundamental parallellism with the propositional comparatives. Furthermore, the symmetric monotonicity configurations of the existential “some” and “no” are shown to be straightforwardly related to those of numerical comparatives with the limit numeral zero, whereas the asymmetric configurations of universal “all” and “not all” involve the extra complicating mechanism of polarity reversal, which is related to Keenan's notion of co-intersectivity (as opposed to intersectivity). A second aim of the paper is to investigate some of the factors reducing the inferential potential of determiners. Different types of comparative determiners and their modification will be considered in detail. In addition, a systematic interaction will be revealed between the monotonicity properties of the determiners in propositional comparatives and the differ ent types of ellipsis in the “than”-complement. Different degrees of ellipsis are defined in terms of informational dependencies between the “than”-complement and the main clause. A general balancing mechanism is observed by virtue of which an increase in informational dependency is compensated by a reduction of the inferential potential of the comparative determiner. The structure of the paper is as follows. Part two deals with propositional comparison and introduces the two basic monotonicity configurations. Part three distinguishes three types of informational dependencies or ellipsis between the “than”-complement and the main clause. In Section 3.1 the “than”-complement only contains a VP constituent, whereas in Section 3.2. it only consists of a nominal constituent. Section 3.3 considers more complex instances of multiple dependencies. Section 3.4 then looks at the interaction of these three types with the modifier “proportionally”. Part four presents the two basic monotonicity configurations for numerical comparison, whereas part five deals with more complex numerical determiners. Bounding determiners, such as “between five and ten”, and other boolean combinations are discussed in Section 5.1, whereas Section 5.2 goes into approximative determiners involving modifiers such as “only” or “almost”. Section 5.3. is devoted to proportional determiners such as “more than two out of three”. Part six then considers the standard existential and universal quantifiers. Section 6.1 reformulates the standard Generalized Quantifier analysis in comparative terms, whereas Section 6.2 deals with exception determiners of the form “all but five”. (shrink)

This paper offers an analysis of metalinguistic comparatives such as more dumb than crazy in which they differ from ordinary comparatives in the scale on which they compare: ordinary comparatives use scales lexically determined by particular adjectives, but metalinguistic ones use a generally-available scale of imprecision or ‘pragmatic slack’. To implement this idea, I propose a novel compositional implementation of the Lasersohnian pragmatic-halos account of imprecision—one that represents clusters of similar meanings as Hamblin alternatives. In the theory that results, existential (...) closure over alternatives mediates between alternative-sets and meanings in which imprecision has been resolved. I then articulate a version of this theory in which the alternatives are not related meanings but rather related utterances, departing significantly from Lasersohn’s original conception. Although such a theory of imprecision is more clearly ‘metalinguistic’, the evidence for it from metalinguistic comparatives in English is surprisingly limited. The overall picture that emerges is one in which the grammatical distinction between ordinary and metalinguistic comparatives tracks the independently motivated distinction between vagueness and imprecision. (shrink)

Quantified NPs in questions may lead to an interpretation in which the NP quantifies into the question. Which dish did every guest bring? can be understood as: 'For every guest x: which dish did x bring?'. After a review of previous approaches that tried to capture this quantification formally or to explain it away, it is argued that such readings involve quantification into speech acts. As the algebra of speech acts is more limited than a Boolean algebra – it only (...) contains conjunction, not disjunction or negation – it is predicted that only universal quantifiers can scope out of questions or other speech acts. The approach is extended to indirect questions, which either are embedded speech acts or coerced to denote the true answers, depending on the embedding verb; in the latter case a Boolean structure results, and we find wide-scope readings of non-universal quantifiers. (shrink)

The present paper is the result of a long struggle to understand how the notion of compositionality can be used to motivate the structure of a sentence. While everyone seems to have intuitions about which proposals are compositional and which ones are not, these intuitions generally have no formal basis. What is needed to make such arguments work is a proper understanding of what meanings are and how they can be manipulated. In particular, we need a definition of meaning that (...) bans all mentioning of syntactic structure; it is not the task of semantics to state in which way things are put together in syntax. The present paper presents such a theory of meaning. This, in tandem with some minimal assumptions on the syntactic process (that there can be no deletion) yield surprisingly deep insights into natural language. First, it rehabilitates a lot of linguistic work as necessary on semantic grounds and defends it against potential claims of redundancy. For example, θ-roles and linking are an integral part of semantics, and not syntax. To assume the latter is to put the cart before the horse. Second, as a particular example we shall show that Dutch is not strongly context free even if weakly context free. To our knowledge, this is the first formal proof of this fact. (shrink)

The phenomenon of inverse linking, where a noun phrase embedded within another behaves with respect to binding as though it were structurally independent, has proven challenging for theories of the syntax–semantics interface. In this paper I show that, using an LF-movement style approach to the syntax–semantics interface, we can derive all and only the appropriate meanings for such constructions using no semantic operations other than function application and composition. The solution relies neither on a proliferation of lexical ambiguity nor on (...) abandoning the idea that pronouns denote variables, but rather on a straightforward (and standard) reification of assignment functions, which allows us to define abstraction operators within our models. (shrink)

Researchers often assume that possible worlds and times are represented in the syntax of natural languages. However, it has been noted that such a system can overgenerate. This paper proposes a constraint on systems where worlds and times are represented as situation pronouns. The Intersective Predicate Generalization, based on and extending work by R. Musan, states that two items composed via Predicate Modification, such as a noun and an intersective modifier, must be evaluated in the same world and time. To (...) explain this generalization, a rule of Situation Economy is advanced, which holds that structures must have the fewest number of situation pronouns possible. Since strong DPs require a situation pronoun to receive a de re reading, a restriction on the type of strong determiners is proposed, which supersedes Situation Economy in this case. Finally, the paper shows how the Situation Economy approach explains an unrelated phenomenon involving bare plurals and examines the connection between this new rule and the grammar of natural language in general. (shrink)

The traditional scope theory of intensionality (STI) (see Russell 1905; Montague 1973; Ladusaw 1977; Ogihara 1992, 1996; Stowell 1993) is simple, elegant, and, for the most part, empirically adequate. However, a few quite troubling counterexamples to this theory have lead researchers to propose alternatives, such as positing null situation pronouns (Percus 2000) or actuality operators (Kamp 1971; Cresswell 1990) in the syntax of natural language. These innovative theories do correct the undergeneration of the original scope theory, but at a cost: (...) the situation pronoun and operator theories overgenerate, as argued extensively by Percus (2000) and Keshet (2008). This paper presents new data that supports the STI over other analyses, such as structures where DPs lose their de re readings in positions where syntactic movement is blocked. These data point the way to a new theory of intensionality. This new theory, called split intensionality, is a modification of the STI which aims to solve the problems raised for the original scope theory without overgenerating. The proposal calls for an additional intensional abstraction operator that creates an expression denoting an intension from an expression denoting an extension. When a DP moves to a position above this operator, it is interpreted de re; otherwise it is de dicto. The crucial part of the new proposal is that a DP may move above this operator and yet remain, for instance, below an intentional verb or inside an if-clause. Therefore, a DP within an island for syntactic movement may be de re and yet not move out of the island when the intensional abstraction operator is also within the island. (shrink)

Elements of Formal Semantics has already been reviewed twice :42, 2016; Erlewine in Comput Linguist 42:837–839, 2017). As well, the website for the work is accompanied by evaluative quotes by noted scholars. All are very positive concerning its clarity and its utility as an introduction to formal semantics for natural language. As I agree with these evaluations my interest in reiterating them in slightly different words is limited. So my reviews of the content chapters will be accompanied by a Reflections (...) section consisting of my own reflections on the foundations of model theoretic semantics for natural language as laid out in EFS. The issues I address—alternate ways of accomplishing the tasks Winter treats—should not be included in an introductory work but they may be helpful for those who teach classes for which EFS is an appropriate text. They might also help with queries about the content of the text by those using it. I note that a mark of a clear text is that it allows the reader to reflect on its content not its presentation. (shrink)

Quantifiers in Language and Logic (QLL) is a major contribution to natural language semantics, specifically to quantification. It integrates the extensive recent work on quantifiers in logic and linguistics. It also presents new observations and results. QLL should help linguists understand the mathematical generalizations we can make about natural language quantification, and it should interest logicians by presenting an extensive array of quantifiers that lie beyond the pale of classical logic. Here we focus on those aspects of QLL we judge (...) to be of specific interest to linguists, and we contribute a few musings of our own, as one mark of a worthy publication is whether it stimulates the reader to seek out new observations, and QLL does. QLL is long and fairly dense, so we make no attempt to cover all the points it makes. But QLL has a topic index, a special symbols index and two tables of contents, a detailed one and an overview one, all of which help make it user friendly. QLL is presented in four parts: I, The Logical Conception of Quantifiers and Quantification with an introductory section Quantification . II, Quantifiers of Natural Language , the most extensive section in the book and of the most direct interest to linguists. III, Beginnings of a Theory of Expressiveness, Translation, and Formalization introduces notions of expressive power and definability, and IV, presents recent work and techniques concerning quantifier definability over finite domains, making accessible to linguists recent work in finite model theory. (shrink)

Within Linguistics the semantic analysis of natural languages (English, Swahili, for example) has drawn extensively on semantical concepts first formulated and studied within classical logic, principally first order logic. Nowhere has this contribution been more substantive than in the domain of quantification and variable binding. As studies of these notions in natural language have developed they have taken on a life of their own, resulting in refinements and generalizations of the classical quantifiers as well as the discovery of new types (...) of quantification which exceed the expressive capacity of the classical quantifiers. We refer the reader to Keenan and Westerståhl (1997) for an overview of results in this area. Here, we focus on one property of quantification in natural language—its inherently sortal nature—which distinguishes it from quantification in classical logic. (shrink)

We revisit a typological puzzle due to Horn (Doctoral Dissertation, UCLA, 1972) regarding the lexicalization of logical operators: in instantiations of the traditional square of opposition across categories and languages, the O corner, corresponding to ‘nand’ (= not and), ‘nevery’ (= not every), etc., is never lexicalized. We discuss Horn’s proposal, which involves the interaction of two economy conditions, one that relies on scalar implicatures and one that relies on markedness. We observe that in order to express markedness and to (...) account for a bigger typological puzzle, namely the absence of lexicalizations of ‘XOR’ (= exclusive or), ‘all-or-none’, and many other imaginable logical operators, one must restrict the basic lexicalizable elements to a small set of primitives. We suggest that an ordering based perspective, following Keenan and Faltz (Boolean semantics for natural language, 1985), makes the stipulated primitives that we arrive at more natural. We also propose a modification to Horn’s proposal, based on recent work on implicatures, in which only the implicature condition is operative and in which markedness is part of the definition of the alternatives for scalar implicatures rather than an independent condition. (shrink)

Second-order abstract categorial grammars (de Groote in Association for computational linguistics, 39th annual meeting and 10th conference of the European chapter, proceedings of the conference, pp. 148–155, 2001) and hyperedge replacement grammars (Bauderon and Courcelle in Math Syst Theory 20:83–127, 1987; Habel and Kreowski in STACS 87: 4th Annual symposium on theoretical aspects of computer science. Lecture notes in computer science, vol 247, Springer, Berlin, pp 207–219, 1987) are two natural ways of generalizing “context-free” grammar formalisms for string and tree (...) languages. It is known that the string generating power of both formalisms is equivalent to (non-erasing) multiple context-free grammars (Seki et al. in Theor Comput Sci 88:191–229, 1991) or linear context-free rewriting systems (Weir in Characterizing mildly context-sensitive grammar formalisms, University of Pennsylvania, 1988). In this paper, we give a simple, direct proof of the fact that second-order ACGs are simulated by hyperedge replacement grammars, which implies that the string and tree generating power of the former is included in that of the latter. The normal form for tree-generating hyperedge replacement grammars given by Engelfriet and Maneth (Graph transformation. Lecture notes in computer science, vol 1764. Springer, Berlin, pp 15–29, 2000) can then be used to show that the tree generating power of second-order ACGs is exactly the same as that of hyperedge replacement grammars. (shrink)

A two-stage procedure is described which induces type-logical grammar lexicons from sentences annotated with skeletal terms of the simply typed lambda calculus. First, a generalized formulae-as-types correspondence is exploited to obtain all the type-logical proofs of the sample sentences from their lambda terms. The resulting lexicons are then optimally unified. The first stage constitutes the semantic bootstrapping (Pinker, Language Learnability and Language Development, Harvard University Press, 1984), while the unification procedure of Buszkowski and Penn represents a first attempt at structure-dependent (...) distributional learning of the syntactic and semantic categories. This effort extends earlier induction procedures (Buszkowski and Penn, 1990, Studia Logica 49, 431–454; Kanazawa, 1998, CSLI Publications and the European Association for Logic, Language and Information) for classical categorial grammar to at first the non-associative Lambek calculus, and then to a large class of type logics enriched by modal operators and structural rules. (shrink)

A two-stage procedure is described which induces type-logical grammar lexicons from sentences annotated with skeletal terms of the simply typed lambda calculus. First, a generalized formulae-as-types correspondence is exploited to obtain all the type-logical proofs of the sample sentences from their lambda terms. The resulting lexicons are then optimally unified. The first stage constitutes the semantic bootstrapping (Pinker, Language Learnability and Language Development, Harvard University Press, 1984), while the unification procedure of Buszkowski and Penn represents a first attempt at structure-dependent (...) distributional learning of the syntactic and semantic categories. This effort extends earlier induction procedures (Buszkowski and Penn, 1990, Studia Logica 49, 431–454; Kanazawa, 1998, CSLI Publications and the European Association for Logic, Language and Information) for classical categorial grammar to at first the non-associative Lambek calculus, and then to a large class of type logics enriched by modal operators and structural rules. (shrink)

Standard first-order logic plus quantifiers of all finite orders ("SFOLω") faces four well-known difficulties when used to characterize the behavior of certain English quantifier phrases. All four difficulties seem to stem from the typed structure of SFOLω models. The typed structure of SFOLω models is in turn a product of an asymmetry between the meaning of names and the meaning of predicates, the element-set asymmetry. In this paper we examine a class of models in which this asymmetry of meaning is (...) removed. The models of this class permit definitions of the quantifiers which allow a desirable flexibility in fixing the domain of quantification. Certain SFOLω type restrictions are thereby avoided. The resulting models of English validate all of the standard first-order logical truths and are free of the four deficiencies of SFOLω models. (shrink)

Generalized quantifiers are functions from pairs of properties to truth-values; these functions can be used to interpret natural language quantifiers. The space of such functions is vast and a great deal of research has sought to find natural constraints on the functions that interpret determiners and create quantifiers. These constraints have demonstrated that quantifiers rest on number and number sense. In the first part of the paper, we turn to developing this argument. In the remainder, we report on work in (...) neurobiology that test the empirical claims of the theory. In particular, we look at fMRI experiments and behavioral experiments with various patient populations that support the intimate connection between natural language quantification and number sense. (shrink)

There is a prominent line of work in natural language semantics, rooted in the work of Hamblin, in which the meaning of a sentence is not taken to be a single proposition, but rather a set of propositions—a set of alternatives. This allows for a more fine-grained view on meaning, which has led to improved analyses of a wide range of linguistic phenomena. However, this approach also faces a number of problems. We focus here on two of these, in our (...) view the most fundamental ones. The first has to do with how meanings are composed, i.e., with the type-theoretic operations of function application and abstraction; the second has to do with how meanings are compared, i.e., the notion of entailment. Our aim is to reconcile what we take to be the essence of Hamblin’s proposal with the more orthodox type-theoretic framework rooted in the work of Montague in such a way that both the explanatory utility of the former and the solid formal foundations of the latter are preserved. Our proposal builds on insights from recent work on inquisitive semantics, and it also contributes to the further development of this framework by specifying how the inquisitive meaning of a sentence may be built up compositionally. (shrink)

We present a Revised Projectivity Calculus that extends the scope of inclusion and exclusion inferences derivable under the Projectivity Calculus developed by Icard :705–725, 2012). After pointing out the inadequacies of C, we introduce four opposition properties which have been studied by Chow Proceedings of the 18th Amsterdam Colloquium, Springer, Berlin, 2012; Beziau, Georgiorgakis New dimensions of the square of opposition, Philosophia Verlag GmbH, München, 2017) and are more appropriate for the study of exclusion reasoning. Together with the monotonicity properties, (...) the OPs will form the basis of RC instead of the additive/multiplicative properties used in C. We also prove some important results of the OPs and their relation with the MPs. We then introduce a set of projectivity signatures together with the associated operations and conditions for valid inferences, and develop RC by inheriting the key features of C. We then show that under RC, we can derive some inferences that are not derivable under C. We finally discuss some properties of RC and point to possible directions of further studies. (shrink)

It is arguably desirable to have a theory of meaning that (i) does not identify propositions with sets of worlds, (ii) enables to capture the dynamic character of semantic interpretation and (iii) provides the basis for a semantic program that incorporates and extends the achievements of Montague semantics. A theory of properties and propositions that meets these desiderata is developed and several applications to the semantic analysis of natural languages are explored.

In this paper we adopt the hypothesis that languages are mechanisms for interaction, and that grammars encode the means by which such interaction may take place, by use of procedures that construct representations of meaning from strings of words uttered in context, and conversely strings of words are built up from representations of content in interaction with context. In a review of the systemic use of ellipsis in dialogue and associated split-utterance phenomena, we show how, in Dynamic Syntax, words give (...) rise to a range of procedures for the building of representations of the content of some utterance, which both speakers and hearers use. We then extend the discussion to take account of adjuncts, showing how they contribute to content construction both in single utterances and across speakers. The same mechanisms are then shown to underlie the building of inferential extensions of meaning in context, giving rise to the creation of the ad hoc concepts expressed by phrases or single words in relation to the utterance context and ultimately to the creation of metaphorical uses of language. (shrink)

We provide an algorithm for determining a categorial grammar from linguistic data that essentially uses unification of type-schemes assigned to atoms. The algorithm presented here extends an earlier one restricted to rigid categorial grammars, introduced in [4] and [5], by admitting non-rigid outputs. The key innovation is the notion of an optimal unifier, a natural generalization of that of a most general unifier.

The paper presents both new data and a new analysis of the semantic and pragmatic properties of the class of absolute scalar adjectives within an extension of a well-known logical framework for the analysis of gradable predicates: the delineation semantics framework . It has been long observed that the context-sensitivity, vagueness and gradability features of absolute scalar predicates give rise to certain puzzles for their analysis within most, if not all, modern formal semantic frameworks. While there exist proposals for solving (...) these puzzles within other major frameworks , it has been argued that some of their aspects are particularly challenging for the analysis of absolute scalar predicates within the delineation approach. By combining insights into the relationship between context-sensitivity and scalarity from the DelS framework with insights into the relationship between tolerance/similarity relations and the Sorites paradox from Cobreros et al.’s Tolerant, Classical, Strict framework, I propose a new logical system, called Delineation TCS , in which to set analyses of four classes of adjectival predicates. I argue that this new framework allows for an analysis of absolute scalar adjectives that answers these challenges for delineation-based frameworks, while still preserving the heart of the Klein-ian approach. (shrink)

I propose the first strictly compositional semantic account of same. New data, including especially NP-internal uses such as two men with the same name, suggests that same in its basic use is a quantificational element taking scope over nominals. Given type-lifting as a generally available mechanism, I show that this follows naturally from the fact that same is an adjective. Independently-motivated assumptions extend the analysis to standard examples such as Anna and Bill read the same book via a mechanism I (...) call PARASITIC SCOPE, in which the scope of same depends on the scope of some other scopetaking element in the sentence. Although I will initially discuss the analysis in terms of a familiar Quantifier Raising framework, I go on to implement the analysis within an innovative continuation-based Type-Logical Grammar. The empirical payoff for dealing in continuations is that a simple generalization of the basic analysis gives the first ever formal account of cases in which same distributes over objects other than NP denotations, as in the relevant interpretation of John hit and killed the same man. (shrink)

The exclusive component of unembedded disjunctions is standardly derived as a conversational implicature by assuming that or forms a lexical scale with and. It is well known, however, that this assumption does not suffice to determine the required scalar competitors of disjunctions with more than two atomic disjuncts (McCawley, Everything that linguists have always wanted to know about logic* (But were ashamed to ask). Chicago University Press, Chicago, 1993, p. 324; Simons, “Or”: Issues in the semantics and pragmatics of disjunction. (...) Ph.D. thesis, Cornell University, Ithaca, NY, 1998). To solve this, Sauerland (Linguist Philos 27(3): 367–391, 2004) assumes that or forms a lexical scale with two otherwise unattested silent connectives ( ${\mathbb{L}}$ and ${\mathbb{R}}$ ) that retrieve the left and right terms of a disjunction. A number of recent works have proposed an Alternative Semantics for indefinites and disjunction to account for their interaction with modals and other propositional operators (Kratzer and Shimoyama, In: Otsu Y (ed) The Proceedings of the Third Tokyo Conference on Psycholinguistics. Hituzi Syobo, Tokyo, pp. 1–25, 2002; Aloni, In: Weisgerber M (ed) Proceedings of the Conference “SuB7—Sinn und Bedeutung”. Arbeitspapier Nr. 114. Konstanz, pp. 28–37, 2003; Simons, Nat Lang Semantics 13: 271–316, 2005; Alonso-Ovalle, Disjunction in alternative semantics. Ph.D. thesis, University of Massachusetts, Amherst, MA, 2006). We note that the McCawley–Simons problem does not arise in an Alternative Semantics, if we assume that the set of pragmatic competitors to a disjunction is the closure under intersection of the set of propositions that it denotes. An adaptation of the strengthening mechanism presented in Fox (In: Sauerland U, Stateva P (eds) Presupposition and implicature in compositional semantics. MacMillan, Palgrave, pp. 71–120, 2007) allows for the derivation of the exclusive component of disjunctions with more than two atomic disjuncts without having to rely on the ${\mathbb{L}}$ and ${\mathbb{R}}$ operators. The proposal extends to the case of disjunctions with logically dependent disjuncts. (shrink)

Situation semantics was developed as an alternative to possible worlds semantics. In situation semantics, linguistic expressions are evaluated with respect to partial, rather than complete, worlds. There is no consensus about what situations are, just as there is no consensus about what possible worlds or events are. According to some, situations are structured entities consisting of relations and individuals standing in those relations. According to others, situations are particulars. In spite of unresolved foundational issues, the partiality provided by situation semantics (...) has led to some genuinely new approaches to a variety of phenomena in natural language semantics. In the way of illustration, this article includes relatively detailed overviews of a few selected areas where situation semantics has been successful: implicit quantifier domain restrictions, donkey pronouns, and exhaustive interpretations. It moreover addresses the question of how Davidsonian event semantics can be embedded in a semantics based on situations. Other areas where a situation semantics perspective has led to progress include attitude ascriptions, questions, tense, aspect, nominalizations, implicit arguments, point of view, counterfactual conditionals, and discourse relations. (shrink)

Formal semantic analyses often take words to be minimal building blocks for the purposes of compositionality. But various recent theories of morphology and syntax have converged on the view that there is no demarcation line corresponding to the word level. The same conclusion has emerged from the compositional semantics of superlatives. In the spirit of extending compositionality below the word level, this paper explores how a small set of particles (Japanese KA and MO, Chinese DOU, and Hungarian VALA/VAGY, MIND, and (...) IS) form quantifier words and serve as connectives, additive and scalar particles, question markers, and existential verbs. The main question is whether the meanings of these particles across the varied environments are highly regular, or they are lexicalized with a variety of different meanings that bear a family resemblance. This paper does not reach definitive conclusions, but it raises analytical possibilities using Boolean semantics and the semantics of alternatives. It also draws attention to systematic similarities and some differences between MO and DOU that have not been studied in the literature. (shrink)

In this paper I inquire into the methodological status of one of the arguments that have figured prominently in contemporary debates about the semantics of a variety of expressions, the so-called “Binding Argument”. My inquiry is limited to the case of meteorological sentences like “It is raining”, but my conclusion can be extended to other types of sentences as well. Following Jason Stanley, I distinguish between three interpretations of the argument. My focus is on the third, weakest interpretation, according to (...) which postulating variables for locations in the logical form of meteorological sentences is the best available explanation of the binding phenomena that such sentences give rise to. My aim is to show that even in this weak interpretation, the argument cannot be reasonably taken to hold. I accomplish this by showcasing several alternative ways to account for the binding data that have not been, as of yet, ruled out as flawed. (shrink)