A respected Harvard logician and philosopher gathers together twenty-nine writings dealing with the foundations of mathematics, Rudolf Carnap, lin-guistics, ...

"A valuable collection both for original source material as well as historical formulations of current problems."-- The Review of Metaphysics "Much more than a mere collection of papers . . . a valuable addition to the literature."-- Mathematics of Computation An anthology of fundamental papers on undecidability and unsolvability by major figures in the field, this classic reference opens with Godel's landmark 1931 paper demonstrating that systems of logic cannot admit proofs of all true assertions of arithmetic. Subsequent papers by (...) Godel, Church, Turing, and Post single out the class of recursive functions as computable by finite algorithms. Additional papers by Church, Turing, and Post cover unsolvable problems from the theory of abstract computing machines, mathematical logic, and algebra, and material by Kleene and Post includes initiation of the classification theory of unsolvable problems. Suitable for graduate and undergraduate courses. 1965 ed. (shrink)

This unique book by Stewart Shapiro looks at a range of philosophical issues and positions concerning mathematics in four comprehensive sections. Part I describes questions and issues about mathematics that have motivated philosophers since the beginning of intellectual history. Part II is an historical survey, discussing the role of mathematics in the thought of such philosophers as Plato, Aristotle, Kant, and Mill. Part III covers the three major positions held throughout the twentieth century: the idea that mathematics is logic (logicism), (...) the view that the essence of mathematics is the rule-governed manipulation of characters (formalism), and a revisionist philosophy that focuses on the mental activity of mathematics (intuitionism). Finally, Part IV brings the reader up-to-date with a look at contemporary developments within the discipline. This sweeping introductory guide to the philosophy of mathematics makes these fascinating concepts accessible to those with little background in either mathematics or philosophy. (shrink)

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.

This book, written by one of philosophy's pre-eminent logicians, argues that many of the basic assumptions common to logic, philosophy of mathematics and metaphysics are in need of change. It is therefore a book of critical importance to logical theory. Jaakko Hintikka proposes a new basic first-order logic and uses it to explore the foundations of mathematics. This new logic enables logicians to express on the first-order level such concepts as equicardinality, infinity, and truth in the same language. The famous (...) impossibility results by Gödel and Tarski that have dominated the field for the last sixty years turn out to be much less significant than has been thought. All of ordinary mathematics can in principle be done on this first-order level, thus dispensing with the existence of sets and other higher-order entities. (shrink)

Stimulating, thought-provoking text by one of the 20th century’s most creative philosophers clearly and discerningly makes accessible such topics as probability, measurement and quantitative language, structure of space, causality and determinism, theoretical laws and concepts and much more. "...the best book available for the intelligent reader who wants to gain some insight into the nature of contemporary philosophy of science."—Choice.

" This is a key book for understanding the effort that a major philosopher has made a large part of his life's work: to naturalize epistemology in the twentieth ...

In this work Dummett discusses, section by section, Frege's masterpiece The Foundations of Arithmetic and Frege's treatment of real numbers in the second volume ...

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 the present day and age, it seems that every constructivist philosopher of mathematics and her brother wants to be known as an intuitionist. In this paper, It will be shown that such a self-identification is in most cases mistaken. For one thing, not any old (or new) constructivism is intuitionism because not any old relevant construction is carried out mentally in intuition, as Brouwer envisaged. (edited).

Poincaré was a persistent critic of logicism. Unlike most critics of logicism, however, he did not focus his attention on the basic laws of the logicists or the question of their genuinely logical status. Instead, he directed his remarks against the place accorded to logical inference in the logicist's conception of mathematical proof. Following Leibniz, traditional logicist dogma (and this is explicit in Frege) has held that reasoning or inference is everywhere the same — that there are no principles of (...) inference specific to a given local topic. Poincaré, a Kantian, disagreed with this. Indeed, he believed that the use of non-logical reasoning was essential to genuinely mathematical reasoning (proof). In this essay, I try to isolate and clarify this idea and to describe the mathematical epistemology which underlies it. Central to this epistemology (which is basically Kantian in orientation, and closely similar to that advocated by Brouwer) is a principle of epistemic conservation which says that knowledge of a given type cannot be extended by means of an inference unless that inference itself constitutes knowledge belonging to the given type. (shrink)

In the presence of chance moves in a semantical game, the existence of pure optimal strategies does not guarantee the existence of winning ones. This fact provides a basis for constructing supervaluational semantical games with a chance move. Additional possibilities of using chance moves in game-theoretical semantics are also discussed.

