This book, written by one of the most distinguished of contemporary philosophers of mathematics, is a fully rewritten and updated successor to the author's earlier The Unprovability of Consistency. Its subject is the relation between provability and modal logic, a branch of logic invented by Aristotle but much disparaged by philosophers and virtually ignored by mathematicians. Here it receives its first scientific application since its invention. Modal logic is concerned with the notions of necessity and possibility. What George Boolos does (...) is to show how the concepts, techniques, and methods of modal logic shed brilliant light on the most important logical discovery of the twentieth century: the incompleteness theorems of Kurt Godel and the 'self-referential' sentences constructed in their proof. The book explores the effects of reinterpreting the notions of necessity and possibility to mean provability and consistency. (shrink)

Mainstream and Formal Epistemology provides the first, easily accessible, yet erudite and original analysis of the meeting point between mainstream and formal theories of knowledge. These two strands of thinking have traditionally proceeded in isolation from one another, but in this book, Vincent F. Hendricks brings them together for a systematic comparative treatment. He demonstrates how mainstream and formal epistemology may significantly benefit from one another, paving the way for a new unifying program of 'plethoric' epistemology. His book will both (...) define and further the debate between philosophers from two very different sides of the epistemological spectrum. (shrink)

Epistemic logic has grown from its philosophical beginnings to find diverse applications in computer science, and as a means of reasoning about the knowledge and belief of agents. This book provides a broad introduction to the subject, along with many exercises and their solutions. The authors begin by presenting the necessary apparatus from mathematics and logic, including Kripke semantics and the well-known modal logics K, T, S4 and S5. Then they turn to applications in the context of distributed systems and (...) artificial intelligence. These include the notions of common knowledge, distributed knowledge, explicit and implicit belief, the interplays between knowledge and time, and knowledge and action, as well as a graded (or numerical) variant of the epistemic operators. The authors also discuss extensively the problem of logical omniscience. They cover Halpern & Moses' theory of honest formulas, and they make a digression into the realm of nonmonotonic reasoning and preferential entailment. They discuss Moore's autoepistemic logic, together with Levesque's related logic of "all I know". Furthermore, they show how one can base default and counterfactual reasoning on epistemic logic. Graduate students in philosophy or in computer science, especially those with an interest in AI, will find this book useful. (shrink)

Edmund Gettier is Professor Emeritus at the University of Massachusetts, Amherst. This short piece, published in 1963, seemed to many decisively to refute an otherwise attractive analysis of knowledge. It stimulated a renewed effort, still ongoing, to clarify exactly what knowledge comprises.

Deliberation about what to do in any context requires reasoning about what will or would happen in various alternative situations, including situations that the agent knows will never in fact be realized. In contexts that involve two or more agents who have to take account of each others' deliberation, the counterfactual reasoning may become quite complex. When I deliberate, I have to consider not only what the causal effects would be of alternative choices that I might make, but also what (...) other agents might believe about the potential effects of my choices, and how their alternative possible actions might affect my beliefs. Counterfactual possibilities are implicit in the models that game theorists and decision theorists have developed – in the alternative branches in the trees that model extensive form games and the different cells of the matrices of strategic form representations – but much of the reasoning about those possibilities remains in the informal commentary on and motivation for the models developed. Puzzlement is sometimes expressed by game theorists about the relevance of what happens in a game ‘off the equilibrium path’: of what would happen if what is both true and known by the players to be true were instead false. (shrink)

Equality1 gives rise to challenging questions which are not altogether easy to answer. Is it a relation? A relation between objects, or between names or signs of objects? In my Begriffsschrift I assumed the latter. The reasons which seem to favour this are the following: a = a and a = b are obviously statements of differing cognitive value; a = a holds a priori and, according to Kant, is to be labeled analytic, while statements of the form a = (...) b often contain very valuable extensions of our knowledge and cannot always be established a priori. The discovery that the rising sun is not new every morning, but always the same, was one of the most fertile astronomical discoveries. Even to-day the identification of a small planet or a comet is not always a matter of course. Now if we were to regard equality as a relation between that which the names ‘a’ and ‘b’ designate, it would seem that a = b could not differ from a = a (i.e. provided a = b is true). A relation would thereby be expressed of a thing to itself, and indeed one in which each thing stands to itself but to no other thing. What is intended to be said by a = b seems to be that the signs or names ‘a’ and ‘b’ designate the same thing, so that those signs themselves would be under discussion; a relation between them would be asserted. But this relation would hold between the names or signs only in so far as they named or designated something. It would be mediated by the connexion of each of the two signs with the same designated thing. But this is arbitrary. Nobody can be forbidden to use any arbitrarily producible event or object as a sign for something. In that case the sentence a = b would no longer refer to the subject matter, but only to its mode of designation; we would express no proper knowledge by its means. But in many cases this is just what we want to do. If the sign ‘a’ is distinguished from the sign ‘b’ only as object (here, by means of its shape), not as sign (i.e. not by the manner in which it designates something), the cognitive value of a = a becomes essentially equal to that of a = b, provided a = b is true.. (shrink)

