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

The Taming of the True poses a broad challenge to realist views of meaning and truth that have been prominent in recent philosophy. Neil Tennant argues compellingly that every truth is knowable, and that an effective logical system can be based on this principle. He lays the foundations for global semantic anti-realism and extends its consequences from the philosophy of mathematics and logic to the theory of meaning, metaphysics, and epistemology.

Such a conception, says Dummett, will form "a base camp for an assault on the metaphysical peaks: I have no greater ambition in this book than to set up a base ...

Intuitionism’s disagreement with classical logic is standardly based on its specific understanding of truth. But different intuitionists have actually explicated the notion of truth in fundamentally different ways. These are considered systematically and separately, and evaluated critically. It is argued that each account faces difficult problems. They all either have implausible consequences or are viciously circular.

This paper is an attack on the Dummett-Prawitz view that the principle of bivalence has a crucial double significance, metaphysical and meaning theoretical. On the one hand it is said that holding bivalence valid is what characterizes a realistic view, i.e. a view in metaphysics, and on the other hand it is said that there are meaning theoretical arguments against its acceptability. I argue that these two aspects are incompatible. If the failure of validity of bivalence depends on properties of (...) linguistic meaning, then there are no metaphysical consequences to be drawn. The case for this view is straightforward as long as we are discussing a language different from our own. But it seems that the distinction between failure because of meaning and failure because of reality cannot be applied to our own language, simply because our own language is just what we use to represent reality. I argue that this impression is illusory. In order to draw a conclusion about reality, meaning must be connected with truth in a non-trivial way, and precisely this cannot be done in the language for which the meaning theory itself is correct. (shrink)

Realism concerning a given subject-matter is characterised as a semantic doctrine with metaphysical consequences, namely as the adoption, for the relevant class of statements, of a truth-conditional theory of meaning resting upon the classical two-valued semantics. it is argued that any departure from classical semantics may, though will not necessarily, be seen as in conflict with some variety of realism. a sharp distinction is drawn between the rejection of realism and the acceptance of a reductionist thesis; though intimately related, neither (...) entails the other. realism is to be classified as "naive", "semi-naive" or "sophisticated": the first of these involves an all but unintelligible epistemological component. (shrink)

The knowability paradox is an instance of a remarkable reasoning pattern (actually, a pair of such patterns), in the course of which an occurrence of the possibility operator, the diamond, disappears. In the present paper, it is pointed out how the unwanted disappearance of the diamond may be escaped. The emphasis is not laid on a discussion of the contentious premise of the knowability paradox, namely that all truths are possibly known, but on how from this assumption the conclusion is (...) derived that all truths are, in fact, known. Nevertheless, the solution offered is in the spirit of the constructivist attitude usually maintained by defenders of the anti-realist premise. In order to avoid the paradoxical reasoning, a paraconsistent constructive relevant modal epistemic logic with strong negation is defined semantically. The system is axiomatized and shown to be complete. (shrink)

Consequence is at the heart of logic; an account of consequence, of what follows from what, offers a vital tool in the evaluation of arguments. Since philosophy itself proceeds by way of argument and inference, a clear view of what logical consequence amounts to is of central importance to the whole discipline. In this book JC Beall and Greg Restall present and defend what thay call logical pluralism, the view that there is more than one genuine deductive consequence relation, a (...) position which has profound implications for many linguists as well as for philosophers. We should not search for one true logic, since there are many. (shrink)

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)

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)

A propositional logic of explicit proofs, LP, was introduced in [S. Artemov, Explicit provability and constructive semantics, The Bulletin for Symbolic Logic 7 1–36], completing a project begun long ago by Gödel, [K. Gödel, Vortrag bei Zilsel, translated as Lecture at Zilsel’s in: S. Feferman , Kurt Gödel Collected Works III, 1938, pp. 62–113]. In fact, LP can be looked at in a more general way, as a logic of explicit evidence, and there have been several papers along these lines. (...) A major result about LP is the Realization Theorem, that says any theorem of S4 can be converted into a theorem of LP by some replacement of necessitation symbols with explicit proof terms. Thus the necessitation operator of S4 can be seen as a kind of implicit existential quantifier: there exists a proof term such that…. In this paper, quantification over evidence is introduced into LP, and it is shown that the connection between S4 necessitation and the existential quantifier becomes an explicit one. The extension of LP with quantifiers is called QLP. A semantics and an axiom system for QLP are given, soundness and completeness are established, and several results are proved relating QLP to LP and to S4. (shrink)

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 section 1 we argue that the adoption of a tenseless notion of truth entails a realistic view of propositions and provability. This view, in turn, opens the way to the intelligibility of theclassical meaning of the logical constants, and consequently is incompatible with the antirealism of orthodox intuitionism. In section 2 we show how what we call the potential intuitionistic meaning of the logical constants can be defined, on the one hand, by means of the notion of atemporal provability (...) and, on the other, by means of the operator K of epistemic logic. Intuitionistic logic, as reconstructed within this perspective, turns out to be a part of epistemic logic, so that it loses its traditional foundational role, antithetic to that of classical logic. In section 3 we uphold the view that certain consequences of the adoption of atemporal notion of truth, despite their apparent oddity, are quite acceptable from an antirealist point of view. (shrink)

