DOCSLIB.ORG

UC Berkeley UC Berkeley Electronic Theses and Dissertations

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
UC Berkeley UC Berkeley Electronic Theses and Dissertations UC Berkeley UC Berkeley Electronic Theses and Dissertations Title Interactions between computability theory and set theory Permalink https://escholarship.org/uc/item/5hn678b1 Author Schweber, Noah Publication Date 2016 Peer reviewed|Thesis/dissertation eScholarship.org Powered by the California Digital Library University of California Interactions between computability theory and set theory by Noah Schweber A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Mathematics in the Graduate Division of the University of California, Berkeley Committee in charge: Professor Antonio Montalban, Chair Professor Leo Harrington Professor Wesley Holliday Spring 2016 Interactions between computability theory and set theory Copyright 2016 by Noah Schweber i To Emma ii Contents Contents ii 1 Introduction1 1.1 Higher reverse mathematics ........................... 1 1.2 Computability in generic extensions....................... 3 1.3 Further results .................................. 5 2 Higher reverse mathematics, 1/28 2.1 Introduction.................................... 8 2.2 Reverse mathematics beyond type 1....................... 11 2.3 Separating clopen and open determinacy.................... 25 2.4 Conclusion..................................... 38 3 Higher reverse mathematics, 2/2 41 3 3.1 The strength of RCA0 ............................... 41 3.2 Choice principles ................................. 50 4 Computable structures in generic extensions 54 4.1 Introduction.................................... 54 4.2 Generic reducibility................................ 58 4.3 Generic presentability and !2 .......................... 64 4.4 Generically presentable rigid structures..................... 71 5 Expansions and reducts of R 74 5.1 Introduction.................................... 74 ∗ 5.2 Rexp ≡w R ..................................... 77 5.3 Generalizing.................................... 84 5.4 The structure Rint ................................ 86 5.5 Applying the general results........................... 87 5.6 Arbitrary continuous f .............................. 88 6 Notes on structures computing every real 90 6.1 Introduction.................................... 90 iii 6.2 Functions on Cantor space............................ 90 6.3 Ultrafilters..................................... 92 6.4 Degrees of structures computing all reals.................... 94 7 Limit computability and ultrafilters 97 7.1 Introduction.................................... 97 7.2 Basic Properties of δU .............................. 100 7.3 Building Scott sets ................................ 103 7.4 Lowness notions.................................. 105 7.5 Comparing ultrafilters .............................. 110 7.6 Further directions................................. 113 8 Computability theoretic aspects of ordinals 117 8.1 Introduction.................................... 117 8.2 Copying ordinals ................................. 118 8.3 Medvedev degrees of ordinals .......................... 120 Bibliography 126 iv Acknowledgments I am extremely grateful to my advisor, Antonio Montalban. In addition to the excellent supervision he provided to me here in Berkeley | including excellent choices of problems to work on, extensive feedback, and advice about all aspects of mathematical life | he was my teacher in college, and taught my first logic class. I could not ask for nine years of better mentorship. It is of course true that without his help, none of this would have been possible. I am also very grateful to Leo Harrington, Wesley Holliday, Ted Slaman, and John Steel for many insightful conversations and help throughout this process. I also want to thank my co-authors, Uri Andrews, Mingzhong Cai, David Diamondstone, Greg Igusa, Julia Knight, and Antonio Montalban, both for working with me on a variety of interesting problems and for allowing me to include the work we did together in this thesis. I have deeply enjoyed working with all of them, and hope to continue to in the future. There is not enough room here to list all the people who have supported me throughout my time in Berkeley, but I will try to thank a few in particular: Alex Cottrill, Alex Kruckman, Alla Hoffman, Andy Voellmer, Clare Stinchcombe, Dan Ioppolo, Haruka Cowhey, James Walsh, Matthew Harrison-Trainor, Nick Ramsey, Peter Borah. I would also like to thank everyone in the logic community who has helped me reach this point. And I am deeply grateful to my family for supporting me through this process. Finally, I would like to give special thanks to Damir Dzhafarov for addicting me to mathematical logic; without Damir, none of this would have been necessary. 1 Chapter 1 Introduction This thesis explores connections between computability theory and set theory. The bulk of this thesis focuses on extending ideas and techniques from computability theory to higher set-theoretic levels | higher reverse mathematics (chapters 2 and 3) and uncountable com- putable structure theory (chapters 4, 5, and 6). We also look at applications of set theory to computability theory, either by directly answering computability-theoretic questions via set- theoretic considerations (chapter 8) or by bringing set-theoretic constructions into contact with classical computability theory (chapter 7). Finally, we also look at results which stretch from the computability-theoretic to the set-theoretic | specifically, determinacy principles (chapter 2). Below we give a summary of the results in this thesis. Each individual chapter is self- contained, but background knowledge in set theory and computability theory is helpful; we recommend [35] and [13] respectively, whose notation we follow. Small amounts of proof theory (conservative extensions) and basic model theory (o-minimality) appear in chapters 2 and 4, but are covered as needed, and we assume no background outside of a standard introduction to mathematical logic such as [50]. 1.1 Higher reverse mathematics In the first part of this thesis, we look at higher reverse mathematics | roughly speaking, the study of the effective content of theorems of mathematics which cannot easily be expressed in the language of second-order arithmetic. Chapter 1 | which consists of work published as \Transfinite recursion in higher reverse mathematics" [68] | gives an introduction to 3 the subject, introduces a base theory RCA0 for third-order reverse mathematics, and studies analogues of the system ATR0 at higher types. We show, for example, that the comparability 2 of well-orderings of sets of reals is a very weak principle, relatively speaking, and that Σ1- separation for functionals implies clopen determinacy for reals. The main result of chapter 2 is the separation of two determinacy principles. In 1977, John Steel [73] showed that clopen and open determinacy are equivalent over RCA0, despite CHAPTER 1. INTRODUCTION 2 their different computability-theoretic properties (e.g. clopen games have relatively hyper- arithmetic winning strategies); the culprit is the high complexity of the predicate \clopen," 1 which is Π1 complete. We show that once we pass to a context where clopen games are relatively easier to identify, the principles separate: we define clopen and open determinacy principles for games played on R, and construct a model M separating them. 3 Theorem 1.1.1. Over RCA0, clopen determinacy for reals is strictly weaker than open determinacy for reals. The construction of M uses a variation of a notion of forcing with tagged trees introduced by Steel [74]. Leaving aside the technical details, we let G be a certain generic tree, labelled with ordinals. Elements of M are given by names which depend on G in a \bounded" way: for a functional to be in M, we demand that it be the evaluation of some name which respects one of a prescribed family of equivalence relations on the forcing, P, used to produce G. A name ν for a functional respects an equivalence relation ≈ if whenever p ≈ q, r 2 R, and k 2 !, we have p ν(r) = k () q ν(r) = k: In classical Steel forcing, we instead look at functions which are hyperarithmetic relative to G; this has roughly the same effect, but the higher-type analogue of \hyperarithmetic" is not well-behaved, hence our more abstract approach. Of crucial importance is the countable closure of P, which is used to control the second-order part of the model and in the verification that clopen determinacy holds in M, to show that no clopen games of high rank enter M; this has no analogue in classical Steel-forcing arguments. From the proof of Borel determinacy (see [52]), we should expect a connection between Theorem 1.1.1 and determinacy principles for higher Borel levels of games on !. Indeed, Sherwood Hachtman [25] answered a question posed in an early draft of [68] by construct- ing a canonical separating model. Let θ be the least ordinal such that Lθ satisfies \P(!) exists and for every well-founded tree T of height !, there is a map ρ: T ! ON with ρ(x) < ρ(y) whenever x ) y;" Hachtman showed (in the course of his broader analysis of θ) that the structure (!; RLθ ; (!R)Lθ ) also satisfies clopen determinacy for reals but not open determinacy for reals. In chapter e, we present some further results in higher reverse mathematics of a more 3 technical nature. First, we show that RCA0 is a conservative subtheory of Kohlenbach's ! RCA0 . The main technical obstacle in this proof is that the desired term model has to be defined in a slightly subtle way; however, no major difficulties emerge. We then move on to
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.
    [Show full text]
  • Church's Thesis and the Conceptual Analysis of Computability
    Church’s Thesis and the Conceptual Analysis of Computability Michael Rescorla Abstract: Church’s thesis asserts that a number-theoretic function is intuitively computable if and only if it is recursive. A related thesis asserts that Turing’s work yields a conceptual analysis of the intuitive notion of numerical computability. I endorse Church’s thesis, but I argue against the related thesis. I argue that purported conceptual analyses based upon Turing’s work involve a subtle but persistent circularity. Turing machines manipulate syntactic entities. To specify which number-theoretic function a Turing machine computes, we must correlate these syntactic entities with numbers. I argue that, in providing this correlation, we must demand that the correlation itself be computable. Otherwise, the Turing machine will compute uncomputable functions. But if we presuppose the intuitive notion of a computable relation between syntactic entities and numbers, then our analysis of computability is circular.1 §1. Turing machines and number-theoretic functions A Turing machine manipulates syntactic entities: strings consisting of strokes and blanks. I restrict attention to Turing machines that possess two key properties. First, the machine eventually halts when supplied with an input of finitely many adjacent strokes. Second, when the 1 I am greatly indebted to helpful feedback from two anonymous referees from this journal, as well as from: C. Anthony Anderson, Adam Elga, Kevin Falvey, Warren Goldfarb, Richard Heck, Peter Koellner, Oystein Linnebo, Charles Parsons, Gualtiero Piccinini, and Stewart Shapiro. I received extremely helpful comments when I presented earlier versions of this paper at the UCLA Philosophy of Mathematics Workshop, especially from Joseph Almog, D.
    [Show full text]
  • Enumerations of the Kolmogorov Function
    Enumerations of the Kolmogorov Function Richard Beigela Harry Buhrmanb Peter Fejerc Lance Fortnowd Piotr Grabowskie Luc Longpr´ef Andrej Muchnikg Frank Stephanh Leen Torenvlieti Abstract A recursive enumerator for a function h is an algorithm f which enu- merates for an input x finitely many elements including h(x). f is a aEmail: [email protected]. Department of Computer and Information Sciences, Temple University, 1805 North Broad Street, Philadelphia PA 19122, USA. Research per- formed in part at NEC and the Institute for Advanced Study. Supported in part by a State of New Jersey grant and by the National Science Foundation under grants CCR-0049019 and CCR-9877150. bEmail: [email protected]. CWI, Kruislaan 413, 1098SJ Amsterdam, The Netherlands. Partially supported by the EU through the 5th framework program FET. cEmail: [email protected]. Department of Computer Science, University of Mas- sachusetts Boston, Boston, MA 02125, USA. dEmail: [email protected]. Department of Computer Science, University of Chicago, 1100 East 58th Street, Chicago, IL 60637, USA. Research performed in part at NEC Research Institute. eEmail: [email protected]. Institut f¨ur Informatik, Im Neuenheimer Feld 294, 69120 Heidelberg, Germany. fEmail: [email protected]. Computer Science Department, UTEP, El Paso, TX 79968, USA. gEmail: [email protected]. Institute of New Techologies, Nizhnyaya Radi- shevskaya, 10, Moscow, 109004, Russia. The work was partially supported by Russian Foundation for Basic Research (grants N 04-01-00427, N 02-01-22001) and Council on Grants for Scientific Schools. hEmail: [email protected]. School of Computing and Department of Mathe- matics, National University of Singapore, 3 Science Drive 2, Singapore 117543, Republic of Singapore.
    [Show full text]
  • The Cyber Entscheidungsproblem: Or Why Cyber Can’T Be Secured and What Military Forces Should Do About It
    THE CYBER ENTSCHEIDUNGSPROBLEM: OR WHY CYBER CAN’T BE SECURED AND WHAT MILITARY FORCES SHOULD DO ABOUT IT Maj F.J.A. Lauzier JCSP 41 PCEMI 41 Exercise Solo Flight Exercice Solo Flight Disclaimer Avertissement Opinions expressed remain those of the author and Les opinons exprimées n’engagent que leurs auteurs do not represent Department of National Defence or et ne reflètent aucunement des politiques du Canadian Forces policy. This paper may not be used Ministère de la Défense nationale ou des Forces without written permission. canadiennes. Ce papier ne peut être reproduit sans autorisation écrite. © Her Majesty the Queen in Right of Canada, as © Sa Majesté la Reine du Chef du Canada, représentée par represented by the Minister of National Defence, 2015. le ministre de la Défense nationale, 2015. CANADIAN FORCES COLLEGE – COLLÈGE DES FORCES CANADIENNES JCSP 41 – PCEMI 41 2014 – 2015 EXERCISE SOLO FLIGHT – EXERCICE SOLO FLIGHT THE CYBER ENTSCHEIDUNGSPROBLEM: OR WHY CYBER CAN’T BE SECURED AND WHAT MILITARY FORCES SHOULD DO ABOUT IT Maj F.J.A. Lauzier “This paper was written by a student “La présente étude a été rédigée par un attending the Canadian Forces College stagiaire du Collège des Forces in fulfilment of one of the requirements canadiennes pour satisfaire à l'une des of the Course of Studies. The paper is a exigences du cours. L'étude est un scholastic document, and thus contains document qui se rapporte au cours et facts and opinions, which the author contient donc des faits et des opinions alone considered appropriate and que seul l'auteur considère appropriés et correct for the subject.
    [Show full text]
  • Arxiv:1804.02439V1
    DATHEMATICS: A META-ISOMORPHIC VERSION OF ‘STANDARD’ MATHEMATICS BASED ON PROPER CLASSES DANNY ARLEN DE JESUS´ GOMEZ-RAM´ ´IREZ ABSTRACT. We show that the (typical) quantitative considerations about proper (as too big) and small classes are just tangential facts regarding the consistency of Zermelo-Fraenkel Set Theory with Choice. Effectively, we will construct a first-order logic theory D-ZFC (Dual theory of ZFC) strictly based on (a particular sub-collection of) proper classes with a corresponding spe- cial membership relation, such that ZFC and D-ZFC are meta-isomorphic frameworks (together with a more general dualization theorem). More specifically, for any standard formal definition, axiom and theorem that can be described and deduced in ZFC, there exists a corresponding ‘dual’ ver- sion in D-ZFC and vice versa. Finally, we prove the meta-fact that (classic) mathematics (i.e. theories grounded on ZFC) and dathematics (i.e. dual theories grounded on D-ZFC) are meta-isomorphic. This shows that proper classes are as suitable (primitive notions) as sets for building a foundational framework for mathematics. Mathematical Subject Classification (2010): 03B10, 03E99 Keywords: proper classes, NBG Set Theory, equiconsistency, meta-isomorphism. INTRODUCTION At the beginning of the twentieth century there was a particular interest among mathematicians and logicians in finding a general, coherent and con- sistent formal framework for mathematics. One of the main reasons for this was the discovery of paradoxes in Cantor’s Naive Set Theory and related sys- tems, e.g., Russell’s, Cantor’s, Burati-Forti’s, Richard’s, Berry’s and Grelling’s paradoxes [12], [4], [14], [3], [6] and [11].
    [Show full text]
  • Theory of Computation
    A Universal Program (4) Theory of Computation Prof. Michael Mascagni Florida State University Department of Computer Science 1 / 33 Recursively Enumerable Sets (4.4) A Universal Program (4) The Parameter Theorem (4.5) Diagonalization, Reducibility, and Rice's Theorem (4.6, 4.7) Enumeration Theorem Definition. We write Wn = fx 2 N j Φ(x; n) #g: Then we have Theorem 4.6. A set B is r.e. if and only if there is an n for which B = Wn. Proof. This is simply by the definition ofΦ( x; n). 2 Note that W0; W1; W2;::: is an enumeration of all r.e. sets. 2 / 33 Recursively Enumerable Sets (4.4) A Universal Program (4) The Parameter Theorem (4.5) Diagonalization, Reducibility, and Rice's Theorem (4.6, 4.7) The Set K Let K = fn 2 N j n 2 Wng: Now n 2 K , Φ(n; n) #, HALT(n; n) This, K is the set of all numbers n such that program number n eventually halts on input n. 3 / 33 Recursively Enumerable Sets (4.4) A Universal Program (4) The Parameter Theorem (4.5) Diagonalization, Reducibility, and Rice's Theorem (4.6, 4.7) K Is r.e. but Not Recursive Theorem 4.7. K is r.e. but not recursive. Proof. By the universality theorem, Φ(n; n) is partially computable, hence K is r.e. If K¯ were also r.e., then by the enumeration theorem, K¯ = Wi for some i. We then arrive at i 2 K , i 2 Wi , i 2 K¯ which is a contradiction.
    [Show full text]
  • Coll041-Endmatter.Pdf
    http://dx.doi.org/10.1090/coll/041 AMERICAN MATHEMATICAL SOCIETY COLLOQUIUM PUBLICATIONS VOLUME 41 A FORMALIZATION OF SET THEORY WITHOUT VARIABLES BY ALFRED TARSKI and STEVEN GIVANT AMERICAN MATHEMATICAL SOCIETY PROVIDENCE, RHODE ISLAND 1985 Mathematics Subject Classification. Primar y 03B; Secondary 03B30 , 03C05, 03E30, 03G15. Library o f Congres s Cataloging-in-Publicatio n Dat a Tarski, Alfred . A formalization o f se t theor y withou t variables . (Colloquium publications , ISS N 0065-9258; v. 41) Bibliography: p. Includes indexes. 1. Se t theory. 2 . Logic , Symboli c an d mathematical . I . Givant, Steve n R . II. Title. III. Series: Colloquium publications (American Mathematical Society) ; v. 41. QA248.T37 198 7 511.3'2 2 86-2216 8 ISBN 0-8218-1041-3 (alk . paper ) Copyright © 198 7 b y th e America n Mathematica l Societ y Reprinted wit h correction s 198 8 All rights reserve d excep t thos e grante d t o th e Unite d State s Governmen t This boo k ma y no t b e reproduce d i n an y for m withou t th e permissio n o f th e publishe r The pape r use d i n thi s boo k i s acid-fre e an d fall s withi n th e guideline s established t o ensur e permanenc e an d durability . @ Contents Section interdependenc e diagram s vii Preface x i Chapter 1 . Th e Formalis m £ o f Predicate Logi c 1 1.1. Preliminarie s 1 1.2.
    [Show full text]
  • Forcing in Proof Theory∗
    Forcing in proof theory¤ Jeremy Avigad November 3, 2004 Abstract Paul Cohen's method of forcing, together with Saul Kripke's related semantics for modal and intuitionistic logic, has had profound e®ects on a number of branches of mathematical logic, from set theory and model theory to constructive and categorical logic. Here, I argue that forcing also has a place in traditional Hilbert-style proof theory, where the goal is to formalize portions of ordinary mathematics in restricted axiomatic theories, and study those theories in constructive or syntactic terms. I will discuss the aspects of forcing that are useful in this respect, and some sample applications. The latter include ways of obtaining conservation re- sults for classical and intuitionistic theories, interpreting classical theories in constructive ones, and constructivizing model-theoretic arguments. 1 Introduction In 1963, Paul Cohen introduced the method of forcing to prove the indepen- dence of both the axiom of choice and the continuum hypothesis from Zermelo- Fraenkel set theory. It was not long before Saul Kripke noted a connection be- tween forcing and his semantics for modal and intuitionistic logic, which had, in turn, appeared in a series of papers between 1959 and 1965. By 1965, Scott and Solovay had rephrased Cohen's forcing construction in terms of Boolean-valued models, foreshadowing deeper algebraic connections between forcing, Kripke se- mantics, and Grothendieck's notion of a topos of sheaves. In particular, Lawvere and Tierney were soon able to recast Cohen's original independence proofs as sheaf constructions.1 It is safe to say that these developments have had a profound impact on most branches of mathematical logic.
    [Show full text]
  • The Strength of Mac Lane Set Theory
    The Strength of Mac Lane Set Theory A. R. D. MATHIAS D´epartement de Math´ematiques et Informatique Universit´e de la R´eunion To Saunders Mac Lane on his ninetieth birthday Abstract AUNDERS MAC LANE has drawn attention many times, particularly in his book Mathematics: Form and S Function, to the system ZBQC of set theory of which the axioms are Extensionality, Null Set, Pairing, Union, Infinity, Power Set, Restricted Separation, Foundation, and Choice, to which system, afforced by the principle, TCo, of Transitive Containment, we shall refer as MAC. His system is naturally related to systems derived from topos-theoretic notions concerning the category of sets, and is, as Mac Lane emphasizes, one that is adequate for much of mathematics. In this paper we show that the consistency strength of Mac Lane's system is not increased by adding the axioms of Kripke{Platek set theory and even the Axiom of Constructibility to Mac Lane's axioms; our method requires a close study of Axiom H, which was proposed by Mitchell; we digress to apply these methods to subsystems of Zermelo set theory Z, and obtain an apparently new proof that Z is not finitely axiomatisable; we study Friedman's strengthening KPP + AC of KP + MAC, and the Forster{Kaye subsystem KF of MAC, and use forcing over ill-founded models and forcing to establish independence results concerning MAC and KPP ; we show, again using ill-founded models, that KPP + V = L proves the consistency of KPP ; turning to systems that are type-theoretic in spirit or in fact, we show by arguments of Coret
    [Show full text]
  • Self-Similarity in the Foundations
    Self-similarity in the Foundations Paul K. Gorbow Thesis submitted for the degree of Ph.D. in Logic, defended on June 14, 2018. Supervisors: Ali Enayat (primary) Peter LeFanu Lumsdaine (secondary) Zachiri McKenzie (secondary) University of Gothenburg Department of Philosophy, Linguistics, and Theory of Science Box 200, 405 30 GOTEBORG,¨ Sweden arXiv:1806.11310v1 [math.LO] 29 Jun 2018 2 Contents 1 Introduction 5 1.1 Introductiontoageneralaudience . ..... 5 1.2 Introduction for logicians . .. 7 2 Tour of the theories considered 11 2.1 PowerKripke-Plateksettheory . .... 11 2.2 Stratifiedsettheory ................................ .. 13 2.3 Categorical semantics and algebraic set theory . ....... 17 3 Motivation 19 3.1 Motivation behind research on embeddings between models of set theory. 19 3.2 Motivation behind stratified algebraic set theory . ...... 20 4 Logic, set theory and non-standard models 23 4.1 Basiclogicandmodeltheory ............................ 23 4.2 Ordertheoryandcategorytheory. ...... 26 4.3 PowerKripke-Plateksettheory . .... 28 4.4 First-order logic and partial satisfaction relations internal to KPP ........ 32 4.5 Zermelo-Fraenkel set theory and G¨odel-Bernays class theory............ 36 4.6 Non-standardmodelsofsettheory . ..... 38 5 Embeddings between models of set theory 47 5.1 Iterated ultrapowers with special self-embeddings . ......... 47 5.2 Embeddingsbetweenmodelsofsettheory . ..... 57 5.3 Characterizations.................................. .. 66 6 Stratified set theory and categorical semantics 73 6.1 Stratifiedsettheoryandclasstheory . ...... 73 6.2 Categoricalsemantics ............................... .. 77 7 Stratified algebraic set theory 85 7.1 Stratifiedcategoriesofclasses . ..... 85 7.2 Interpretation of the Set-theories in the Cat-theories ................ 90 7.3 ThesubtoposofstronglyCantorianobjects . ....... 99 8 Where to go from here? 103 8.1 Category theoretic approach to embeddings between models of settheory .
    [Show full text]
  • The Interplay Between Computability and Incomputability Draft 619.Tex
    The Interplay Between Computability and Incomputability Draft 619.tex Robert I. Soare∗ January 7, 2008 Contents 1 Calculus, Continuity, and Computability 3 1.1 When to Introduce Relative Computability? . 4 1.2 Between Computability and Relative Computability? . 5 1.3 The Development of Relative Computability . 5 1.4 Turing Introduces Relative Computability . 6 1.5 Post Develops Relative Computability . 6 1.6 Relative Computability in Real World Computing . 6 2 Origins of Computability and Incomputability 6 2.1 G¨odel’s Incompleteness Theorem . 8 2.2 Incomputability and Undecidability . 9 2.3 Alonzo Church . 9 2.4 Herbrand-G¨odel Recursive Functions . 10 2.5 Stalemate at Princeton Over Church’s Thesis . 11 2.6 G¨odel’s Thoughts on Church’s Thesis . 11 ∗Parts of this paper were delivered in an address to the conference, Computation and Logic in the Real World, at Siena, Italy, June 18–23, 2007. Keywords: Turing ma- chine, automatic machine, a-machine, Turing oracle machine, o-machine, Alonzo Church, Stephen C. Kleene,klee Alan Turing, Kurt G¨odel, Emil Post, computability, incomputabil- ity, undecidability, Church-Turing Thesis (CTT), Post-Church Second Thesis on relative computability, computable approximations, Limit Lemma, effectively continuous func- tions, computability in analysis, strong reducibilities. 1 3 Turing Breaks the Stalemate 12 3.1 Turing’s Machines and Turing’s Thesis . 12 3.2 G¨odel’s Opinion of Turing’s Work . 13 3.3 Kleene Said About Turing . 14 3.4 Church Said About Turing . 15 3.5 Naming the Church-Turing Thesis . 15 4 Turing Defines Relative Computability 17 4.1 Turing’s Oracle Machines .
    [Show full text]
  • Computable Functions A
    http://dx.doi.org/10.1090/stml/019 STUDENT MATHEMATICAL LIBRARY Volume 19 Computable Functions A. Shen N. K. Vereshchagin Translated by V. N. Dubrovskii #AMS AMERICAN MATHEMATICAL SOCIETY Editorial Board Robert Devaney Carl Pomerance Daniel L. Goroff Hung-Hsi Wu David Bressoud, Chair H. K. BepemarHH, A. Illem* BMHHCJIHMME ^YHKUMM MIIHMO, 1999 Translated from the Russian by V. N. Dubrovskii 2000 Mathematics Subject Classification. Primary 03-01, 03Dxx. Library of Congress Cataloging-in-Publication Data Vereshchagin, Nikolai Konstantinovich, 1958- Computable functions / A. Shen, N.K. Vereshchagin ; translated by V.N. Dubrovskii. p. cm. — (Student mathematical library, ISSN 1520-9121 ; v. 19) Authors' names on t.p. of translation reversed from original. Includes bibliographical references and index. ISBN 0-8218-2732-4 (alk. paper) 1. Computable functions. I. Shen, A. (Alexander), 1958- II. Title. III. Se• ries. QA9.59 .V47 2003 511.3—dc21 2002038567 Copying and reprinting. Individual readers of this publication, and nonprofit libraries acting for them, are permitted to make fair use of the material, such as to copy a chapter for use in teaching or research. Permission is granted to quote brief passages from this publication in reviews, provided the customary acknowledgment of the source is given. Republication, systematic copying, or multiple reproduction of any material in this publication is permitted only under license from the American Mathematical Society. Requests for such permission should be addressed to the Acquisitions Department, American Mathematical Society, 201 Charles Street, Providence, Rhode Island 02904- 2294, USA. Requests can also be made by e-mail to reprint-permissionQams.org. © 2003 by the American Mathematical Society.
    [Show full text]