In this paper, we offer a novel analysis of presuppositions, paying particular attention to the interaction between the knowledge resources that are required to The analysis has two main features. First, we capture an analogy between presuppositions, anaphora and scope ambiguity (cf. van der Sandt 1992), by utilizing semantic under-specification (c£ Reyle 1993). Second, resolving this underspecification requires reasoning about how the presupposition is rhetorically connected to the discourse context. This has several consequences. First, since pragmatic information plays a role (...) in computing the rhetorical relation, it also constrains the interpretation of presuppositions. Our account therefore provides a formal framework for analysing problematic data, which require pragmatic reasoning. Second, binding presuppositions to the context via rhetorical links replaces accommodating them, in the sense of adding them to the context (cf. Lewis 1979). The treatment of presupposition is thus generalized and integrated into the discourse update procedure. We formalize this approach in SDRT (Asher 1993; Lascarides & Asher 1993), and demonstrate that it provides a rich framework for interpreting presuppositions, where semantic and pragmatic constraints are integrated. (shrink)

Preface This book is about semantics and logic. More specifically, it is about the semantics and logic of natural language; and, even more specifically than ...

Numerical probabilities are eliminated in favor of qualitative notions, with an eye to isolating what it is about probabilities that is essential to judgements of acceptability. A basic choice point is whether the conjunction of two propositions, each acceptable, must be deemed acceptable. Concepts of acceptability closed under conjunction are analyzed within Keisler's weak logic for generalized quantifiers — or more specifically, filter quantifiers. In a different direction, the notion of a filter is generalized so as to allow sets with (...) probability non-infinitesimally below 1 to be acceptable. (shrink)

Notions of disambiguation supporting a compositional interpretation ofvambiguous expressions and reflecting intuitions about how sentences combinevin discourse are investigated. Expressions are analyzed both inductively byvbreaking them apart, and co-inductively by embedding them within larger contexts.

It is the aim of INDICES to document recent explorations in the various fields of philosophical logic and formal linguistics and their applications in other disciplines. The main emphasis of this series is on self-contained monographs covering particular areas of recent research and surveys of methods, problems, and results in all fields of inquiry where recourse to logical analysis and logical methods has been fruitful. INDICES will contain monographs dealing with the central areas of philosophical logic (extensional and intensional systems, (...) indexical logics, non-classical logics, philosophy of logic, etc.) as well as studies in which these systems are applied to specific issues in philosophy, in the formal semantics of natural languages, the foundations of linguistic theory, in computational linguistics, and in theoretical computer science. Constructive type theory was first presented in 1970, by the Swedish logician Per Martin-Lof. It has become one of the main approaches used in the foundations of mathematics and computer science. But it has remained relatively unknown among linguists and philosophers, although it provides a considerable extension of the concepts and techniques of logic. The book first gives an introduction to type theory from the point of view of linguistics and the philosophy of language. Type theory is then applied in the areas of quantification, anaphora, temporal reference, and the structure of text and discourse. By virtue of the type-theoretical concepts of proof object and context, various phenomena of dependence and progression in language can be discussed in precise terms, and several well-known problems can be solved. A categorial grammar is presented togenerate formally a fragment of English, together with an example of a computer implementation. (shrink)