Hilbert’s program was an ambitious and wide-ranging project in the philosophy and foundations of mathematics. In order to “dispose of the foundational questions in mathematics once and for all,” Hilbert proposed a two-pronged approach in 1921: first, classical mathematics should be formalized in axiomatic systems; second, using only restricted, “finitary” means, one should give proofs of the consistency of these axiomatic systems. Although Gödel’s incompleteness theorems show that the program as originally conceived cannot be carried out, it had many partial (...) successes, and generated important advances in logical theory and metatheory, both at the time and since. The article discusses the historical background and development of Hilbert’s program, its philosophical underpinnings and consequences, and its subsequent development and influences since the 1930s. (shrink)

The ability to reason and think in a logical manner forms the basis of learning for most mathematics, computer science, philosophy and logic students. Based on the author's teaching notes at the University of Maryland and aimed at a broad audience, this text covers the fundamental topics in classical logic in an extremely clear, thorough and accurate style that is accessible to all the above. Covering propositional logic, first-order logic, and second-order logic, as well as proof theory, computability theory, and (...) model theory, the text also contains numerous carefully graded exercises and is ideal for a first or refresher course. (shrink)

What is knowledge? I this paper I defend the claim that knowledge is justified true belief by arguing that, contrary to common belief, Gettier cases do not refute it. My defence will be of the anti-luck kind: I will argue that (1) Gettier cases necessarily involve veritic luck, and (2) that a plausible version of reliabilism excludes veritic luck. There is thus a prominent and plausible account of justification according to which Gettier cases do not feature justified beliefs, and therefore, (...) do not present counterexamples to the tripartite analysis. I defend the account of justification against objections, and contrast my defence of the tripartite analysis to similar ones from the literature. I close by considering some implications of this way of thinking about justification and knowledge. (shrink)

This lively introduction to mathematical logic, easily accessible to non-mathematicians, offers an historical survey, coverage of predicate calculus, model theory, Godel’s theorems, computability and recursivefunctions, consistency and independence in axiomatic set theory, and much more. Suggestions for Further Reading. Diagrams.

A notion of feasible function of finite type based on the typed lambda calculus is introduced which generalizes the familiar type 1 polynomial-time functions. An intuitionistic theory IPVω is presented for reasoning about these functions. Interpretations for IPVω are developed both in the style of Kreisel's modified realizability and Gödel's Dialectica interpretation. Applications include alternative proofs for Buss's results concerning the classical first-order system S12 and its intuitionistic counterpart IS12 as well as proofs of some of Buss's conjectures concerning IS12, (...) and a proof that IS12 cannot prove that extended Frege systems are not polynomially bounded. (shrink)

This is a paper for a special issue of Semiotic Studies devoted to Stanislaw Krajewski’s paper. This paper gives some supplementary notes to Krajewski’s on the Anti-Mechanist Arguments based on Gödel’s incompleteness theorem. In Section 3, we give some additional explanations to Section 4–6 in Krajewski’s and classify some misunderstandings of Gödel’s incompleteness theorem related to AntiMechanist Arguments. In Section 4 and 5, we give a more detailed discussion of Gödel’s Disjunctive Thesis, Gödel’s Undemonstrability of Consistency Thesis and the definability (...) of natural numbers as in Section 7–8 in Krajewski’s, describing how recent advances bear on these issues. (shrink)

Available for the first time in 20 years, here is the Rudolf Carnap's famous principle of tolerance by which everyone is free to mix and match the rules of ...

The four authors present their speculations about the future developments of mathematical logic in the twenty-first century. The areas of recursion theory, proof theory and logic for computer science, model theory, and set theory are discussed independently.

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)

Full proofs of the Gödel incompleteness theorems are highly intricate affairs. Much of the intricacy lies in the details of setting up and checking the properties of a coding system representing the syntax of an object language within that same language. These details are seldom illuminating and tend to obscure the core of the argument. For this reason a number of efforts have been made to present the essentials of the proofs of Gödel's theorems without getting mired in syntactic or (...) computational details. One of the most important of these efforts was made by Löb [8] in connection with his analysis of sentences asserting their own provability. Löb formulated three conditions, on the provability predicate in a formal system which are jointly sufficient to yield the Gödel's second incompleteness theorem for it. A key role in Löb's analysis is played by what later became known as the diagonalization or fixed point property of formal systems, a property which had already, in essence, been exploited by Gödel in his original proofs of the incompleteness theorems. The fixed point property plays a central role in Lawvere's [7] category-theoretic account of incompleteness phenomena. (shrink)

