In this paper it is shown how the DRT (Discourse Representation Theory) treatment of temporal anaphora can be formalized within a version of Montague Semantics that is based on classical type logic.

This paper embeds the core part of Discourse Representation Theory in the classical theory of types plus a few simple axioms that allow the theory to express key facts about variables and assignments on the object level of the logic. It is shown how the embedding can be used to combine core analyses of natural language phenomena in Discourse Representation Theory with analyses that can be obtained in Montague Semantics.

Both definite descriptions and pronouns are often anaphoric; that is, part of their interpretation in context depends on prior linguistic material in the discourse. For example: A student walked in. The student sat down. A student walked in. She sat down. One popular view of anaphoric pronouns, the d-type view, is that pronouns like ‘she’ go proxy for definite descriptions like ‘the student who walked in’, which are in turn treated in a classical Russellian or Fregean fashion. I argue for (...) a novel version of the d-type view in which anaphoric definites are restricted existential quantifiers that presuppose discourse uniqueness, which is uniqueness of discourse referent in the context, rather than uniqueness of object in the world. In other words, the anaphoric definites ‘the student’ and ‘she’ in and presuppose that there is a single object under discussion that is a student who walked in. I further argue that, by contrast, non-anaphoric definites are restricted existential quantifiers that presuppose worldly uniqueness, that is, that there is a unique object in the world that satisfies the descriptive information. The semantics for anaphoric and non-anaphoric definites accounts for the differences in truth conditions in discourses involving the two different types of definites, improving on existing accounts. It is further supported by crosslinguistic data. The semantics is formally implemented in a static system employing quantifier domain restriction in the style of Stanley and Szabo :219–261, 2000) and extended to account for bridging definites and donkey sentences. (shrink)

One of the central questions of discourse dynamics is when an anaphoric pronoun is licensed. This paper addresses this question as it pertains to the complex data involving anaphora and negation. It is commonly held that negation blocks anaphoric potential, for example, we cannot say “Bill doesn’t have a car. It is black”. However, there are many exceptions to this generalization. This paper examines a variety of types of discourses in which anaphora on indefinites under the scope of negation is (...) felicitous. These cases are not just of intrinsic interest, but I argue present serious problems for the dynamic semantic framework, which builds the licensing facts into the semantics. I argue in favor of adopting a dynamic pragmatics, a theory that explains context change through general Gricean principles, and combining it with a static, d-type theory of anaphora, in which pronouns go proxy for definite descriptions. (shrink)

This article focuses on foundational issues in dynamic and static semantics, specifically on what is conceptually at stake between the dynamic framework and the truth-conditional framework, and consequently what kinds of evidence support each framework. The article examines two questions. First, it explores the consequences of taking the proposition as central semantic notion as characteristic of static semantics, and argues that this is not as limiting in accounting for discourse dynamics as many think. Specifically, it explores what it means for (...) a static semantics to incorporate the notion of context change potential in a dynamic pragmatics and denies that this conception of static semantics requires that all updates to the context be eliminative and distributive. Second, it argues that the central difference between the two frameworks is whether semantics or pragmatics accounts for dynamics, and explores what this means for the oft-heard claim that dynamic semantics blurs the semantics/pragmatics distinction. (shrink)

Donkey sentences have existential and universal readings, but they are not often perceived as ambiguous. We extend the pragmatic theory of nonmaximality in plural definites by Križ (2016) to explain how context disambiguates donkey sentences. We propose that the denotations of such sentences produce truth-value gaps — in certain scenarios the sentences are neither true nor false — and demonstrate that Križ’s pragmatic theory fills these gaps to generate the standard judgments of the literature. Building on Muskens’s (1996) Compositional Discourse (...) Representation Theory and on ideas from supervaluation semantics, the semantic analysis defines a general schema for quantification that delivers the required truth-value gaps. Given the independently motivated pragmatic theory of Križ 2016, we argue that mixed readings of donkey sentences require neither plural information states, contra Brasoveanu 2008, 2010, nor error states, contra Champollion 2016, nor singular donkey pronouns with plural referents, contra Krifka 1996, Yoon 1996. We also show that the pragmatic account improves over alternatives like Kanazawa 1994 that attribute the readings of donkey sentences to the monotonicity properties of the embedding quantifier. (shrink)

In this paper we introduce a notion of context for Groenendijk & Stokhof's Dynamic Predicate Logic DPL. We use these contexts to give a characterization of the relations on assignments that can be generated by composition from tests and random resettings in the case that we are working over an infinite domain. These relations are precisely the ones expressible in DPL if we allow ourselves arbitrary tests as a starting point. We discuss some possible extensions of DPL and the way (...) these extensions interact with our notion of context. (shrink)

In the tradition of Denotational Semantics one usually lets program constructs take their denotations in reflexive domains, i.e. in domains where self-application is possible. For the bulk of programming constructs, however, working with reflexive domains is an unnecessary complication. In this paper we shall use the domains of ordinary classical type logic to provide the semantics of a simple programming language containing choice and recursion. We prove that the rule of {\em Scott Induction\/} holds in this new setting, prove soundness (...) of a Hoare calculus relative to our semantics, give a direct calculus ${\cal C}$ on programs, and prove that the denotation of any program $P$ in our semantics is equal to the union of the denotations of all those programs $L$ such that $P$ follows from $L$ in our calculus and $L$ does not contain recursion or choice. (shrink)