We discuss the differences between first-order set theory and second-order logic as a foundation for mathematics. We analyse these languages in terms of two levels of formalization. The analysis shows that if second-order logic is understood in its full semantics capable of characterizing categorically central mathematical concepts, it relies entirely on informal reasoning. On the other hand, if it is given a weak semantics, it loses its power in expressing concepts categorically. First-order set theory and second-order logic are not radically (...) different: the latter is a major fragment of the former. (shrink)

The business of mathematics is definition and proof, and its foundations comprise the principles which govern them. Modern mathematics is founded upon set theory. In particular, both the axiomatic method and mathematical logic belong, by their very natures, to the theory of sets. Accordingly, foundational set theory is not, and cannot logically be, an axiomatic theory. Failure to grasp this point leads obly to confusion. The idea of a set is that of an extensional plurality, limited and definite in size, (...) composed of well defined objects.It is the extension of Greek notion of 'number' (arithmos) into Cantor's 'transfinite'. (shrink)

In this paper I argue that category theory ought to be seen as providing the language for mathematical discourse. Against foundational approaches, I argue that there is no need to reduce either the content or structure of mathematical concepts and theories to the constituents of either the universe of sets or the category of categories. I assign category theory the role of organizing what we say about the content and structure of both mathematical concepts and theories. Insofar, then, as the (...) structuralist sees mathematics as talking about structures and their morphology, I contend that category theory furnishes a framework for mathematical structuralism. (shrink)

A formal theory of truth, alternative to tarski's 'orthodox' theory, based on truth-value gaps, is presented. the theory is proposed as a fairly plausible model for natural language and as one which allows rigorous definitions to be given for various intuitive concepts, such as those of 'grounded' and 'paradoxical' sentences.

In game-theoretical semantics, perfectlyclassical rules yield a strong negation thatviolates tertium non datur when informationalindependence is allowed. Contradictorynegation can be introduced only by a metalogicalstipulation, not by game rules. Accordingly, it mayoccur (without further stipulations) onlysentence-initially. The resulting logic (extendedindependence-friendly logic) explains several regularitiesin natural languages, e.g., why contradictory negation is abarrier to anaphase. In natural language, contradictory negationsometimes occurs nevertheless witin the scope of aquantifier. Such sentences require a secondary interpretationresembling the so-called substitutionalinterpretation of quantifiers.This interpretation is sometimes impossible,and (...) it means a step beyond thenormal first-order semantics, not an alternative to it. (shrink)

It is proved in this paper that the positive abstraction scheme is consistent with extensionality only if one drops equality out of the language. The theory obtained is then compared with GPK, a wellknown set theory based on an extended positive comprehension scheme.

Let us assume that you are entrusted by UNESCO with an important task. You are asked to devise a universal logical language, a Begriffsschrift in Frege's sense, which is to serve the purposes of science, business and everyday life. What requirements should such a “conceptual notation” satisfy? There are undoubtedly many relevant desiderata, but here I am focusing on one unmistakable one. In order to be a viable lingua universalis, your language must in any case be capable of representing any (...) possible configuration of dependence and independence between different variables. For if such a configuration is possible in principle, there is no guarantee that it might not one day show up among the natural, human or social phenomena we have to study.But how are dependencies and independencies between variables expressed in our familiar logical notation? Every logician worth his or her truth-table knows the answer. Dependencies between two variables are expressed by dependencies between the quantifiers to which they are bound. For instance, inthe variable y depends on x, while inz depends on x but not on y, while u depends on both x and y.But how is the dependence of a quantifier on another one expressed in familiar logical languages? Obviously by occurring in its scope, indicated by the pair of parentheses following it. But the nesting of scopes is a transitive and antisymmetrical relation which allows branching only in one direction. Hence other kinds of structures of dependence and independence between variables are not representable in the received logical notation. Such previously inexpressible structures form the subject matter of what has been referred to as independence-friendly logic. (shrink)

Three principal varieties of mathematical structuralism are compared: set-theoretic structuralism (‘STS’) using model theory, Shapiro's ante rem structuralism invoking sui generis universals (‘SGS’), and the author's modal-structuralism (‘MS’) invoking logical possibility. Several problems affecting STS are discussed concerning, e.g., multiplicity of universes. SGS overcomes these; but it faces further problems of its own, concerning, e.g., the very intelligibility of purely structural objects and relations. MS, in contrast, overcomes or avoids both sets of problems. Finally, it is argued that the modality (...) of MS or a close cousin appears at crucial junctures in both STS and SGS, so that the above outcome is not obviously tendentious. (shrink)