There is good reason to suppose that our best physical theories, quantum mechanics and special relativity, are false if taken together and literally. If they are in fact false, then how should they count as providing knowledge of the physical world? One might imagine that, while strictly false, our best physical theories are nevertheless in some sense probably approximately true. This paper presents a notion of local probable approximate truth in terms of descriptive nesting relations between current and subsequent theories. (...) This notion helps explain how false physical theories might nevertheless provide physical knowledge of a variety that is particularly salient to diachronic empirical inquiry. (shrink)

We show that the name “Lucas-Penrose thesis” encompasses several different theses. All these theses refer to extremely vague concepts, and so are either practically meaningless, or obviously false. The arguments for the various theses, in turn, are based on confusions with regard to the meaning of these vague notions, and on unjustified hidden assumptions concerning them. All these observations are true also for all interesting versions of the much weaker thesis known as “Gö- del disjunction”. Our main conclusions are that (...) pure mathematical theorems cannot decide alone any question which is not purely mathematical, and that an argument that cannot be fully formalized cannot be taken as a mathematical proof. (shrink)

A variety of projects in proof theory of relevance to the philosophy of mathematics are surveyed, including Gödel's incompleteness theorems, conservation results, independence results, ordinal analysis, predicativity, reverse mathematics, speed-up results, and provability logics.

The main purpose of this paper is to refute the metaphysicians ‘methodological continuation’ argument supporting epistemic realism in metaphysics. This argument aims to show that scientific realists have to accept that metaphysics is as rationally justified as science given that they both employ inference to the best explanation, i.e. that metaphysics and science are methodologically continuous. I argue that the reasons given by scientific realists as to why inference to the best explanation is reliable in science do not constitute a (...) reason to believe that it is reliable in metaphysics. The justification of IBE in science and the justification of IBE in metaphysics are two distinct issues with only superficial similarities, and one cannot rely on one for the other. This becomes especially clear when one analyses the debate about the legitimacy of IBE that has taken place between realists and empiricists. The metaphysician seeking to piggyback on the realist defense of IBE in science by the methodological continuation argument presupposes that the defense is straightforwardly applicable to metaphysics. I will argue that it is, in fact, not. The favoured defenses of IBE in scientific realism make extensive use of empirical considerations, predictive power and inductive evidence, all of which are paradigmatically absent in the metaphysical context. Furthermore, I argue that the metaphysician, even if the realist would concede to the methodological continuation argument, fails to offer any agreed upon conclusions resulting from its application in metaphysics. As a result, the scientific realist is not committed to believing that there is metaphysical knowledge. (shrink)

This paper develops and refines the suggestion that logical systems are conceptual artefacts that are the outcome of a design-process by exploring how a constructionist epistemology and meta-philosophy can be integrated within the philosophy of logic.

This is a short, modern, and motivated introduction to mathematical logic for upper undergraduate and beginning graduate students in mathematics and computer science. Any mathematician who is interested in getting acquainted with logic and would like to learn Gödel’s incompleteness theorems should find this book particularly useful. The treatment is thoroughly mathematical and prepares students to branch out in several areas of mathematics related to foundations and computability, such as logic, axiomatic set theory, model theory, recursion theory, and computability. In (...) this new edition, many small and large changes have been made throughout the text. The main purpose of this new edition is to provide a healthy first introduction to model theory, which is a very important branch of logic. Topics in the new chapter include ultraproduct of models, elimination of quantifiers, types, applications of types to model theory, and applications to algebra, number theory and geometry. Some proofs, such as the proof of the very important completeness theorem, have been completely rewritten in a more clear and concise manner. The new edition also introduces new topics, such as the notion of elementary class of structures, elementary diagrams, partial elementary maps, homogeneous structures, definability, and many more. (shrink)

