DOCSLIB.ORG

Logic Colloquium 2006

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Logic Colloquium 2006 CUUS603-cooper July 11, 2009 8:55 978 0 521 11081 5 Logic Colloquium 2006 The Annual European Meeting of the Association for Symbolic Logic, also known as the Logic Colloquium, is among the most prestigious annual meetings in the field. The current volume, Logic Colloquium 2006, with contributions from plenary speakers and selected special session speakers, contains both expository and research papers by some of the best logicians in the world. The most topical areas of current research are covered: valued fields, Hrushovski constructions (from model theory), algorithmic randomness, relative computability (from computabil- ity theory), strong forcing axioms and cardinal arithmetic, and large cardinals and determinacy (from set theory), as well as foundational topics such as algebraic set theory, reverse mathematics, and unprovability. This volume will be invaluable for experts as well as those interested in an overview of central contemporary themes in mathematical logic. i CUUS603-cooper July 11, 2009 8:55 978 0 521 11081 5 ii CUUS603-cooper July 11, 2009 8:55 978 0 521 11081 5 LECTURE NOTES IN LOGIC A Publication of The Association for Symbolic Logic This series serves researchers, teachers, and students in the field of symbolic logic, broadly interpreted. The aim of the series is to bring publications to the logic community with the least possible delay and to provide rapid dissemina- tion of the latest research. Scientific quality is the overriding criterion by which submissions are evaluated. Editorial Board Anand Pillay, Managing Editor Department of Pure Mathematics, School of Mathematics, University of Leeds Lance Fortnow Department of Computer Science, University of Chicago Shaughan Lavine Department of Philosophy, The University of Arizona Jeremy Avigad Department of Philosophy, Carnegie Mellon University Vladimir Kanovei Institute for Information Transmission Problems, Moscow Steffen Lempp Department of Mathematics, University of Wisconsin See end of book for a list of the books in the series. More information can be found at http://www.aslonline.org/books-lnl.html iii CUUS603-cooper July 11, 2009 8:55 978 0 521 11081 5 iv CUUS603-cooper July 11, 2009 8:55 978 0 521 11081 5 Logic Colloquium 2006 Edited by S. BARRY COOPER University of Leeds HERMAN GEUVERS Radboud University Nijmegen ANAND PILLAY University of Leeds JOUKO VA¨ AN¨ ANEN¨ University of Amsterdam association for symbolic logic v CAMBRIDGE UNIVERSITY PRESS Cambridge, New York, Melbourne, Madrid, Cape Town, Singapore, São Paulo, Delhi, Dubai, Tokyo Cambridge University Press The Edinburgh Building, Cambridge CB2 8RU, UK Published in the United States of America by Cambridge University Press, New York www.cambridge.org Information on this title: www.cambridge.org/9780521110815 © Association for Symbolic Logic 2009 This publication is in copyright. Subject to statutory exception and to the provision of relevant collective licensing agreements, no reproduction of any part may take place without the written permission of Cambridge University Press. First published in print format 2009 ISBN-13 978-0-511-60502-4 eBook (NetLibrary) ISBN-13 978-0-521-11081-5 Hardback Cambridge University Press has no responsibility for the persistence or accuracy of urls for external or third-party internet websites referred to in this publication, and does not guarantee that any content on such websites is, or will remain, accurate or appropriate. CUUS603-cooper July 11, 2009 8:55 978 0 521 11081 5 CONTENTS Introduction .................................................... ix Marat M. Arslanov Definability and elementary equivalence in the Ershov difference hierarchy .................................................... 1 Benno van den Berg and Ieke Moerdijk A unified approach to algebraic set theory . ..................... 18 Andrey Bovykin Brief introduction to unprovability ............................. 38 Venanzio Capretta and Amy P. Felty Higher-order abstract syntax in type theory ...................... 65 Raf Cluckers An introduction to b-minimality................................ 91 Rod Downey The sixth lecture on algorithmic randomness .................... 103 Harvey M. Friedman The inevitability of logical strength: Strict reverse mathematics . 135 Martin Goldstern Applications of logic in algebra: Examples from clone theory . 184 Ehud Hrushovski On finite imaginaries.......................................... 195 Andrew E. M. Lewis Strong minimal covers and a question of Yates: The story so far . 213 Antonio Montalb´an Embeddings into the Turing degrees ............................ 229 Jan Reimann Randomness—beyond Lebesgue measure....................... 247 vii CUUS603-cooper July 11, 2009 8:55 978 0 521 11081 5 viii CONTENTS J. R. Steel The derived model theorem .................................... 280 Boban Veliˇckovi´c Forcing axioms and cardinal arithmetic ......................... 328 Frank O. Wagner Hrushovski’s amalgamation construction........................ 361 CUUS603-cooper July 11, 2009 8:55 978 0 521 11081 5 INTRODUCTION These are the proceedings of the Logic Colloquium 2006, which was held July 27–August 2 at the Radboud University of Nijmegen in the Netherlands. The Logic Colloquium is the annual European conference on logic, orga- nized under the auspices of the Association for Symbolic Logic (ASL). The program of LC2006 consisted of a mixture of tutorials, invited plenary talks, special sessions, and contributed talks. Finally, there was a plenary discussion on G¨odel’s legacy, on the occasion of the 100th birthday of the great logician Kurt G¨odel, moderated by William Tait. The program gave a good overview of the recent research developments in logic. The tutorial speakers were Downey, Moerdijk, and Veliˇckovi´c.The invited plenary speakers were Abramsky, Arslanov, Friedman, Goldstern, Hrushovski, Koenigsmann, Lewis, Montalb´an,Palmgren, Pohlers, Schimmerling, Steel, Tait, and Wagner. The five special sessions were devoted to computability the- ory, computer science logic, model theory, proof theory and type theory, and set theory. For these proceedings we have invited the tutorial and plenary invited speakers—as well as one invited speaker from each of the special sessions—to submit a paper. All papers have been reviewed by independent referees. This has given rise to these proceedings, which give a good overview of the content and breadth of the Logic Colloquium 2006 and of the state of the art in logic at present. The Editors S. Barry Cooper Herman Geuvers Anand Pillay Jouko V¨a¨an¨anen ix CUUS603-cooper July 11, 2009 8:55 978 0 521 11081 5 x DEFINABILITY AND ELEMENTARY EQUIVALENCE IN THE ERSHOV DIFFERENCE HIERARCHY M. M. ARSLANOV Abstract. In this paper we investigate questions of definability and elementary equivalence in the Ershov difference hierarchy. We give a survey of recent results in this area and discuss a number of related open questions. Finally, properties of reducibilities which are intermediate between Turing and truth table reducibilities and which are connected with infinite levels of the Ershov hierarchy are studied. §1. Introduction. In this paper we consider the current status of a number of open questions concerning the structural organization of classes of Turing degrees below 0 , the degree of the Halting Problem. We denote the set of all such degrees by D(≤ 0). The Ershov hierarchy arranges these degrees into different levels which are determined by a quantitative characteristic of the complexity of algorithmic recognition of the sets composing these degrees. The finite level n, n ≥ 1, of the Ershov hierarchy constitutes n-c.e. sets which can be presented in a canonical form as − [ n 1 ] 2 A = (R2i+1 − R2i ) ∪ (R2i − R2i+1) i=0 for some c.e. sets R0 ⊆ R1 ⊆ R2 ⊆ ··· ⊆ Rn−1. (Here if n is an odd number then Rn = ∅.) A (Turing) degree a is called an n-c.e. degree if it contains an n- c.e. set, and it is called a properly n-c.e. degree if it contains an n-c.e. set but no (n − 1)-c.e. sets. We denote by Dn the set of all n- c.e. degrees. R denotes the set of c.e. degrees. Degrees containing sets from different levels of the Ershov hierarchy, in particular the c.e. degrees, are the most important representatives of D(≤ 0). Investigations of these degree structures pursued in last two-three decades The author is supported by RFBR Grant 05-01-00830. Logic Colloquium ’06 Edited by Barry Cooper, Herman Geuvers, Anand Pillay, and Jouko Va¨an¨ anen¨ Lecture Notes in Logic, 32 c 2009, Association for Symbolic Logic 1 2 M. M. ARSLANOV show that the c.e. degrees and the degrees from finite levels of the Ershov hierarchy have similar properties in many respects. The following theorem, which states that the classes of c.e. and n-c.e. degrees for 1 <n<are indistinguishable from the point of view of their ability to compute fixed-point free functions, is a remarkable confirmation of this observation. Theorem 1. (Arslanov [1] for n =1; Jockusch, Lerman, Soare, Solovay [17] for n>1). Suppose that A is a set which is n-c.e. for some n ≥ 1.ThenA has degree 0 if and only if there is a function f computable in A with no fixed point, ∀ i.e. ( e)(Wf(e) = We). Nevertheless, the elementary theories of the c.e. and the n-c.e. degrees for 0 every n>1 are different even at the Σ2-level. This was shown by Downey [13] (the diamond lattice is embeddable in 2-c.e. degrees preserving 0 and 0)and later by Cooper, Harrington, Lachlan, Lempp and Soare [10] (there is a 2-c.e. degree d < 0 which is maximal in the partial ordering of all n-c.e. degrees for all n>1). Previous to this, a difference between the elementary theories of 0 these degree structures at the Σ3-level was exhibited in Arslanov [2, 3] (every n-c.e. degree for any n>1 can be cupped to 0 bya2-c.e.degree< 0). (Since 0 R D any Σ1-sentence satisfies and n for any n>1 if and only if it is consistent with the theory of partial orderings, R and Dn are indistinguishable at the 0 Σ1-level.) These results initiated an intensive study of the properties of the n-c.e.
Load more