This is a long-awaited new edition of one of the best known Oxford Logic Guides. The book gives an introduction to intuitionistic mathematics, leading the reader gently through the fundamental mathematical and philosophical concepts. The treatment of various topics, for example Brouwer's proof of the Bar Theorem, valuation systems, and the completeness of intuitionistic first-order logic, have been completely revised.

The term verificationism is used in two different ways: the first is in relation to the verification principle of meaning, which we usually and rightly associate with the logical empiricists, although, as we now know, it derives in reality from Wittgenstein, and the second is in relation to the theory of meaning for intuitionistic logic that has been developed, beginning of course with Brouwer, Heyting and Kolmogorov in the twenties and early thirties, but in much more detail lately, particularly in (...) connection with intuitionistic type theory. It is therefore very natural to ask how these two forms of verificationism are related to one another: was the verificationism that we had in the thirties a kind of forerunner of what we have now, or was it something entirely different? I would like to discuss this question by considering a very particular problem, which was at the heart of Schlick’s interests, namely, the problem whether there might exist undecidable propositions or, if you prefer, unsolvable problems or unanswerable questions: it is merely a matter of wording which of these terms you choose. As I said, it is a problem which was at the heart of Schlick’s interests: it is explicitly discussed already in his early, programmatic paper Die Wende in der Philosophie in the first volume of Erkenntnis from 1930, and there is a short late paper, which has precisely Unanswerable Questions? as its title, from 1935, and he discussed it on several occasions in between also. (shrink)

Perennial philosophers' hopes are unlikely victims of swift, natural deduction. Yet anti-realism has been thought one. Not hoping for anti-realism myself I here show it, lest it be underestimated, to survive the following argument, adapted from W. D.Hart pp. 156, 164-5; he credits first publication to Fitch).

The so-called knowability paradox results from Fitch's argument that if there are any unknown truths, then there are unknowable truths. This threatens recent versions of semantical antirealism, the central thesis of which is that truth is epistemic. When this is taken to mean that all truths are knowable, antirealism is thus committed to the conclusion that no truths are unknown. The correct antirealistic response to the paradox should be to deny that the fundamental thesis of the epistemic nature of truth (...) entails the knowability of all truths. Correctly understood, the antirealistic conditions on a proposition's truth do not require that the proposition possess a verification-procedure which, when executed under the given conditions, issues in an agent's recognition of truth, but merely that there be a verification-procedure which, under these conditions, takes the value true . The knowability paradox and the related idealism problem (that antirealism seems, but is not, committed to the necessary existence of an epistemic agent) draw attention to the fact that certain propositions, those that are about verification-procedures themselves, may under certain conditions take the value true despite their unperformability under these circumstances. Thus these propositions' procedures can only be performed when the propositions are false, and they gain the appearance of antirealistic impossibility (e.g., that there is an unknown truth). This differs from the unperformability that antirealists object to, pertaining merely to matters of execution rather than to the logical structure of the procedures themselves. The force of antirealism's notion of epistemic truth is piecemeal, rather than consisting in a blanket characterization of truth as knowable. (shrink)

We study here extensions of the Artemov's logic of proofs in the language with quantifiers on proof variables. Since the provability operator □ A could be expressed in this language by the formula u[u]A, the corresponding logic naturally extends the well-known modal provability logic GL. Besides, the presence of quantifiers on proofs allows us to study some properties of provability not covered by the propositional logics.In this paper we study the arithmetical complexity of the provability logic with quantifiers on proofs (...) for a given arithmetical theory T and a class of proof predicates.In the last section we define Kripke style semantics for the logics corresponding to the standard Gödel proof predicate and its multiple conclusion version. (shrink)

The language of the basic logic of proofs extends the usual propositional language by forming sentences of the sort x is a proof of F for any sentence F. In this paper a complete axiomatization for the basic logic of proofs in Heyting Arithmetic HA was found.

Wittgenstein's work remains, undeniably, now, that off one of those few philosophers who will be read by all future generations.

The project of antirealism is to construct an assertibility semantics on which (1) the truth of statements obeys a recognition condition so that (2) counterexamples are forthcoming to the law of the excluded third and (3) intuitionistic formal predicate logic is provably sound and complete with respect to the associated notion of validity. Using principles of intuitionistic mathematics and employing only intuitionistically correct inferences, we show that prima facie reasonable formulations of (1), (2), and (3) are inconsistent. Therefore, it should (...) not be assumed that the project of anti-realism as it bears upon intuitionistic mathematics and logic can be accomplished. (shrink)