A concise yet rigorous introduction to logic and discrete mathematics. This book features a unique combination of comprehensive coverage of logic with a solid exposition of the most important fields of discrete mathematics, presenting material that has been tested and refined by the authors in university courses taught over more than a decade. The chapters on logic - propositional and first-order - provide a robust toolkit for logical reasoning, emphasizing the conceptual understanding of the language and the semantics of classical (...) logic as well as practical applications through the easy to understand and use deductive systems of Semantic Tableaux and Resolution. The chapters on set theory, number theory, combinatorics and graph theory combine the necessary minimum of theory with numerous examples and selected applications. Written in a clear and reader-friendly style, each section ends with an extensive set of exercises, most of them provided with complete solutions which are available in the accompanying solutions manual. Key Features: Suitable for a variety of courses for students in both Mathematics and Computer Science. Extensive, in-depth coverage of classical logic, combined with a solid exposition of a selection of the most important fields of discrete mathematics Concise, clear and uncluttered presentation with numerous examples. Covers some applications including cryptographic systems, discrete probability and network algorithms. Logic and Discrete Mathematics: A Concise Introduction is aimed mainly at undergraduate courses for students in mathematics and computer science, but the book will also be a valuable resource for graduate modules and for self-study. (shrink)

Modest pessimism about philosophical progress is the view that while philosophy may sometimes make some progress, philosophy has made, and can be expected to make, only very little progress (where the extent of philosophical progress is typically judged against progress in the hard sciences). The paper argues against recent attempts to defend this view on the basis of the pervasiveness of disagreement within philosophy. The argument from disagreement for modest pessimism assumes a teleological conception of progress, according to which the (...) attainment of true answers to the big philosophical questions, or knowledge of them, is the primary goal of philosophy. The paper argues that this assumption involves a misconception of the goal of philosophy: if philosophy has a primary goal, its goal is the understanding of philosophical problems rather than knowledge of answers to philosophical questions. Moreover, it is argued that if the primary goal of philosophy is such understanding, then widespread disagreement within philosophy does not indicate that philosophy makes little progress. (shrink)

The Fourth Edition of this long-established text retains all the key features of the previous editions, covering the basic topics of a solid first course in ...

Traditionally, many writers, following Kleene (1952), thought of the Church-Turing thesis as unprovable by its nature but having various strong arguments in its favor, including Turing’s analysis of human computation. More recently, the beauty, power, and obvious fundamental importance of this analysis, what Turing (1936) calls “argument I,” has led some writers to give an almost exclusive emphasis on this argument as the unique justification for the Church-Turing thesis. In this chapter I advocate an alternative justification, essentially presupposed by Turing (...) himself in what he calls “argument II.” The idea is that computation is a special form of mathematical deduction. Assuming the steps of the deduction can be stated in a first order language, the Church-Turing thesis follows as a special case of Gödel’s completeness theorem (first order algorithm theorem). I propose this idea as an alternative foundation for the Church-Turing thesis, both for human and machine computation. Clearly the relevant assumptions are justified for computations presently known. Other issues, such as the significance of Gödel’s 1931 Theorem IX for the Entscheidungsproblem, are discussed along the way. (shrink)

John Barrow is increasingly recognized as one of our most elegant and accomplished science writers, a brilliant commentator on cosmology, mathematics, and modern physics. Barrow now tackles the heady topic of impossibility, in perhaps his strongest book yet. Writing with grace and insight, Barrow argues convincingly that there are limits to human discovery, that there are things that are ultimately unknowable, undoable, or unreachable. He first examines the limits on scientific inquiry imposed by the deficiencies of the human mind: our (...) brain evolved to meet the demands of our immediate environment, Barrow notes, and much that lies outside this small circle may also lie outside our understanding. Barrow investigates practical impossibilities, such as those imposed by complexity, uncomputability, or the finiteness of time, space, and resources. Is the universe finite or infinite? Can information be transmitted faster than the speed of light? The book also examines the deeper theoretical restrictions on our ability to know, including Godel's theorem--which proved that there were things that could not be proved--and Arrow's Impossibility theorem about democratic voting systems. Finally, having explored the limits imposed on us from without, Barrow considers whether there are limits we should impose upon ourselves. For instance, if the secrets of the atom are to be found only by recreating extreme environments at great financial cost, just how much should we devote to that quest? Weaving together this intriguing tapestry, he illuminates some of the most profound questions of science, from the possibility of time travel to the very structure of the universe. (shrink)

