We discuss presupposition, the phenomenon whereby speakers mark linguistically the information that is presupposed or taken for granted, rather than being part of the main propositional content of a speech act. Expressions and constructions carrying presuppositions are called “presupposition triggers”, forming a large class including definites and factive verbs. The article first introduces the range of triggers, the basic properties of presuppositions such as projection and cancellability, and the diagnostic tests used to identify them. The reader is then introducedto major (...) models of presupposition from the last 50 years, separated into three classes: Frege-Strawson derived semantic models, pragmaticmodels such as that offered by Stalnaker, and dynamic models. Finallywe discuss some of the main current issues in presupposition theory. These involve accommodation, which occurs when a hearer's knowledge state is adjusted to meet the speaker's presuppositions; presupposition failure, which occurs when a presupposition is false; the interaction between presuppositions and attitudes; and the triggering problem, i.e., the problem of explaining why presuppositions occur in the first place. (shrink)

We carry out the Karttunen-Stalnaker pragmatic account of presupposition projection within a state-of-the art version of dynamic epistemic logic. It turns out that the basic projection facts can all be derived from a Gricean maxim ‘be informative’. This sheds light on a recent controversy on the appropriateness of dynamic semantics as a tool for analysing presupposition.

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 ...

Stephen Cole Kleene was one of the greatest logicians of the twentieth century and this book is the influential textbook he wrote to teach the subject to the next generation. It was first published in 1952, some twenty years after the publication of Godel's paper on the incompleteness of arithmetic, which marked, if not the beginning of modern logic. The 1930s was a time of creativity and ferment in the subject, when the notion of computable moved from the realm of (...) philosophical speculation to the realm of science. This was accomplished by the work of Kurt Gode1, Alan Turing, and Alonzo Church, who gave three apparently different precise definitions of computable. When they all turned out to be equivalent, there was a collective realization that this was indeed the right notion. Kleene played a key role in this process. One could say that he was there at the beginning of modern logic. He showed the equivalence of lambda calculus with Turing machines and with Godel's recursion equations, and developed the modern machinery of partial recursive functions. This textbook played an invaluable part in educating the logicians of the present. It played an important role in their own logical education.". (shrink)

Even though it is not very often admitted, partial functions do play a significant role in many practical applications of deduction systems. Kleene has already given a semantic account of partial functions using a three-valued logic decades ago, but there has not been a satisfactory mechanization. Recent years have seen a thorough investigation of the framework of many-valued truth-functional logics. However, strong Kleene logic, where quantification is restricted and therefore not truthfunctional, does not fit the framework directly. We solve this (...) problem by applying recent methods from sorted logics. This paper presents a tableau calculus that combines the proper treatment of partial functions with the efficiency of sorted calculi. (shrink)

By a `denoting phrase' I mean a phrase such as any one of the following: a man, some man, any man, every man, all men, the present King of England, the present King of France, the center of mass of the solar system at the first instant of the twentieth century, the revolution of the earth round the sun, the revolution of the sun round the earth. Thus a phrase is denoting solely in virtue of its form. We may distinguish (...) three cases: (1) A phrase may be denoting, and yet not denote anything; e.g., `the present King of France'. (2) A phrase may denote one definite object; e.g., `the present King of England' denotes a certain man. (3) A phrase may denote ambiguously; e.g. `a man' denotes not many men, but an ambiguous man. The interpretation of such phrases is a matter of considerably difficulty; indeed, it is very hard to frame any theory not susceptible of formal refutation. All the difficulties with which I am acquainted are met, so far as I can discover, by the theory which I am about to explain. (shrink)

By a `denoting phrase' I mean a phrase such as any one of the following: a man, some man, any man, every man, all men, the present King of England, the present King of France, the center of mass of the solar system at the first instant of the twentieth century, the revolution of the earth round the sun, the revolution of the sun round the earth. Thus a phrase is denoting solely in virtue of its form. We may distinguish (...) three cases: (1) A phrase may be denoting, and yet not denote anything; e.g., `the present King of France'. (2) A phrase may denote one definite object; e.g., `the present King of England' denotes a certain man. (3) A phrase may denote ambiguously; e.g. `a man' denotes not many men, but an ambiguous man. The interpretation of such phrases is a matter of considerably difficulty; indeed, it is very hard to frame any theory not susceptible of formal refutation. All the difficulties with which I am acquainted are met, so far as I can discover, by the theory which I am about to explain. (shrink)

his paper presents a unified treatment of the propositional and first-order many-valued logics through the method of tableaux. It is shown that several important results on the proof theory and model theory of those logics can be obtained in a general way. We obtain, in this direction, abstract versions of the completeness theorem, model existence theorem (using a generalization of the classical analytic consistency properties), compactness theorem and Lowenheim-Skolem theorem. The paper is completely self-contained and includes examples of application to (...) particular many-valued formal systems. (shrink)

A notation called sets-as-signs is developed, and then it is demonstrated how it can be used to modify any known inference method to handle many-valued logics. Applications are discussed, both in pure mathematics, and in hardware verification and interval arithmetic. Concludes with a historical overview of activities in many-valued theorem proving. Annotation copyright by Book News, Inc., Portland, OR.

In this paper, I review a number of arguments in favor of treating many of the central cases of presupposition as the result of conversational inference, rather than as lexically specified properties of particular expressions. I then argue that, despite the standard assumption to the contrary, the view of presupposition as constraints on the common ground is not consistent with the provision of a conversational account of particular presuppositional constraints. The argument revolves crucially around the workings of accommodation. I then (...) offer an alternative view of the phenomenon of presupposition, which is compatible with a variety of sources for presuppositions. On the view offered here, presupposition is seen as a property of utterances. I argue that the presuppositions of an utterance are those propositions which an interpreter must take the speaker to accept in order to take the speaker to be fully cooperative, in the Gricean sense. (shrink)

Semantic analysis, – inference on the basis of semantic information and world knowledge – still is largely uncharted territory in dy- (3) namic semantics. It is needed, among other things, for the reconstruction of linguistically unspecified parts of the discourse or for restricting ambiguities introduced by prior analysis processes, i.e.

Even though it is not very often admitted, partial functions do play a significant role in many practical applications of deduction systems. Kleene has already given a semantic account of partial functions using three-valued logic decades ago, but there has not been a satisfactory mechanization. Recent years have seen a thorough investigation of the framework of many-valued truth-functional logics. However, strong Kleene logic, where quantification is restricted and therefore not truthfunctional, does not fit the framework directly. We solve this problem (...) by applying recent methods from sorted logics. This paper presents a resolution calculus that combines the proper treatment of partial functions with the efficiency of sorted calculi. (shrink)

The semantics of everyday language and the semantics..