Gödel and the Metamathematical Tradition
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
“The Church-Turing “Thesis” As a Special Corollary of Gödel's
“The Church-Turing “Thesis” as a Special Corollary of Gödel’s Completeness Theorem,” in Computability: Turing, Gödel, Church, and Beyond, B. J. Copeland, C. Posy, and O. Shagrir (eds.), MIT Press (Cambridge), 2013, pp. 77-104. Saul A. Kripke This is the published version of the book chapter indicated above, which can be obtained from the publisher at https://mitpress.mit.edu/books/computability. It is reproduced here by permission of the publisher who holds the copyright. © The MIT Press The Church-Turing “ Thesis ” as a Special Corollary of G ö del ’ s 4 Completeness Theorem 1 Saul A. Kripke 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 math- ematical 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 pres- ently known. -
“Gödel's Modernism: on Set-Theoretic Incompleteness,” Revisited
“G¨odel'sModernism: on Set-Theoretic Incompleteness," revisited∗ Mark van Atten and Juliette Kennedy As to problems with the answer Yes or No, the con- viction that they are always decidable remains un- touched by these results. —G¨odel Contents 1 Introduction 1.1 Questions of incompleteness On Friday, November 15, 1940, Kurt G¨odelgave a talk on set theory at Brown University.1 The topic was his recent proof of the consistency of Cantor's Con- tinuum Hypothesis, henceforth CH,2 with the axiomatic system for set theory ZFC.3 His friend from their days in Vienna, Rudolf Carnap, was in the audience, and afterward wrote a note to himself in which he raised a number of questions on incompleteness:4 (Remarks I planned to make, but did not) Discussion on G¨odel'slecture on the Continuum Hypothesis, November 14,5 1940 There seems to be a difference: between the undecidable propo- sitions of the kind of his example [i.e., 1931] and propositions such as the Axiom of Choice, and the Axiom of the Continuum [CH ]. We used to ask: \When these two have been decided, is then everything decided?" (The Poles, Tarski I think, suspected that this would be the case.) Now we know that (on the basis of the usual finitary rules) there will always remain undecided propositions. ∗An earlier version of this paper appeared as ‘G¨odel'smodernism: on set-theoretic incom- pleteness', Graduate Faculty Philosophy Journal, 25(2), 2004, pp.289{349. Erratum facing page of contents in 26(1), 2005. 1 1. Can we nevertheless still ask an analogous question? I.e. -
Turing, Gödel and the Bright Abyss
Turing, Gödel and the “Bright Abyss” Juliet Floyd ! 2/5/2015 9:25 AM Comment [1]: 1. Check phone number okay to use this ong?; Also need 2. ABSTRACT of 1 Introduction 150-200 words and 3. a CONTRIBUTOR bi- ography of up to 100 words! Xxx, J. They have completely forgotten what is a mathematical creation: a vision that decants little by little over months and years, bringing to light the obvious [evident] thing that no one had seen, taking form in an obvious assertion of which no one had dreamed ... and that the first one to come along can then prove in five minutes, using techniques ready to hand [toutes cuites] • A. Grothendiek, Recoltes et Sémailles, 1986 Mathematics: there is that which is taken on faith and that which is proved; there is that which is buried deep inside the heart of the mathematician1 and that which is wholly public; there is intuition and fact and the “bright abyss” in be- tween; there is the raw, one might say, and the cooked. I hold up my hand and I count five fingers. I take it on faith that the mapping from fingers onto numbers is recursive in the sense of the mathematician’s defi- nition of the informal concept, “human calculability following a fixed routine.” I cannot prove the mapping is recursive—there is nothing to prove! Of course, mathematicians can prove many theorems about recursiveness, moving forward, so to speak, once the definition of the concept “recursive” has been isolated. Moving backwards is more difficult and this is as it should be: for how can one possibly hope to prove that a mathematical -
Logic and Proof
Logic and Proof Computer Science Tripos Part IB Lent Term Lawrence C Paulson Computer Laboratory University of Cambridge [email protected] Copyright c 2018 by Lawrence C. Paulson I Logic and Proof 101 Introduction to Logic Logic concerns statements in some language. The language can be natural (English, Latin, . ) or formal. Some statements are true, others false or meaningless. Logic concerns relationships between statements: consistency, entailment, . Logical proofs model human reasoning (supposedly). Lawrence C. Paulson University of Cambridge I Logic and Proof 102 Statements Statements are declarative assertions: Black is the colour of my true love’s hair. They are not greetings, questions or commands: What is the colour of my true love’s hair? I wish my true love had hair. Get a haircut! Lawrence C. Paulson University of Cambridge I Logic and Proof 103 Schematic Statements Now let the variables X, Y, Z, . range over ‘real’ objects Black is the colour of X’s hair. Black is the colour of Y. Z is the colour of Y. Schematic statements can even express questions: What things are black? Lawrence C. Paulson University of Cambridge I Logic and Proof 104 Interpretations and Validity An interpretation maps variables to real objects: The interpretation Y 7 coal satisfies the statement Black is the colour→ of Y. but the interpretation Y 7 strawberries does not! A statement A is valid if→ all interpretations satisfy A. Lawrence C. Paulson University of Cambridge I Logic and Proof 105 Consistency, or Satisfiability A set S of statements is consistent if some interpretation satisfies all elements of S at the same time. -
Satisfiability 6 the Decision Problem 7
Satisfiability Difficult Problems Dealing with SAT Implementation Klaus Sutner Carnegie Mellon University 2020/02/04 Finding Hard Problems 2 Entscheidungsproblem to the Rescue 3 The Entscheidungsproblem is solved when one knows a pro- cedure by which one can decide in a finite number of operations So where would be look for hard problems, something that is eminently whether a given logical expression is generally valid or is satis- decidable but appears to be outside of P? And, we’d like the problem to fiable. The solution of the Entscheidungsproblem is of funda- be practical, not some monster from CRT. mental importance for the theory of all fields, the theorems of which are at all capable of logical development from finitely many The Circuit Value Problem is a good indicator for the right direction: axioms. evaluating Boolean expressions is polynomial time, but relatively difficult D. Hilbert within P. So can we push CVP a little bit to force it outside of P, just a little bit? In a sense, [the Entscheidungsproblem] is the most general Say, up into EXP1? problem of mathematics. J. Herbrand Exploiting Difficulty 4 Scaling Back 5 Herbrand is right, of course. As a research project this sounds like a Taking a clue from CVP, how about asking questions about Boolean fiasco. formulae, rather than first-order? But: we can turn adversity into an asset, and use (some version of) the Probably the most natural question that comes to mind here is Entscheidungsproblem as the epitome of a hard problem. Is ϕ(x1, . , xn) a tautology? The original Entscheidungsproblem would presumable have included arbitrary first-order questions about number theory. -
Solving the Boolean Satisfiability Problem Using the Parallel Paradigm Jury Composition
Philosophæ doctor thesis Hoessen Benoît Solving the Boolean Satisfiability problem using the parallel paradigm Jury composition: PhD director Audemard Gilles Professor at Universit´ed'Artois PhD co-director Jabbour Sa¨ıd Assistant Professor at Universit´ed'Artois PhD co-director Piette C´edric Assistant Professor at Universit´ed'Artois Examiner Simon Laurent Professor at University of Bordeaux Examiner Dequen Gilles Professor at University of Picardie Jules Vernes Katsirelos George Charg´ede recherche at Institut national de la recherche agronomique, Toulouse Abstract This thesis presents different technique to solve the Boolean satisfiability problem using parallel and distributed architec- tures. In order to provide a complete explanation, a careful presentation of the CDCL algorithm is made, followed by the state of the art in this domain. Once presented, two proposi- tions are made. The first one is an improvement on a portfo- lio algorithm, allowing to exchange more data without loosing efficiency. The second is a complete library with its API al- lowing to easily create distributed SAT solver. Keywords: SAT, parallelism, distributed, solver, logic R´esum´e Cette th`ese pr´esente diff´erentes techniques permettant de r´esoudre le probl`eme de satisfaction de formule bool´eenes utilisant le parall´elismeet du calcul distribu´e. Dans le but de fournir une explication la plus compl`ete possible, une pr´esentation d´etaill´ee de l'algorithme CDCL est effectu´ee, suivi d'un ´etatde l'art. De ce point de d´epart,deux pistes sont explor´ees. La premi`ereest une am´eliorationd'un algorithme de type portfolio, permettant d'´echanger plus d'informations sans perte d’efficacit´e. -
Foundations of Mathematics
Foundations of Mathematics November 27, 2017 ii Contents 1 Introduction 1 2 Foundations of Geometry 3 2.1 Introduction . .3 2.2 Axioms of plane geometry . .3 2.3 Non-Euclidean models . .4 2.4 Finite geometries . .5 2.5 Exercises . .6 3 Propositional Logic 9 3.1 The basic definitions . .9 3.2 Disjunctive Normal Form Theorem . 11 3.3 Proofs . 12 3.4 The Soundness Theorem . 19 3.5 The Completeness Theorem . 20 3.6 Completeness, Consistency and Independence . 22 4 Predicate Logic 25 4.1 The Language of Predicate Logic . 25 4.2 Models and Interpretations . 27 4.3 The Deductive Calculus . 29 4.4 Soundness Theorem for Predicate Logic . 33 5 Models for Predicate Logic 37 5.1 Models . 37 5.2 The Completeness Theorem for Predicate Logic . 37 5.3 Consequences of the completeness theorem . 41 5.4 Isomorphism and elementary equivalence . 43 5.5 Axioms and Theories . 47 5.6 Exercises . 48 6 Computability Theory 51 6.1 Introduction and Examples . 51 6.2 Finite State Automata . 52 6.3 Exercises . 55 6.4 Turing Machines . 56 6.5 Recursive Functions . 61 6.6 Exercises . 67 iii iv CONTENTS 7 Decidable and Undecidable Theories 69 7.1 Introduction . 69 7.1.1 Gödel numbering . 69 7.2 Decidable vs. Undecidable Logical Systems . 70 7.3 Decidable Theories . 71 7.4 Gödel’s Incompleteness Theorems . 74 7.5 Exercises . 81 8 Computable Mathematics 83 8.1 Computable Combinatorics . 83 8.2 Computable Analysis . 85 8.2.1 Computable Real Numbers . 85 8.2.2 Computable Real Functions . -
Gödel on Finitism, Constructivity and Hilbert's Program
Lieber Herr Bernays!, Lieber Herr Gödel! Gödel on finitism, constructivity and Hilbert’s program Solomon Feferman 1. Gödel, Bernays, and Hilbert. The correspondence between Paul Bernays and Kurt Gödel is one of the most extensive in the two volumes of Gödel’s collected works devoted to his letters of (primarily) scientific, philosophical and historical interest. It ranges from 1930 to 1975 and deals with a rich body of logical and philosophical issues, including the incompleteness theorems, finitism, constructivity, set theory, the philosophy of mathematics, and post- Kantian philosophy, and contains Gödel’s thoughts on many topics that are not expressed elsewhere. In addition, it testifies to their life-long warm personal relationship. I have given a detailed synopsis of the Bernays Gödel correspondence, with explanatory background, in my introductory note to it in Vol. IV of Gödel’s Collected Works, pp. 41- 79.1 My purpose here is to focus on only one group of interrelated topics from these exchanges, namely the light that ittogether with assorted published and unpublished articles and lectures by Gödelthrows on his perennial preoccupations with the limits of finitism, its relations to constructivity, and the significance of his incompleteness theorems for Hilbert’s program.2 In that connection, this piece has an important subtext, namely the shadow of Hilbert that loomed over Gödel from the beginning to the end of his career. 1 The five volumes of Gödel’s Collected Works (1986-2003) are referred to below, respectively, as CW I, II, III, IV and V. CW I consists of the publications 1929-1936, CW II of the publications 1938-1974, CW III of unpublished essays and letters, CW IV of correspondence A-G, and CW V of correspondence H-Z. -
Project Abstract the Summer Program for Diversity in Logic for Undergraduates Builds Upon the PIKSI Summer Program Model, Focusi
Project Abstract The Summer Program for Diversity in Logic for Undergraduates builds upon the PIKSI Summer Program Model, focusing on Logic, an area in philosophy needing to increase diversity. We request seed funding for the pilot run of the program in May of 2016, when we will offer 12 students the opportunity to explore an exciting research theme in Logic –Paradoxes—receive small-group tutoring in formal techniques, receive mentoring and support for professionalization, experience validation, understanding and advice regarding diversity issues they have encountered –sexism, racism, ableism (and which the students may worry about encountering them in the profession), and develop a sense of community with students and faculty with whom they can identify and, in turn, come to strengthen their own identities. Project Purpose Our goal is to empower students to conceive of themselves as aspiring logicians, philosophers of logic and formal philosophers who belong in our profession. As Audrey Yap has noted, a majority of philosophy majors encounter some logic as a part of their undergraduate curriculum. Increasing diversity in logic is not simply a problem of exposure, but concretely addressing underlying pressures women and minority students experience, particularly stereotype threat and pernicious ideas about “natural aptitude.” (1) These pressures are especially strong in the subfield of logic, where almost no women and minorities have contributed to the research literature until very recently, and women and minorities remain underrepresented to a higher degree than in philosophy more broadly. Women and minorities learning logic can be vulnerable to feeling that a field like logic, that tends to be male and white dominated on the whole, is not welcoming to them. -
Interpreting Gödel: Critical Essays Edited by Juliette Kennedy Frontmatter More Information
Cambridge University Press 978-1-107-00266-1 - Interpreting Gödel: Critical Essays Edited by Juliette Kennedy Frontmatter More information INTERPRETING GÖDEL: CRITICAL ESSAYS The logician Kurt Gödel (1906–1978) published a paper in 1931 formulating what have come to be known as his “incompleteness theorems,” which prove, among other things, that within any formal system with resources sufficient to code arithmetic, questions exist which are neither provable nor disprovable on the basis of the axioms which define the system. These are among the most celebrated results in logic today. In this volume, leading philosophers and mathemat- icians assess important aspects of Gödel’s work on the foundations and philosophy of mathematics. Their essays explore almost every aspect of Godel’s intellectual legacy including his concepts of intu- ition and analyticity, the Completeness Theorem, the set-theoretic multiverse, and the state of mathematical logic today. This ground- breaking volume will be invaluable to students, historians, logicians, and philosophers of mathematics who wish to understand the current thinking on these issues. juliette kennedy is an Associate Professor in the Department of Mathematics and Statistics at the University of Helsinki. © in this web service Cambridge University Press www.cambridge.org Cambridge University Press 978-1-107-00266-1 - Interpreting Gödel: Critical Essays Edited by Juliette Kennedy Frontmatter More information © in this web service Cambridge University Press www.cambridge.org Cambridge University Press 978-1-107-00266-1 - Interpreting Gödel: Critical Essays Edited by Juliette Kennedy Frontmatter More information INTERPRETING GÖDEL Critical Essays edited by JULIETTE KENNEDY University of Helsinki © in this web service Cambridge University Press www.cambridge.org Cambridge University Press 978-1-107-00266-1 - Interpreting Gödel: Critical Essays Edited by Juliette Kennedy Frontmatter More information University Printing House, Cambridge cb2 8bs, United Kingdom Cambridge University Press is part of the University of Cambridge. -
REFLECTIONS on KURT G¨ODEL Hao Wang Bradford Books, the MIT
REFLECTIONS ON KURT GODEL¨ Hao Wang Bradford Books, The MIT Press, second printing, 1988 A review by: Wim Ruitenburg Department of Mathematics, Statistics and Computer Science Marquette University Milwaukee, WI 53233 Except for a few minor corrections this second printing is identical to the first ([Wang 1987]). The book is meant to be a first attempt to consider G’s life and work as a whole within an inclusive context that, except maybe for chapters 6, 10, and 11, is accessible to most thoughtful people. The many personal contacts that W had with G during the later years of G’s life makes him an important source of informa- tion about G, particularly when one realizes that G was a rather private person, was reluctant to publish, and left a wide range of unfinished projects. W decided, for reasons of organization, to separate the private sayings for inclusion in a later book entitled Conversations with Kurt G¨odel. The current volume, less dependent upon unpublished material, is subdivided into three parts. Part I, consisting of chapters 1 through 4, presents facts about G¨odel’s life and work. Chapter 1 contains a discussion of G’s life from the per- spective of his dedication to fundamental theoretical work. W quotes and discusses three documents relevant to G’s life and work. These documents are a letter from G’s brother Dr. Rudolf G¨odel in 1985, in response to an inquiry of W; the Grandjean questionnaire of 1974, a specially designed questionnaire that was answered by G, but never sent; and an evaluation of G’s work, compiled by W and approved by G, on the occasion of G’s receiving an honorary degree from The Rockefeller University in 1972. -
Hilbert's Program Then And
Hilbert’s Program Then and Now Richard Zach Abstract 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 sys- tems. Although G¨odel’s incompleteness theorems show that the program as originally conceived cannot be carried out, it had many partial suc- cesses, and generated important advances in logical theory and meta- theory, both at the time and since. The article discusses the historical background and development of Hilbert’s program, its philosophical un- derpinnings and consequences, and its subsequent development and influ- ences since the 1930s. Keywords: Hilbert’s program, philosophy of mathematics, formal- ism, finitism, proof theory, meta-mathematics, foundations of mathemat- ics, consistency proofs, axiomatic method, instrumentalism. 1 Introduction Hilbert’s program is, in the first instance, a proposal and a research program in the philosophy and foundations of mathematics. It was formulated in the early 1920s by German mathematician David Hilbert (1862–1943), and was pursued by him and his collaborators at the University of G¨ottingen and elsewhere in the 1920s and 1930s. Briefly, Hilbert’s proposal called for a new foundation of mathematics based on two pillars: the axiomatic method, and finitary proof theory. Hilbert thought that by formalizing mathematics in axiomatic systems, and subsequently proving by finitary methods that these systems are consistent (i.e., do not prove contradictions), he could provide a philosophically satisfactory grounding of classical, infinitary mathematics (analysis and set theory).