Presents German physicist Werner Heisenberg's 1958 text in which he discusses the philosophical implications and social consequences of quantum mechanics and other physical theories.

This book addresses the logical aspects of the foundations of scientific theories. Even though the relevance of formal methods in the study of scientific theories is now widely recognized and regaining prominence, the issues covered here are still not generally discussed in philosophy of science. The authors focus mainly on the role played by the underlying formal apparatuses employed in the construction of the models of scientific theories, relating the discussion with the so-called semantic approach to scientific theories. The book (...) describes the role played by this metamathematical framework in three main aspects: considerations of formal languages employed to axiomatize scientific theories, the role of the axiomatic method itself, and the way set-theoretical structures, which play the role of the models of theories, are developed. The authors also discuss the differences and philosophical relevance of the two basic ways of aximoatizing a scientific theory, namely Patrick Suppes’ set theoretical predicates and the "da Costa and Chuaqui" approach. This book engages with important discussions of the nature of scientific theories and will be a useful resource for researchers and upper-level students working in philosophy of science. (shrink)

Graduate-level historical study is ideal for students intending to specialize in the topic, as well as those who only need a general treatment. Part I discusses traditional and symbolic logic. Part II explores the foundations of mathematics, emphasizing Hilbert’s metamathematics. Part III focuses on the philosophy of mathematics. Each chapter has extensive supplementary notes; a detailed appendix charts modern developments.

8.3 The consistency proof -- 8.4 Applications of the consistency proof -- 8.5 Second-order arithmetic -- Problems -- Chapter 9: Set Theory -- 9.1 Axioms for sets -- 9.2 Development of set theory -- 9.3 Ordinals -- 9.4 Cardinals -- 9.5 Interpretations of set theory -- 9.6 Constructible sets -- 9.7 The axiom of constructibility -- 9.8 Forcing -- 9.9 The independence proofs -- 9.10 Large cardinals -- Problems -- Appendix The Word Problem -- Index.

Aimed at graduate students, research logicians and mathematicians, this much-awaited text covers over 40 years of work on relative classification theory for nonstandard models of arithmetic. The book covers basic isomorphism invariants: families of type realized in a model, lattices of elementary substructures and automorphism groups.

Is there progress in art? The question is one which most people would answer vehemently in the negative without giving it much thought. And yet, how is one to account for changes in artistic style? And what is one to think about modern art, which still seems baffling to many in comparison with traditional figurative art? Suzi Gablik's challenging argument is that art, like science, has a history, order and structure which can be called progressive. Progress, however, is not a (...) question of moral or esthetic improvement but involves a cognitive 'growth' of artistic styles and is related to transformations in modes of thinking. The model used for the argument is based on principles of developmental psychology advanced by the famous and revolutionary Swiss experimental psychologist Jean Piaget. By demonstrating the way in which art is linked with the acquisition of stages of development: increasingly complex perceptual and logical structures lead to mental organizations which are increasingly dominated by scientific, rationalistic and conceptual modes of thinking in contrast to earlier more mystical ones. In this light, an attempt is made to explain the shift in art from figurative or iconic representation, where the image resembles the object to which it refers, towards non-representational art which is abstract and conceptual in organization. Three sections of illustrations demonstrate, through revealing juxtapositions, the course of artistic development from ancient and medieval times, through the Renaissance, to contemporary art. -- from dust jacket. (shrink)

Scientific perspectivism, or perspectival realism, is a view according to which scientific knowledge is neither utterly objective nor independent of the world “as it is”, but always tied to some particular ways of conceptualization and interaction with Nature. In the present paper, I employ Robert Rosen’s concept of the modeling relation for arguing that there are two basic reasons why our knowledge of natural systems is perspectival in this sense. The first of these pertains to the dualism between a system (...) and its environment, which is necessarily imposed by a scientist focusing on the former. The second pertains to the complexity of complex systems; a complex system understood as a system in which different kinds of causal entailments intertwine together. As I discuss in the paper besides developing the argument, perspectivism thus understood ties together several issues ranging from organicism to emergentism and to processual philosophy, and from the ceteris paribus talk of biology to the measurement problem of quantum mechanics. I also discuss Rosen’s relational formalisms as a concrete example of how perspectival epistemology might directly suggest novel strategies and practices of doing theoretical science. (shrink)