A new semantics is presented for the logic of proofs (LP), [1, 2], based on the intuition that it is a logic of explicit knowledge. This semantics is used to give new proofs of several basic results concerning LP. In particular, the realization of S4 into LP is established in a way that carefully examines and explicates the role of the + operator. Finally connections are made with the conventional approach, via soundness and completeness results.

Nozick analyzes fundamental issues, such as the identity of the self, knowledge and skepticism, free will, the foundations of ethics, and the meaning of life.

This introduction to the basic ideas of structural proof theory contains a thorough discussion and comparison of various types of formalization of first-order logic. Examples are given of several areas of application, namely: the metamathematics of pure first-order logic (intuitionistic as well as classical); the theory of logic programming; category theory; modal logic; linear logic; first-order arithmetic and second-order logic. In each case the aim is to illustrate the methods in relatively simple situations and then apply them elsewhere in much (...) more complex settings. There are numerous exercises throughout the text. In general, the only prerequisite is a standard course in first-order logic, making the book ideal for graduate students and beginning researchers in mathematical logic, theoretical computer science and artificial intelligence. For the new edition, many sections have been rewritten to improve clarity, new sections have been added on cut elimination, and solutions to selected exercises have been included. (shrink)

When philosophers talk about descriptions, usually they have in mind singular definite descriptions such as ‘the finest Greek poet’ or ‘the positive square root of nine’, phrases formed with the definite article ‘the’. English also contains indefinite descriptions such as ‘a fine Greek poet’ or ‘a square root of nine’, phrases formed with the indefinite article ‘a’ (or ‘an’); and demonstrative descriptions (also known as complex demonstratives) such as ‘this Greek poet’ and ‘that tall woman’, formed with the demonstrative articles (...) ‘this’ and ‘that’. Following the custom in philosophy, in this chapter often we use ‘description’ as short for ‘definite description’; and following the custom in linguistics, often we use ‘definite’, ‘indefinite’, and ‘demonstrative’ as shorthand nouns. For the most part we focus on definite and indefinites, although a few words about demonstratives are called for. At the centre of debates about descriptions is the matter of whether they are devices of reference or of predication (simple or higher-order), and much discussion focuses on how various proposals are to be incorporated into broader theories of the semantics of natural language. But philosophical interest goes beyond the confines of linguistics, logic, and the philosophy of language because choices made about the semantics of descriptions have repercussions elsewhere, particularly in epistemology and metaphysics. A simple match of form and meaning appears to fail.1 First, many occurrences of expressions of both forms ‘the φ’ and ‘a φ’ appear to be used to talk about particular individuals. Consider (1). (shrink)

There is an obvious difference between what a term designates and what it means. At least it is obvious that there is a difference. In some way, meaning determines designation, but is not synonymous with it. After all, “the morning star” and “the evening star” both designate the planet Venus, but don't have the same meaning. Intensional logic attempts to study both designation and meaning and investigate the relationships between them.

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)

The recently offered, Purported counter-Examples to justified, True belief analyses of knowledge are looked at with some care and all found to be either incoherent or inconclusive. It is argued that justified, True belief analyses are based on sound insight into the concept of knowledge. The distinction between having been justified in claiming to know something and actually having known it is used in an effort to get the discussion of knowledge back on the right track.

Since Edmund L. Gettier reminded us recently of a certain important inadequacy of the traditional analysis of "S knows that p," several attempts have been made to correct that analysis. In this paper I shall offer still another analysis (or a sketch of an analysis) of "S knows that p," one which will avert Gettier's problem. My concern will be with knowledge of empirical propositions only, since I think that the traditional analysis is adequate for knowledge of nonempirical truths.

In 1933 Godel introduced a calculus of provability (also known as modal logic S4) and left open the question of its exact intended semantics. In this paper we give a solution to this problem. We find the logic LP of propositions and proofs and show that Godel's provability calculus is nothing but the forgetful projection of LP. This also achieves Godel's objective of defining intuitionistic propositional logic Int via classical proofs and provides a Brouwer-Heyting-Kolmogorov style provability semantics for Int which (...) resisted formalization since the early 1930s. LP may be regarded as a unified underlying structure for intuitionistic, modal logics, typed combinatory logic and λ-calculus. (shrink)

The Knowability Paradox purports to show that the controversial but not patently absurd hypothesis that all truths are knowable entails the implausible conclusion that all truths are known. The notoriety of this argument owes to the negative light it appears to cast on the view that there can be no verification-transcendent truths. We argue that it is overly simplistic to formalize the views of contemporary verificationists like Dummett, Prawitz or Martin-Löf using the sort of propositional modal operators which are employed (...) in the original derivation of the Paradox. Instead we propose that the central tenet of verificationism is most accurately formulated as follows: if φ is true, then there exists a proof of φ Building on the work of Artemov (Bull Symb Log 7(1): 1-36, 2001), a system of explicit modal logic with proof quantifiers is introduced to reason about such statements. When the original reasoning of the Paradox is developed in this setting, we reach not a contradiction, but rather the conclusion that there must exist non-constructed proofs. This outcome is evaluated relative to the controversy between Dummett and Prawitz about proof existence and bivalence. (shrink)