Category theory and topos theory have been seen as providing a structuralist framework for mathematics autonomous vis-a-vis set theory. It is argued here that these theories require a background logic of relations and substantive assumptions addressing mathematical existence of categories themselves. We propose a synthesis of Bell's many-topoi view and modal-structuralism. Surprisingly, a combination of mereology and plural quantification suffices to describe hypothetical large domains, recovering the Grothendieck method of universes. Both topos theory and set theory can be carried out (...) relative to such domains; puzzles about ‘large categories’ and ‘proper classes’ are handled in a uniform way, by relativization, sustaining insights of Zermelo. (shrink)

For each positive n , two alternative axiomatizations of the theory of strings over n alphabetic characters are presented. One class of axiomatizations derives from Tarski's system of the Wahrheitsbegriff and uses the n characters and concatenation as primitives. The other class involves using n character-prefixing operators as primitives and derives from Hermes' Semiotik. All underlying logics are second order. It is shown that, for each n, the two theories are definitionally equivalent [or synonymous in the sense of deBouvere]. It (...) is further shown that each member of one class is synonymous with each member of the other class; thus that all of the theories are definitionally equivalent with each other and with Peano arithmetic. Categoricity of Peano arithmetic then implies categoricity of each of the above theories. (shrink)

Kripke-style models with two accessibility relations, one intuitionistic and the other modal, are given for analogues of the modal systemK based on Heyting's prepositional logic. It is shown that these two relations can combine with each other in various ways. Soundness and completeness are proved for systems with only the necessity operator, or only the possibility operator, or both. Embeddings in modal systems with several modal operators, based on classical propositional logic, are also considered. This paper lays the ground for (...) an investigation of intuitionistic analogues of systems stronger thanK. A brief survey is given of the existing literature on intuitionistic modal logic. (shrink)

On several occasions I have pointed out that the lesson taught us by recent developments in physics regarding the necessity of a constant extension of the frame of concepts appropriate for the classification of new experiences leads us to a general epistemological attitude which might help us to avoid apparent conceptual difficulties in other fields of science as well. Since, however, the opinion has been expressed from various sides that this attitude would appear to involve a mysticism incompatible with the (...) true spirit of science, I am very glad to use the present opportunity of addressing this assembly of scientists working in quite different fields but united in their striving to find a common ground for our knowledge, to come back to this question, and above all to try to clear up the misunderstandings which have arisen. (shrink)

A precise notion of ‘mathematical structure’ other than that given by model theory may prove fruitful in the philosophy of mathematics. It is shown how the language and methods of category theory provide such a notion, having developed out of a structural approach in modern mathematical practice. As an example, it is then shown how the categorical notion of a topos provides a characterization of ‘logical structure’, and an alternative to the Pregean approach to logic which is continuous with the (...) modern structural approach in mathematics. (shrink)

Using recent results in topos theory, two systems of higher-order logic are shown to be complete with respect to sheaf models over topological spaces- so -called "topological semantics." The first is classical higher-order logic, with relational quantification of finitely high type; the second system is a predicative fragment thereof with quantification over functions between types, but not over arbitrary relations. The second theorem applies to intuitionistic as well as classical logic.

This book concentrates on research done during the last twenty years on the philosophy of quantum mechanics. In particular, the author focuses on three major issues: whether quantum mechanics is an incomplete theory, whether it is non-local, and whether it can be interpreted realistically. Much of the book is concerned with distinguishing various senses in which these questions can be taken, and assessing the bewildering variety of answers philosophers and physicists have given up to now. The book is self-contained in (...) that it presents the necessary parts of the mathematical formalism of quantum mechanics and also covers other interpretative topics, such as the problem of measurement and the uncertainty relations. A considerable portion of the book is based on original arguments presented by the author in lectures and research papers over the past ten years. However, this material is integrated with a broad coverage of most of the recent research in the field, so as to provide a balanced introduction to the whole subject. (shrink)

This is the first elementary book to employ the concept of infinitesimals.

This book introduces an important group of logics that have come to be known under the umbrella term 'susbstructural'. Substructural logics have independently led to significant developments in philosophy, computing and linguistics. _An Introduction to Substrucural Logics_ is the first book to systematically survey the new results and the significant impact that this class of logics has had on a wide range of fields.The following topics are covered: * Proof Theory * Propositional Structures * Frames * Decidability * Coda Both (...) students and professors of philosophy, computing, linguistics, and mathematics will find this to be an important addition to their reading. (shrink)

This influential 1888 publication explained the real numbers, and their construction and properties, from first principles.