We discuss the foundations of constructive mathematics, including recursive mathematics and intuitionism, in relation to classical mathematics. There are connections with the foundations of physics, due to the way in which the different branches of mathematics reflect reality. Many different axioms and their interrelationship are discussed. We show that there is a fundamental problem in BISH (Bishop’s school of constructive mathematics) with regard to its current definition of ‘continuous function’. This problem is closely related to the definition in BISH of (...) ‘locally compact’. Possible approaches to this problem are discussed. Topology seems to be a key to understanding many issues. We offer several new simplifying axioms, which can form bridges between the various branches of constructive mathematics and classical mathematics (‘reuniting the antipodes’). We give a simplification of basic intuitionistic theory, especially with regard to so-called ‘bar induction’. We then plead for a limited number of axiomatic systems, which differentiate between the various branches of mathematics. Finally, in the appendix we offer BISH an elegant topological definition of ‘locally compact’, which unlike the current definition is equivalent to the usual classical and/or intuitionistic definition in classical and intuitionistic mathematics, respectively. (shrink)

We argue that thinking of the man-machine comparison in terms of a contest involves, in a reasonable scenario, a criterion of success that is neutral. This is because we want to avoid a petitio principii. We submit, however, that, by looking at things this way, one makes the most essential human things invisible. Thus, in a sense, the contest approach is self-defeating.

How can we explain the strange behavior of quantum and relativistic entities? Why do they behave in ways that defy our intuition about how physical entities should behave, considering our ordinary experience of the world around us? In this article, we address these questions by showing that the comportment of quantum and relativistic entities is not that strange after all, if we only consider what their nature might possibly be: not an objectual one, but a conceptual one. This not in (...) the sense that quantum and relativistic entities would be human concepts, but in the sense that they would share with the latter a same conceptual nature, similarly to how electromagnetic and sound waves, although very different entities, can share a same undulatory nature. When this hypothesis is adopted, i.e., when a conceptuality interpretation about the deep nature of physical entities is taken seriously, many of the interpretational difficulties disappear and our physical world is back making sense, though our view of it becomes radically different from what our classical prejudice made us believe in the first place. (shrink)

When adopting a sound logical system, reasonings made within this system are correct. The situation with reasonings expressed, at least in part, with natural language is much more ambiguous. One way to be certain of the correctness of these reasonings is to provide a logical model of them. To conclude that a reasoning process is correct we need the logical model to be faithful to the reasoning. In this case, the reasoning inherits, so to speak, the correctness of the logical (...) model. There is a weak link in this procedure, which we call the faithfulness problem: how do we decide that the logical model is faithful to the reasoning that it is supposed to model? That is an issue external to logic, and we do not have rigorous formal methods to make the decision. The purpose of this paper is to expose the faithfulness problem (not to solve it). For that purpose, we will consider two examples, one from the geometrical reasoning in Euclid’s Elements and the other from a study on deductive reasoning in the psychology of reasoning. (shrink)

At the turn of the century, there appeared two comprehensive mathematical systems, which were indeed so vast that it was taken for granted that all mathematics could be decided on the basis of them. However, in 1931, Kurt Gödel surprised the entire mathematical world with his epoch‐making paper which begins with the following startling words: The development of mathematics in the direction of greater precision has led to large areas of it being formalized, so that proofs can be carried out (...) according to a few mechanical rules. The most comprehensive formal systems to date are, on the one hand, the Principia Mathematica of Whitehead and Russell, and, on the other hand the Zermelo‐Fraenkel system of axiomatic set theory. Both systems are so extensive that all methods of proof used in mathematics today can be formalized in them‐i.e., can be reduced to a few axioms and rules of inference. It would seem reasonable, therefore, to surmise that these axioms and rules of inference are sufficient to decide all mathematical questions which can be formulated in the system concerned. In what follows it will be shown that this is not the case, but rather that, in both of the cited systems, there exist relatively simple problems of the theory of ordinary whole numbers which cannot be decided on the basis of the axioms. (shrink)