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.

W. J. Blok and Don Pigozzi set out to try to answer the question of what it means for a logic to have algebraic semantics. In this seminal book they transformed the study of algebraic logic by giving a general framework for the study of logics by algebraic means. The Dutch mathematician W. J. Blok (1947-2003) received his doctorate from the University of Amsterdam in 1979 and was Professor of Mathematics at the University of Illinois, Chicago until his death in (...) an automobile accident. Don Pigozzi (1935- ) grew up in Oakland, California, received his doctorate from the University of California, Berkeley in 1970, and was Professor of Mathematics at Iowa State University until his retirement in 2002. The Advanced Reasoning Forum is pleased to make available in its Classic Reprints series this exact reproduction of the 1989 text, with a new errata sheet prepared by Don Pigozzi. (shrink)

The general aim of this book is to provide an elementary exposition of some basic concepts in terms of which both classical and non-dassicallogirs may be studied and appraised. Although quantificational logic is dealt with briefly in the last chapter, the discussion is chiefly concemed with propo gjtional cakuli. Still, the subject, as it stands today, cannot br covered in one book of reasonable length. Rather than to try to include in the volume as much as possible, I have put (...) emphasis on some selected topics. Even these could not be roverrd completely, but for each topic I have attempted to present a detailed and precise t’Xposition of several basic results including some which are non-trivial. The roots of some of the central ideas in the volume go back to J. Luka siewicz’s seminar on mathematicallogi. (shrink)

"One of the most careful and intensive among the introductory texts that can be used with a wide range of students. It builds remarkably sophisticated technical skills, a good sense of the nature of a formal system, and a solid and extensive background for more advanced work in logic.... The emphasis throughout is on natural deduction derivations, and the text's deductive systems are its greatest strength. Lemmon's unusual procedure of presenting derivations before truth tables is very effective." --Sarah Stebbins, The (...) Journal of Symbolic Logic. (shrink)

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)

For a novice this book is a mathematically-oriented introduction to modal logic, the discipline within mathematical logic studying mathematical models of reasoning which involve various kinds of modal operators. It starts with very fundamental concepts and gradually proceeds to the front line of current research, introducing in full details the modern semantic and algebraic apparatus and covering practically all classical results in the field. It contains both numerous exercises and open problems, and presupposes only minimal knowledge in mathematics. A specialist (...) can use the book as a source of references. Results and methods of many directions in propositional modal logic, from completeness and duality to algorithmic problems, are collected and systematically presented in one volume. (shrink)

The logics of the modal operators and of the quantifiers show striking analogies. The analogies are so extensive that, when a special class of entities (possible worlds) is postulated, natural and non-arbitrary translation procedures can be defined from the language with the modal operators into a purely quantificational one, under which the necessity and possibility operators translate into universal and existential quantifiers. In view of this I would be willing to classify the modal operators as ‘disguised’ quantifiers, and I think (...) that wholehearted acceptance of modal language should be considered to carry ontological commitment to something like possible worldsConsidered as two languages for describing the same subject matter, modal and purely quantificational languages show interesting differences. The operator variables of the purely quantificational languages give them more power than the modal languages, but at least some of the functions performed by the apparatus of operator variables are also performed, in a more primitive and less versatile way, by actuality operators in modal languages.A final note. Quine has written much on the inter-relations of quantifiers, identity, and the concept of existence. These, he holds, form a tightly knit conceptual system which has been evolved to a high point of perfection, but which might conceivably change yet further.29 He has also dropped hints about the possibility of a simpler, primitive or defective version of the system, in which the quantifiers are not backed up in their accustomed way by the concept of identity. He has dubbed the resulting concept a ‘pre-individuative’ concept of existence, or a concept of ‘entity without identity.’ What would a pre-individuative concept of existence be like? Quine has sometimes suggested that one might be embodied in the use of mass nouns, but the identity concept is used in connection with stuff as well as with things: “is that the same coffee that was in the cup last night?” I would submit that modality provides a better case. In view of the comparative weakness of modal languages, compared to the explicitly quantificational ones Quine takes as canonical, there is surely a sense in which the concept of existence embodied in that disguised existential quantifier, the possibility operator, is a defective one. And as we have seen, one of the differences between modal operators and explicit quantifiers is that modal operators cannot be joined with the identity predicate in the way quantifiers with operator variables can. Surely, then, there is a sense in which ordinary speech, as opposed to the metaphysical theorizing of a Leibniz or a David Lewis, conceives of possible worlds as entities without identity. (shrink)

Only propositional logics are at issue here. Such a logic is contra-classical in a superficial sense if it is not a sublogic of classical logic, and in a deeper sense, if there is no way of translating its connectives, the result of which translation gives a sublogic of classical logic. After some motivating examples, we investigate the incidence of contra-classicality (in the deeper sense) in various logical frameworks. In Sections 3 and 4 we will encounter, originally as an example of (...) what (in Section 2) we call a contra-classical modal logic, an unusual logic boasting a connective (" demi-negation" ) whose double application is equivalent to a single application of the negation connective. Pondering the example points the way to a general characterization of contra-classicality (Theorems 3.3 and 4.6). In an Appendix (Section 5), we look at one alternative to classical logic as the target for such translational assimilation, intuitionistic logic, calling logics which resist the assimilation, in this case, contra- intuitionistic. We will show that one such logic is classical logic itself, thereby strengthening a result of Wojcicki's to the effect that the consequence relation of classical logic cannot be faithfully embedded by any connective-by-connective translation into that of intuitionistic logic. (What the "faithfully" means here is that not only is the translation of anything provable in the 'source' logic.. (shrink)