Recommended publications
  • The Realm of Ordinal Analysis
    The Realm of Ordinal Analysis Michael Rathjen Department of Pure Mathematics, University of Leeds Leeds LS2 9JT, United Kingdom Denn die Pioniere der Mathematik hatten sich von gewissen Grundlagen brauchbare Vorstellungen gemacht, aus denen sich Schl¨usse,Rechnungsarten, Resultate ergaben, deren bem¨achtigten sich die Physiker, um neue Ergebnisse zu erhalten, und endlich kamen die Techniker, nahmen oft bloß die Resultate, setzten neue Rechnungen darauf und es entstanden Maschinen. Und pl¨otzlich, nachdem alles in sch¨onste Existenz gebracht war, kamen die Mathematiker - jene, die ganz innen herumgr¨ubeln, - darauf, daß etwas in den Grundlagen der ganzen Sache absolut nicht in Ordnung zu bringen sei; tats¨achlich, sie sahen zuunterst nach und fanden, daß das ganze Geb¨audein der Luft stehe. Aber die Maschinen liefen! Man muß daraufhin annehmen, daß unser Dasein bleicher Spuk ist; wir leben es, aber eigentlich nur auf Grund eines Irrtums, ohne den es nicht entstanden w¨are. ROBERT MUSIL: Der mathematische Mensch (1913) 1 Introduction A central theme running through all the main areas of Mathematical Logic is the classification of sets, functions or theories, by means of transfinite hierarchies whose ordinal levels measure their ‘rank’ or ‘complexity’ in some sense appropriate to the underlying context. In Proof Theory this is manifest in the assignment of ‘proof the- oretic ordinals’ to theories, gauging their ‘consistency strength’ and ‘computational power’. Ordinal-theoretic proof theory came into existence in 1936, springing forth from Gentzen’s head in the course of his consistency proof of arithmetic. To put it roughly, ordinal analyses attach ordinals in a given representation system to formal theories.
    [Show full text]
  • On Relating Theories: Proof-Theoretical Reduction
    This is a repository copy of On Relating Theories: Proof-Theoretical Reduction. White Rose Research Online URL for this paper: http://eprints.whiterose.ac.uk/147184/ Version: Accepted Version Proceedings Paper: Rathjen, M and Toppel, M (2019) On Relating Theories: Proof-Theoretical Reduction. In: Centrone, S, Negri, S, Sarikaya, D and Schuster, PM, (eds.) Mathesis Universalis, Computability and Proof. Humboldt-Kolleg: Proof Theory as Mathesis Universalis, 24-28 Jul 2017, Loveno di Menaggio (Como), Italy. Springer , pp. 311-331. ISBN 978-3-030-20446-4 https://doi.org/10.1007/978-3-030-20447-1_16 © Springer Nature Switzerland AG 2019. This is an author produced version of a paper published in Mathesis Universalis, Computability and Proof. Uploaded in accordance with the publisher's self-archiving policy. Reuse Items deposited in White Rose Research Online are protected by copyright, with all rights reserved unless indicated otherwise. They may be downloaded and/or printed for private study, or other acts as permitted by national copyright laws. The publisher or other rights holders may allow further reproduction and re-use of the full text version. This is indicated by the licence information on the White Rose Research Online record for the item. Takedown If you consider content in White Rose Research Online to be in breach of UK law, please notify us by emailing [email protected] including the URL of the record and the reason for the withdrawal request. [email protected] https://eprints.whiterose.ac.uk/ On relating theories: Proof-theoretical reduction Michael Rathjen and Michael Toppel Department of Pure Mathematics, University of Leeds Leeds LS2 9JT, United Kingdom E-Mail: [email protected] Abstract The notion of proof-theoretical or finitistic reduction of one theory to another has a long tradition.
    [Show full text]
  • Constructive Zermelo-Fraenkel Set Theory, Power Set, and the Calculus of Constructions
    This is a repository copy of Constructive zermelo-fraenkel set theory, power set, and the calculus of constructions. White Rose Research Online URL for this paper: http://eprints.whiterose.ac.uk/75182/ Book Section: Rathjen, M (2012) Constructive zermelo-fraenkel set theory, power set, and the calculus of constructions. In: Dybjer, P, Lindström, S, Palmgren, E and Sundholm, G, (eds.) Epistemology versus ontology: Essays on the philosophy and foundations of mathematics in honour of Per Martin-Löf. Logic, Epistemology, and the Unity of Science, 27 . Springer , Dordrecht, Netherlands , 313 - 349. ISBN 9789400744356 https://doi.org/10.1007/978-94-007-4435-6 Reuse Unless indicated otherwise, fulltext items are protected by copyright with all rights reserved. The copyright exception in section 29 of the Copyright, Designs and Patents Act 1988 allows the making of a single copy solely for the purpose of non-commercial research or private study within the limits of fair dealing. The publisher or other rights-holder may allow further reproduction and re-use of this version - refer to the White Rose Research Online record for this item. Where records identify the publisher as the copyright holder, users can verify any specific terms of use on the publisher’s website. Takedown If you consider content in White Rose Research Online to be in breach of UK law, please notify us by emailing [email protected] including the URL of the record and the reason for the withdrawal request. [email protected] https://eprints.whiterose.ac.uk/ Constructive Zermelo-Fraenkel Set Theory, Power Set, and the Calculus of Constructions Michael Rathjen∗ Department of Pure Mathematics, University of Leeds Leeds LS2 9JT, United Kingdom [email protected] May 4, 2012 Abstract Full intuitionistic Zermelo-Fraenkel set theory, IZF, is obtained from constructive Zermelo- Fraenkel set theory, CZF, by adding the full separation axiom scheme and the power set axiom.
    [Show full text]
  • Ordinal Notation
    Dmytro Taranovsky Last Update: December 31, 2018 Ordinal Notation Abstract: We introduce a framework for ordinal notation systems, present a family of strong yet simple systems, and give many examples of ordinals in these systems. While much of the material is conjectural, we include systems with conjectured strength beyond second order arithmetic (and plausibly beyond ZFC), and prove well-foundedness for some weakened versions. Contents: 1 Introduction 1.1 Introduction 1.2 Prior Work 1.3 Goals of Ordinal Analysis 2 A Framework for Ordinal Notations — defines the general structure for the notations. 2.1 Definition of the General Notation 2.2 Basic Properties 2.3 Bachmann-Howard Ordinal 2.4 One Variable C 2.5 Reflection Configurations 3 Degrees of Recursive Inaccessibility — presents a notation system for ATR0 plus "for every ordinal a, there is recursively a-inaccessible ordinal". 3.1 Definition of the Notation 3.2 Comparison Relation 3.3 Examples 4 Degrees of Reflection — presents a notation system for KP + Πn reflection and somewhat stronger systems, with the canonical assignment for nonrecursive ordinals. 4.1 Definition of Degrees of Reflection 4.2 Examples and Additional Properties 4.3 Assignment of Degrees 4.4 A Step towards Second Order Arithmetic 5 Main Ordinal Notation System — presents the main notation system, which plausibly reaches second order arithmetic (Z2) or higher. 5.1 Definition and Basic Properties 5.2 Strength of the Main System 5.3 Old Analysis and Examples 6 Beyond Second Order Arithmetic — gives insights for going beyond second order arithmetic and ZFC 6.1 Old Analysis 6.2 New Analysis 7 Iteration of n-built from below — proposes a strengthening of the main system.
    [Show full text]
  • Replacement Versus Collection and Related Topics in Constructive Zermelo-Fraenkel Set Theory
    Replacement versus Collection and related topics in Constructive Zermelo-Fraenkel Set Theory Michael Rathjen¤ Department of Mathematics, Ohio State University Columbus, OH 43210, U.S.A. [email protected] May 29, 2005 Abstract While it is known that intuitionistic ZF set theory formulated with Replacement, IZFR, does not prove Collection it is a longstanding open problem whether IZFR and intuitionistic set theory ZF formu- lated with Collection, IZF, have the same proof-theoretic strength. It has been conjectured that IZF proves the consistency of IZFR. This paper addresses similar questions but in respect of constructive Zermelo-Fraenkel set theory, CZF. It is shown that in the latter con- text the proof-theoretic strength of Replacement is the same as that of Strong Collection and also that the functional version of the Regular Extension Axiom is as strong as its relational version. Moreover, it is proved that, contrary to IZF, the strength of CZF increases if one adds an axiom asserting that the trichotomous ordinals form a set. Unlike IZF, constructive Zermelo-Fraenkel set theory is amenable to ordinal analysis and the proofs in this paper make pivotal use thereof in the guise of well-ordering proofs for ordinal representation systems. MSC: 03F50, 03F35 Keywords: Constructive set theory, replacement, strong collection, proof-theoretic strength, trichotomous ordinals 1 Introduction Zermelo-Fraenkel set theory, ZF, is formulated with Replacement rather than Collection, but it is readily seen that Collection is deducible in ZF. The proof, though, makes essential use of classical logic. On the other hand, it was shown in [12] that intuitionistic ZF set theory formulated ¤This material is based upon work supported by the National Science Foundation under Award No.
    [Show full text]
  • Proof Theory, Constructive Mathematics
    Mathematisches Forschungsinstitut Oberwolfach Report No. 18/2008 Mathematical Logic: Proof Theory, Constructive Mathematics Organised by Samuel R. Buss, San Diego Ulrich Kohlenbach, Darmstadt Helmut Schwichtenberg, M¨unchen April 6th – April 12th, 2008 Abstract. The workshop “Mathematical Logic: Proof Theory, Constructive Mathematics” brought together a carefully selected group of mathematicians, computer scientists and logicians in other fields to discus the impact of proof- theoretic and constructive methods in their various areas. A key topic in the meeting was the unwinding of proofs to obtain computational information. This hidden computational information has already lead to new mathematical insights. Computational information is more directly present in constructive approaches to mathematics, a fact that makes it worthwhile to carefully in- vestigate these approaches and also study their proof-theoretic properties. The precise quantitative information proof theory yields about proofs and proof transformations can directly be applied to computational complexity. Mathematics Subject Classification (2000): 03Fxx. Introduction by the Organisers The workshop Mathematical Logic: Proof Theory, Constructive Mathematics was held April 6-12, 2008 and had the following main aims: To promote the interaction of proof theory with core areas of mathematics. This, in particular, refers to uses of proof theoretic techniques (most notably various forms of functional and realizability interpretations) to unwind prima facie ineffective proofs in mathematics. For instance a number of talks presented such applica- tions in the areas of fixed point theory, ergodic theory, topological dynamics and symbolic dynamics resulting in new theorems, surprising to the experts in the respective fields (Avigad, Briseid, Gerhardy, Leu¸stean, Simpson). Another talk addressed uses of analytic number theory in connection with new unprovability results and phase transitions in provability (Bovykin).
    [Show full text]
  • Well-Partial-Orders and Ordinal Notation Systems
    Faculty of Sciences Department of Mathematics Connecting the Two Worlds: Well-partial-orders and Ordinal Notation Systems Jeroen Van der Meeren Supervisor: Prof. Dr. Andreas Weiermann Dissertation submitted in fulfillment of the requirements for the degree of Doctor (Ph.D.) in Sciences, Mathematics 2015 Copyright. The author and the supervisor give the authorization to consult and to copy parts of this work for personal use only. Any other use is limited by the laws of copyright. Permission to reproduce any material contained in this work should be obtained from the author. This does not include the Ghent University logo on the front page, which remains under full copyright of Ghent University. Das Unendliche hat wie keine andere Frage von jeher so tief das Gem¨utdes Menschen bewegt; das Unendliche hat wie kaum eine andere Idee auf den Verstand so anregend und fruchtbar gewirkt; das Unendliche ist aber auch wie kein anderer Begriff so der Aufkl¨arungbed¨urftig. From time immemorial, the infinite has stirred men's emotions more than any other question. Hardly any other idea has stimu- lated the mind so fruitfully. Yet, no other concept needs clarifi- cation more than it does. - David Hilbert, Uber¨ das Unendliche (On the infinite ) [39] Preface Kruskal claims in his now-classical 1972 paper [47] that well-partial-orders are among the most frequently rediscovered mathematical objects. Well- partial-orders have applications in many fields outside the theory of orders: computer science, proof theory, reverse mathematics, algebra, combinatorics, etc. The maximal order type of a well-partial-order characterizes that order's strength.
    [Show full text]
  • Formally Verifying Peano Arithmetic
    FORMALLY VERIFYING PEANO ARITHMETIC by Morgan Sinclaire A thesis submitted in partial fulfillment of the requirements for the degree of Master of Science in Mathematics Boise State University May 2019 Morgan Sinclaire SOME RIGHTS RESERVED This work is licensed under a Creative Commons Attribution 4.0 International License. BOISE STATE UNIVERSITY GRADUATE COLLEGE DEFENSE COMMITTEE AND FINAL READING APPROVALS of the thesis submitted by Morgan Sinclaire Thesis Title: Formally Verifying Peano Arithmetic Date of Final Oral Examination: 15 March 2019 The following individuals read and discussed the thesis submitted by student Morgan Sinclaire, and they evaluated his presentation and response to questions during the final oral examination. They found that the student passed the final oral examination. M. Randall Holmes, Ph.D. Chair, Supervisory Committee John Clemens, Ph.D. Member, Supervisory Committee Samuel Coskey, Ph.D. Member, Supervisory Committee Elena Sherman, Ph.D. Member, Supervisory Committee The final reading approval of the thesis was granted by M. Randall Holmes, Ph.D., Chair of the Supervisory Committee. The thesis was approved by the Graduate College. For Aiur iv ACKNOWLEDGMENTS The main people who deserve counterfactual credit for this work include: 1. My parents. In particular, my mom and my dad. 2. My advisor. He far exceeded his administrative obligations with the number of hours he was available to me for help, both on this thesis and for all of my miscellaneous logic questions. 3. The other people here who have made Boise State a good place to learn logic: Professors Elena Sherman, John Clemens, and Sam Coskey, and the only other logic grad student, Gianni Krakoff.
    [Show full text]
  • Well-Partial-Orders and Ordinal Notation Systems
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Ghent University Academic Bibliography Faculty of Sciences Department of Mathematics Connecting the Two Worlds: Well-partial-orders and Ordinal Notation Systems Jeroen Van der Meeren Supervisor: Prof. Dr. Andreas Weiermann Dissertation submitted in fulfillment of the requirements for the degree of Doctor (Ph.D.) in Sciences, Mathematics 2015 Copyright. The author and the supervisor give the authorization to consult and to copy parts of this work for personal use only. Any other use is limited by the laws of copyright. Permission to reproduce any material contained in this work should be obtained from the author. This does not include the Ghent University logo on the front page, which remains under full copyright of Ghent University. Das Unendliche hat wie keine andere Frage von jeher so tief das Gem¨utdes Menschen bewegt; das Unendliche hat wie kaum eine andere Idee auf den Verstand so anregend und fruchtbar gewirkt; das Unendliche ist aber auch wie kein anderer Begriff so der Aufkl¨arungbed¨urftig. From time immemorial, the infinite has stirred men's emotions more than any other question. Hardly any other idea has stimu- lated the mind so fruitfully. Yet, no other concept needs clarifi- cation more than it does. - David Hilbert, Uber¨ das Unendliche (On the infinite ) [39] Preface Kruskal claims in his now-classical 1972 paper [47] that well-partial-orders are among the most frequently rediscovered mathematical objects. Well- partial-orders have applications in many fields outside the theory of orders: computer science, proof theory, reverse mathematics, algebra, combinatorics, etc.
    [Show full text]
  • The Art of Ordinal Analysis
    The Art of Ordinal Analysis Michael Rathjen Abstract. Ordinal analysis of theories is a core area of proof theory whose origins can be traced back to Hilbert's programme - the aim of which was to lay to rest all worries about the foundations of mathematics once and for all by securing mathematics via an absolute proof of consistency. Ordinal-theoretic proof theory came into existence in 1936, springing forth from Gentzen's head in the course of his consistency proof of arithmetic. The central theme of ordinal analysis is the classification of theories by means of transfinite ordinals that measure their `consistency strength' and `computational power'. The so-called proof- theoretic ordinal of a theory also serves to characterize its provably recursive functions and can yield both conservation and combinatorial independence results. This paper intends to survey the development of \ordinally informative" proof theory from the work of Gentzen up to more recent advances in determining the proof-theoretic ordinals of strong subsystems of second order arithmetic. Mathematics Subject Classification (2000). Primary 03F15, 03F05, 03F35; Sec- ondary 03F03, 03-03. Keywords. Proof theory, ordinal analysis, ordinal representation systems, proof-theoretic strength. 1. Introduction Ordinal analysis of theories is a core area of proof theory. The origins of proof the- ory can be traced back to the second problem on Hilbert's famous list of problems (presented at the Second International Congress in Paris on August 8, 1900), which called for a proof of consistency of the arithmetical axioms of the reals. Hilbert's work on axiomatic geometry marked the beginning of his live-long interest in the axiomatic method.
    [Show full text]
  • Choice Principles in Constructive and Classical Set Theories
    Choice principles in constructive and classical set theories Michael Rathjen∗ Department of Pure Mathematics, University of Leeds Leeds LS2 9JT, United Kingdom E-Mail: [email protected] Abstract The objective of this paper is to assay several forms of the axiom of choice that have been deemed constructive. In addition to their deductive relation- ships, the paper will be concerned with metamathematical properties effected by these choice principles and also with some of their classical models. 1 Introduction Among the axioms of set theory, the axiom of choice is distinguished by the fact that it is the only one that one finds ever mentioned in workaday mathematics. In the mathematical world of the beginning of the 20th century, discussions about the status of the axiom of choice were important. In 1904 Zermelo proved that every set can be well-ordered by employing the axiom of choice. While Zermelo argued that it was self-evident, it was also criticized as an excessively non-constructive principle by some of the most distinguished analysts of the day. At the end of a note sent to the Mathematische Annalen in December 1905, Borel writes about the axiom of choice: It seems to me that the objection against it is also valid for every reason- ing where one assumes an arbitrary choice made an uncountable number of times, for such reasoning does not belong in mathematics. ([10], pp. 1251-1252; translation by H. Jervell, cf. [22], p. 96.) Borel canvassed opinions of the most prominent French mathematicians of his gen- eration - Hadamard, Baire, and Lebesgue - with the upshot that Hadamard sided with Zermelo whereas Baire and Lebesgue seconded Borel.
    [Show full text]
  • Ordinal Analysis Without Proofs
    ORDINAL ANALYSIS WITHOUT PROOFS JEREMY AVIGAD Abstract. An approach to ordinal analysis is presented which is finitary, but high- lights the semantic content of the theories under consideration, rather than the syntactic structure of their proofs. In this paper the methods are applied to the analysis of the- ories extending Peano arithmetic with transfinite induction and transfinite arithmetic hierarchies. §1. Introduction. As the name implies, in the field of proof theory one tends to focus on proofs. Nowhere is this emphasis more evident than in the field of ordinal analysis, where one typically designs procedures for “un- winding” derivations in appropriate deductive systems. One might wonder, however, if this emphasis is really necessary; after all, the results of an ordinal analysis describe a relationship between a system of ordinal notations and a theory, and it is natural to think of the latter as the set of semantic conse- quences of some axioms. From this point of view, it may seem disappointing that we have to choose a specific deductive system before we can begin the ordinal analysis. In fact, Hilbert’s epsilon substitution method, historically the first attempt at finding a finitary consistency proof for arithmetic, has a more semantic char- acter. With this method one uses so-called epsilon terms to reduce arithmetic to a quantifier-free calculus, and then one looks for a procedure that assigns numerical values to any finite set of closed terms, in a manner consistent with the axioms. The first ordinal analysis of arithmetic using epsilon terms is due to Ackermann [1]; for further developments see, for example, [20].
    [Show full text]