Reasoning About Knowledge is the first book to provide a general discussion of approaches to reasoning about knowledge and its applications to distributed ...

The present volume is intended as an all-round introduction to constructivism. Here constructivism is to be understood in the wide sense, and covers in particular Brouwer's intuitionism, Bishop's constructivism and A.A. Markov's constructive recursive mathematics. The ending "-ism" has ideological overtones: "constructive mathematics is the (only) right mathematics"; we hasten, however, to declare that we do not subscribe to this ideology, and that we do not intend to present our material on such a basis.

In den letzten Jahrzehntel! hat sich das Interesse an der Grund­ legung der Mathematik immer gesteigert. Fanden frtiher die wenigen Forscher, die sich emsthaft mit dieser 'Frage beschaftigten, wenig Be­ achtung, heute ist die Teilnahme sowohl von mathematischer wie von philosophischer Seite fast allgemein. Zu diesem Umschwung hat sieher die CANToRSche Mengenlehre, die gleich nach ihrem Entstehen lebhafte Erorterungen tiber ihre Berechtigung hervorrief, den AnstoB gegeben, und besonders die bei riicksichtsloser Durchfiihrung ihrer Grundgedanken auftretenden Widerspriiche zogen die allgemeine Aufmerksamkeit auf (...) sich. Doch ist die bisweUen noch geauBerte Behauptung, der Zweck -der Grundlagenforschung liege in der Beseitigung der Widersprtiche, verfehlt. In philosophischer und in mathematischer Richtung geht diese weit tiber eine solche Zielsetzung hinaus. Philosophisch untersucht man -das Wesen der mathematischen Erkenntnis, ihre Voraussetzungen und Endziele, ihr Verhaltnis zu anderen Wissensgebieten, insbesondere der Physik, und ihre Abgrenzung gegen diese dem lnhalt und der Methode nacho An diese philosophischen Erorterungen schlieBen sich umfangreiche mathematische Untersuchungen tiber den Aufbau der Mathematik aus den philosophisch gegebenen Voraussetzungen und tiber die Struktur der mathematischen Beweisftihrungen. Einzelne Teilgebiete dieser Unter­ suchungen entwickeln sich schon zu selbstandigen Disziplinen, die sich in ihren Methoden und Problemstellungen von der eigentlichen Grund­ lagenforschung unabhangig machen; ein Beispiel eines solchen neuen Zweiges der Mathematik, der sein Entstehen der Grundlagenforschung verdankt, ist die mathematischp. Logik. Allmahlich haben sich drei J. auptrichtungen gebildet, die je einer eigenen Auffassung tiber das Wesen der Mathematik entsprechen undo je zu verschieden gearteten mathematischen Untersuchungen geftihrt haben. (shrink)

The Logic of Proofs realizes the modalities from traditional modal logics with proof polynomials, so an expression □F becomes t:F where t is a proof polynomial representing a proof of or evidence for F. The pioneering work on explicating the modal logic is due to S. Artemov and was extended to several subsystems by V. Brezhnev. In 2000, R. Kuznets presented a algorithm for deducibility in these logics; in the present paper we will show that the deducibility problem is -complete. (...) Both Kuznets’s work and the present results make assumptions on the values of proof constants. (shrink)

This is a book that every enthusiast for Gödel’s proofs of his incompleteness theorems will want to own. It gives an up-to-date account of connections between systems of modal logic and results on provability in formal systems for arithmetic, analysis, and set theory.

The purpose of this survey is twofold: (1) to place some centralthemes of epistemic logic in a general epistemological context,and (2) to outline a new framework for epistemic logic developedjointly with S. Andur Pedersen unifying some key ``mainstream''epistemological concerns with the ``formal'' epistemologicalapparatus.

Most of us think we can always enlarge our knowledge base by accepting things that are entailed by (or logically implied by) things we know. The set of things we know is closed under entailment (or under deduction or logical implication), which means that we know that a given claim is true upon recognizing, and accepting thereby, that it follows from what we know. However, some theorists deny that knowledge is closed under entailment, and the issue remains controversial. The arguments (...) against closure include the following. (shrink)

The logic of single-conclusion proofs () is introduced. It combines the verification property of proofs with the single valuedness of proof predicate and describes the operations on proofs induced by modus ponens rule and proof checking. It is proved that is decidable, sound and complete with respect to arithmetical proof interpretations based on single-valued proof predicates. The application to arithmetical inference rules specification and -admissibility testing is considered. We show that the provability in gives the complete admissibility test for the (...) rules which can be specified by schemes in -language. The test is supplied with the ground proof extraction algorithm which eliminates the admissible rules from a -proof by utilizing the information from the corresponding -proofs. (shrink)