This paper discusses the general problem of translation functions between logics, given in axiomatic form, and in particular, the problem of determining when two such logics are "synonymous" or "translationally equivalent." We discuss a proposed formal definition of translational equivalence, show why it is reasonable, and also discuss its relation to earlier definitions in the literature. We also give a simple criterion for showing that two modal logics are not translationally equivalent, and apply this to well-known examples. Some philosophical morals (...) are drawn concerning the possibility of having two logical systems that are "empirically distinct" but are both translationally equivalent to a common logic. (shrink)

For the claim that the satisfaction of certain conditions is sufficient for the application of some concept to serve as part of the (`reductive') analysis of that concept, we require the conditions to be specified without employing that very concept. An account of the application conditions of a concept not meeting this requirement, we call analytically circular. For such a claim to be usable in determining the extension of the concept, however, such circularity may not matter, since if the concept (...) figures in a certain kind of intensional context in the specification of the conditions, the satisfaction of those conditions may not itself depend on the extension of the concept. We put this by saying that although analytically circular, the account may yet not be inferentially circular. (shrink)

We present the logic K/2 which is a logic with classical implication and only the left part of classical negation.We show that it is possible to define a classical negation into K/2 and that the classical proposition logic K can be translated into this apparently weaker logic.We use concepts from model-theory in order to characterized rigorously this translation and to understand this paradox. Finally we point out that K/2 appears, following Haack's distinction, both as a deviation and an extension of (...) K. (shrink)

The initial sections of this text deal with syntactical matters such as logical formalism, cut-elimination, and the embedding of intuitionistic logic in classical linear logic. Concluding chapters focus on proofnets for the multiplicative fragment and the algorithmic interpretation of cut-elimination in proofnets.

We present the logic K/2 which is a logic with classical implication and only the left part of classical negation.We show that it is possible to define a classical negation into K/2 and that the classical proposition logic K can be translated into this apparently weaker logic.We use concepts from model-theory in order to characterized rigorously this translation and to understand this paradox. Finally we point out that K/2 appears, following Haack's distinction, both as a deviation and an extension of (...) K. (shrink)

A concept of informational equivalence between relations is explicated to generalize some suggestions by Geach. It is shown that two relations are informationally equivalent if and only if each can be defined in terms of the other without the use of quantifiers. It is shown that there is a general method for listing the ./-place relations informationally equivalent to an arbitrary given /-place relation if and only if i (...) the invariants of the group of invertible quantifier-free definitions, for / =j. Quantifier-free definition is contrasted with general first-order definition by means of an example of two first-order interdefinable relations which are not interdefined by any pair of mutually inverse first-order definitions. (shrink)

Tarski 1968 makes a move in the course of providing an account of ?definitionally equivalent? classes of algebras with a businesslike lack of fanfare and commentary, the significance of which may accordingly be lost on the casual reader. In ?1 we present this move as a response to a certain difficulty in the received account of what it is to define a function symbol (or ?operation symbol?). This difficulty, which presents itself as a minor technicality needing to be got around (...) especially for the case of symbols for zero-place functions (for ?distinguished elements?), has repercussions?not widely recognised?for the account of functional completeness in sentential logic. A similarly stark comment in Church 1956 reveals an appreciation of this difficulty, though not every subsequent author on the topic has taken the point. We fill out this side of the picture in ?2. The discussion of functional completeness in ?2 is supplemented by some remarks on what is involved in defining a connective, which have been included in an Appendix. The emphasis throughout is on conceptual clarification rather than on proving theorems, and the main body of the paper may be regarded as an elaboration on the remarks just mentioned by Tarski and Church. The Appendix (?3) is intended to be similarly clarificatory, though this time with some corrective intent, of remarks made in and about Makinson 1973. (shrink)

We show (1) the consequence determined by a variety V of algebraic semigroup matrices is finitely based iffV is finitely based, (2) the consequence determined by all 2-valued semigroup connectives, Λ, ∨, ↔, +, in other words the collection of common rules for all these connectives, is finitely based. For possible applications see Sect. 0.

We explore a relation we call 'anticipation' between formulas, where A anticipates B (according to some logic) just in case B is a consequence (according to that logic, presumed to support some distinguished implicational connective →) of the formula A → B. We are especially interested in the case in which the logic is intuitionistic (propositional) logic and are much concerned with an extension of that logic with a new connective, written as "a", governed by rules which guarantee that for (...) any formula B, aB is the (logically) strongest formula anticipating B. The investigation of this new logic, which we call ILa, will confront us on several occasions with some of the finer points in the theory of rules and with issues in the philosophy of logic arising from the proposed explication of the existence of a connective (with prescribed logical behaviour) in terms of the conservative extension of a favoured logic by the addition of such a connective. Other points of interest include the provision of a Kripke semantics with respect to which ILa is demonstrably sound, deployed to establish certain unprovability results as well as to forge connections with C. Rauszer's logic of dual intuitionistic negation and dual intuitionistic implication, and the isolation of two relations (between formulas), head-implication and head-linkage, which, though trivial in the setting of classical logic, are of considerable significance in the intuitionistic context. (shrink)