Wadge Hierarchy and Veblen Hierarchy Part I: Borel Sets of Finite Rank Author(S): J

Total Page:16

File Type:pdf, Size:1020Kb

Wadge Hierarchy and Veblen Hierarchy Part I: Borel Sets of Finite Rank Author(S): J Wadge Hierarchy and Veblen Hierarchy Part I: Borel Sets of Finite Rank Author(s): J. Duparc Source: The Journal of Symbolic Logic, Vol. 66, No. 1 (Mar., 2001), pp. 56-86 Published by: Association for Symbolic Logic Stable URL: http://www.jstor.org/stable/2694911 Accessed: 04/01/2010 12:38 Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use. Please contact the publisher regarding any further use of this work. Publisher contact information may be obtained at http://www.jstor.org/action/showPublisher?publisherCode=asl. Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission. JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected]. Association for Symbolic Logic is collaborating with JSTOR to digitize, preserve and extend access to The Journal of Symbolic Logic. http://www.jstor.org THE JOURNAL OF SYMBOLICLOGIC Voluime 66. Number 1, March 2001 WADGE HIERARCHY AND VEBLEN HIERARCHY PART I: BOREL SETS OF FINITE RANK J. DUPARC Abstract. We consider Borel sets of finite rank A C A'" where cardinality of A is less than some uncountable regular cardinal K5. We obtain a "normal form" of A, by finding a Borel set Q, such that A and Q continuously reduce to each other. In more technical terms: we define simple Borel operations which are homomorphic to ordinal sum. to multiplication by a countable ordinal, and to ordinal exponentiation of base K;*under the map which sends every Borel set A of finite rank to its Wadge degree. ?1. Introduction. We recall a tree T on A is a subset of ACIDthat is closed under subsequences i.e., satisfies Vu E T Vv (v C u - v E T).When T is some tree, we write [T] to denote the set of its infinite branches: {a E AW: Vn E co (a [ n) E T}. By a Borel set we mean a Borel subset A of A'A,where AA (which contains at least two elements to avoid trivialities) is some well-ordered alphabet of cardinality less than some uncountable regular cardinal K, and the topology on A' is the product topology of the discrete topology on AA: A is open if and only if there exists some U C A"<-"such that A= {ua oAC, : u U}. As soon as it was introduced, the class of Borel sets (the closure by comple- mentation and countable union of the class of open sets) was set up in a hi- erarchy by Baire: V is the class of open sets, and by induction for 4 > 1, Lo; = {UnEOA,1 -An E U(<;V} where -A,] stands for the complement of the set An. The Baire hierarchy of height co, was later subdivided by Hausdorff and Kuratowski into K wil levels (they worked with K = wl) by introducing the sepa- rated difference operation[. But an ultimate refinementwas to come with Wadge's work based on the notion of inverse images of continuous functions. A continuousreduction of A to B is a continuous function f: AC-0 ACBsuch that A - f' B. It is denoted A < w B; intuitively it means that A is less complicated than B -strictly if there is no reduction of B to A; which is denoted <w. If A < w B < w A, in other words, A and B continuously reduce to each other, then A is said Wadge-equivalentto B, denoted _ w. Given two Borel sets A C A(", B C AWB,it is a consequence of Borel determinacy [5] that either A <? B or -B <? A. In case K = wal, Martin proved that <? is wellfounded on Borel sets [1]. This result still holds in case K > col and allows to define the Wadge degree of a Borel set by induction: dw(0) = dw(-0) = 0 and dt?A = sup{dw (B) + 1: B <w A}. Wadge's lemma, as a consequence of Borel Received January 30, 1997; revised May 20, 1999. ? 2001, Association for Symbolic Logic 0022-4812/01/6601 -0002/$4. I0 56 WADGEHIERARCHY AND VEBLENHIERARCHY 57 determinacy, states that two Borel sets have same Wadge degree if and only if they are Wadge equivalent or one is Wadge equivalent to the complement of the other [1]. We recall the definition of a self-dual set: a set A that satisfies A =jw -A. Willing to concentrate on non self dual sets we need to consider another definition of the Wadge degree that put apart the self dual ones. DEFINITION 1. o dj(0) = d,(- 0) 1 o dA = sup{dw(B) + 1: B non self dual A B <w A} (for either A self dual or not, A >a 0)1. Thus the Wadge degree of A is a measure of the complexity of A, just as its Borel rank or its level in the Hausdorff-Kuratowski hierarchy. But the Wadge degree is a much finer measure. Computing the height of the Wadge hierarchy requires a hierarchy of fast increasing ordinal functions: the Veblen hierarchy [7]. DEFINITION 2. The Veblenhierarchy (V: )<,,, of continuousfunctions from i+ \ {O} - iii+ -. {O}is definedby: Vois thefunction that enumeratesordinals of cofinality X or 1 that are closed under ordinal addition, namely Vo(1) 1, Vo(a + 1) VoJ(a) X, Vo((A) = iA when cof((A)= X, Vo((A)= &A+'when co < cof((A) < K. For > 0, V, is thefunction that enumeratesordinals of cofinality K or 1 that are closed undereach function V(for any 4 < I. The Wadge degree of Borel sets of finite rank ranges from 1 to sup V0 o ... o Vo(2) n Coa n (denoted 'CEosince it is the first fixpoint of the exponentiation of base K) while the Borel rank only runs through integers. And things get even much worse for Borel sets of infinite ranks: the Wadge degree of sets of Borel rank co climbs up to V1(2) (characterized also as the K"th fixpoint of the exponentiation of base K, therefore denoted fej. And when dealing with all wol Borel ranks the Wadge hierarchy involves sup,,(,, V, (2) distinct degrees. As a consequence, it is quite a problem to provide for each Wadge degree af a description of a Borel set Q(ca) of degree precisely a. A solution for K = col was given essentially by Wadge [9], and confirmed after ten years of work culminating with Louveau and Saint-Raymond [2], [3]. We have given a new solution in the case af < V1(2), that is for AO sets (and we are writing an extension to all Borel ranks). This solution is canonical because its characteristic feature is to give a Borel definition of Q(a) whose is isomorphic to the canonical description of the ordinal Oaitself. Let us quote Wadge in the conclusion of his Ph. D. Thesis: One goes from the standard definition of the Wadge degree to ours by: o if A is non self dual, only three possibilities occur: (a) df A = 2.n with n integer, then d'cA = n + 1 (b) d' A = A + 2n with n integer and A limit (necessarily cof(A) = IKholds), then d'A = A + n (c) d WA = A+2n +I1 with n integer and A limit (necessarilycof(A) < IKholds), then dfA = A+n o if A is self dual, also there is only three cases: (a) d' A = 2.n + 1 with n integer, then d,?UA= n + 1 (b) diA = A + 2n with n integer and A limit (necessarily cof(X) < I%holds), then d?A = A + n (c) divA = A + 2n + 1 with n integer andA limit (necessarily cof(A)K = %holds), thenOA d A = X+n+ 1 58 J. DUPARC "It would also be very interesting to know of some "inductive" definition of the degrees, which allows a given degree to be constructed from those below it. This might, for example, allow properties of subsets of 0%oto be proved by induction on the degree of the set involved" ([9], p. 323) Wadge worked in the Baire space co;w he defined set theoretic counterparts of the sum and < wol-multiplicationso that on the basis of the empty set (which degree is 1) he was able to generate sets of degree al for any al < c<' but couldn't go any further. In particular, with his method, he couldn't reach a p-complete set (which degree is precisely <' ). We hope this work is an attempt to respond to the wish formulated by Wadge. ?2. Away with self-dual sets, the conciliating Wadge hierarchy. We say a set A is conciliating if it is a subset of A<', where AA is of cardinality less than K. And given two conciliating sets A, B, we define the conciliatory version C(A, B) of the Wadge game W(A, B), which is this game when the sequences a, ,8 produced by the players may be finite.
Recommended publications
  • The Wadge Hierarchy : Beyond Borel Sets
    Unicentre CH-1015 Lausanne http://serval.unil.ch Year : 2016 The Wadge Hierarchy : Beyond Borel Sets FOURNIER Kevin FOURNIER Kevin, 2016, The Wadge Hierarchy : Beyond Borel Sets Originally published at : Thesis, University of Lausanne Posted at the University of Lausanne Open Archive http://serval.unil.ch Document URN : urn:nbn:ch:serval-BIB_B205A3947C037 Droits d’auteur L'Université de Lausanne attire expressément l'attention des utilisateurs sur le fait que tous les documents publiés dans l'Archive SERVAL sont protégés par le droit d'auteur, conformément à la loi fédérale sur le droit d'auteur et les droits voisins (LDA). A ce titre, il est indispensable d'obtenir le consentement préalable de l'auteur et/ou de l’éditeur avant toute utilisation d'une oeuvre ou d'une partie d'une oeuvre ne relevant pas d'une utilisation à des fins personnelles au sens de la LDA (art. 19, al. 1 lettre a). A défaut, tout contrevenant s'expose aux sanctions prévues par cette loi. Nous déclinons toute responsabilité en la matière. Copyright The University of Lausanne expressly draws the attention of users to the fact that all documents published in the SERVAL Archive are protected by copyright in accordance with federal law on copyright and similar rights (LDA). Accordingly it is indispensable to obtain prior consent from the author and/or publisher before any use of a work or part of a work for purposes other than personal use within the meaning of LDA (art. 19, para. 1 letter a). Failure to do so will expose offenders to the sanctions laid down by this law.
    [Show full text]
  • Wadge Hierarchy of Omega Context Free Languages Olivier Finkel
    Wadge Hierarchy of Omega Context Free Languages Olivier Finkel To cite this version: Olivier Finkel. Wadge Hierarchy of Omega Context Free Languages. Theoretical Computer Science, Elsevier, 2001, 269 (1-2), pp.283-315. hal-00102489 HAL Id: hal-00102489 https://hal.archives-ouvertes.fr/hal-00102489 Submitted on 1 Oct 2006 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. WADGE HIERARCHY OF OMEGA CONTEXT FREE LANGUAGES Olivier Finkel Equipe de Logique Math´ematique CNRS URA 753 et Universit´eParis 7 U.F.R. de Math´ematiques 2 Place Jussieu 75251 Paris cedex 05, France. E Mail: fi[email protected] Abstract The main result of this paper is that the length of the Wadge hierarchy of omega context free languages is greater than the Cantor ordinal ε0, and the same result holds for the conciliating Wadge hierarchy, defined in [Dup99], of infinitary context free languages, studied in [Bea84a]. In the course of our proof, we get results on the Wadge hierarchy of iterated counter ω-languages, which we define as an extension of classical (finitary) iterated counter languages to ω-languages. Keywords: omega context free languages; topological properties; Wadge hier- archy; conciliating Wadge hierarchy; infinitary context free languages; iterated counter ω-languages.
    [Show full text]
  • Descriptive Set Theory and Ω-Powers of Finitary Languages Olivier Finkel, Dominique Lecomte
    Descriptive Set Theory and !-Powers of Finitary Languages Olivier Finkel, Dominique Lecomte To cite this version: Olivier Finkel, Dominique Lecomte. Descriptive Set Theory and !-Powers of Finitary Languages. Adrian Rezus. Contemporary Logic and Computing, 1, College Publications, pp.518-541, 2020, Land- scapes in Logic. hal-02898919 HAL Id: hal-02898919 https://hal.archives-ouvertes.fr/hal-02898919 Submitted on 14 Jul 2020 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Descriptive Set Theory and ω-Powers of Finitary Languages Olivier FINKEL and Dominique LECOMTE1 March 18, 2020 • CNRS, Universit´ede Paris, Sorbonne Universit´e, Institut de Math´ematiques de Jussieu-Paris Rive Gauche, Equipe de Logique Math´ematique Campus des Grands Moulins, bˆatiment Sophie-Germain, case 7012, 75205 Paris cedex 13, France fi[email protected] •1 Sorbonne Universit´e, Universit´ede Paris, CNRS, Institut de Math´ematiques de Jussieu-Paris Rive Gauche, Equipe d’Analyse Fonctionnelle Campus Pierre et Marie Curie, case 247, 4, place Jussieu, 75 252 Paris cedex 5, France [email protected] •1 Universit´ede Picardie, I.U.T. de l’Oise, site de Creil, 13, all´ee de la fa¨ıencerie, 60 107 Creil, France Abstract.
    [Show full text]
  • Wadge Degrees of Ω-Languages of Petri Nets Olivier Finkel
    Wadge Degrees of !-Languages of Petri Nets Olivier Finkel To cite this version: Olivier Finkel. Wadge Degrees of !-Languages of Petri Nets. 2018. hal-01666992v2 HAL Id: hal-01666992 https://hal.archives-ouvertes.fr/hal-01666992v2 Preprint submitted on 26 Mar 2018 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Wadge Degrees of ω-Languages of Petri Nets Olivier Finkel Equipe de Logique Mathématique Institut de Mathématiques de Jussieu - Paris Rive Gauche CNRS et Université Paris 7, France. [email protected] Abstract We prove that ω-languages of (non-deterministic) Petri nets and ω-languages of (non-deterministic) Tur- ing machines have the same topological complexity: the Borel and Wadge hierarchies of the class of ω-languages of (non-deterministic) Petri nets are equal to the Borel and Wadge hierarchies of the class of ω-languages of (non-deterministic) Turing machines which also form the class of effective analytic CK 0 sets. In particular, for each non-null recursive ordinal α < ω1 there exist some Σα-complete and some 0 Πα-complete ω-languages of Petri nets, and the supremum of the set of Borel ranks of ω-languages of 1 CK Petri nets is the ordinal γ2 , which is strictly greater than the first non-recursive ordinal ω1 .
    [Show full text]
  • Effective Wadge Hierarchy in Computable Quasi-Polish Spaces
    Effective Wadge hierarchy in computable quasi-Polish spaces Victor Selivanov1 A.P. Ershov IIS SB RAS (Novosibirsk) Mathematical Logic and its Applications Workshop March 22, 2021 Victor Selivanov Effective Wadge hierarchy in computable quasi-Polish spaces Contents 1. Introduction. 2. Effective spaces. 3. Iterated labeled trees. 4. Defining the (effective) WH. 5. The preservation property. 6. Hausdorff-Kuratowski-type results. 7. The non-collapse property. 8. Conclusion. Victor Selivanov Effective Wadge hierarchy in computable quasi-Polish spaces Introduction The classical Borel, Luzin, and Hausdorff hierarchies in Polish spaces, which are defined using set operations, play an important role in descriptive set theory (DST). In 2013 these hierarchies were extended and shown to have similar nice properties also in quasi-Polish spaces which include many non-Hausdorff spaces of interest for several branches of mathematics and theoretical computer science (M. de Brecht). The Wadge hierarchy is non-classical in the sense that it is based on a notion of reducibility that was not recognized in the classical DST, and on using ingenious versions of Gale-Stewart games rather than on set operations. For subsets A; B of the Baire space ! −1 N = ! , A is Wadge reducible to B (A ≤W B), if A = f (B) for some continuous function f on N . The quotient-poset of the preorder (P(N ); ≤W ) under the induced equivalence relation ≡W on the power-set of N is called the structure of Wadge degrees in N . Victor Selivanov Effective Wadge hierarchy in computable quasi-Polish spaces Introduction W. Wadge characterised the structure of Wadge degrees of Borel sets (i.e., the quotient-poset of (B(N ); ≤W )) up to isomorphism.
    [Show full text]
  • Towards a Descriptive Theory of Cb 0-Spaces
    Towards a Descriptive Theory of cb0-Spaces Victor Selivanov A.P. Ershov Institute of Informatics Systems SB RAS Novosibirsk, Russia October 28, 2018 Abstract The paper tries to extend results of the classical Descriptive Set Theory to as many countably based T0-spaces (cb0-spaces) as possible. Along with extending some central facts about Borel, Luzin and Hausdorff hierarchies of sets we consider also the more general case of k-partitions. In particular, we investigate the difference hierarchy of k-partitions and the fine hierarchy closely related to the Wadge hierarchy. Key words. Borel hierarchy, Luzin hierarchy, Hausdorff hierarchy, Wadge reducibility, cb0-space, k-partition, h-preorder, well preorder. 1 Introduction Classical Descriptive Set Theory [Ke95] is an important field of mathematics with numerous applications. It investigates descriptive complexity of sets, functions and equivalence relations in Polish (i.e., separable complete metrizable) spaces. Although Polish spaces are sufficient for many fields of classical mathematics, they are certainly not sufficient for many fields of Theoretical Computer Science where non-Hausdorff spaces (in particular, ω-continuous domains) and non-countably-based spaces (in particular, Kleene-Kreisel continuous func- tionals) are of central importance. For this reason, the task of extending classical Descriptive Set Theory (DST) to as many non-Polish spaces as possible attracted attention of several researchers. Some parts of DST for ω-continuous domains (which are typically non-Polish) were developed in [Se04, Se05a, Se06, Se08]. In [Br13] a good deal of DST was developed for the so called quasi-Polish spaces (see the next section for a definition of this class of cb0-spaces) which include both the Polish spaces and the ω-continuous domains.
    [Show full text]
  • Wadge Hierarchy on Second Countable Spaces Reduction Via Relatively Continuous Relations
    Wadge Hierarchy on Second Countable Spaces Reduction via relatively continuous relations Yann Honza Pequignot Université de Lausanne Université Paris Diderot Winter School In Abstract analysis Set Theory & Topology Hejnice, 15th January – 1st February, 2014 Classify Definable subsets of topological spaces nd X a 2 countable T0 topological space: A countable basis of open sets, Two points which have same neighbourhoods are equal. Borel sets are naturally classified according to their definition 0 Σ1(X) = {O ⊆ X | X is open}, 0 [ Σ (X) = Bi Bi is a Boolean combination of open sets , 2 i∈ω 0 { 0 Πα(X) = A A ∈ Σα(X) , 0 \ [ 0 Σ (X) = Pi Pi ∈ Π (X) , for α > 2. α β i∈ω β<α [ 0 [ 0 Borel subsets of X = Σα(X) = Πα(X) α<ω1 α<ω1 Wadge reducibility Let X be a topological space, A, B ⊆ X. A is Wadge reducible to B, or A ≤W B, if there is a continuous function f : X → X that reduces A to B, i.e. such that f −1(B) = A or equivalently ∀x ∈ X x ∈ A ←→ f (x) ∈ B. Bill Wadge The idea is that the continuous function f reduces the membership question for A to the membership question for B. The identity on X is continous, and continuous functions compose, so Wadge reducibility is a quasi order on subsets of X. Is it useful? On non 0-dim metric spaces, and many other non metrisable spaces the relation ≤W yields no hierarchy at all, by results of Schlicht, Hertling, Ikegami, Tanaka, Grigorieff, Selivanov and others.
    [Show full text]
  • Wadge Degrees of $\Omega $-Languages of Petri Nets
    Wadge Degrees of ω-Languages of Petri Nets Olivier Finkel Equipe de Logique Mathématique Institut de Mathématiques de Jussieu - Paris Rive Gauche CNRS et Université Paris 7, France. [email protected] Abstract We prove that ω-languages of (non-deterministic) Petri nets and ω-languages of (non-deterministic) Tur- ing machines have the same topological complexity: the Borel and Wadge hierarchies of the class of ω-languages of (non-deterministic) Petri nets are equal to the Borel and Wadge hierarchies of the class of ω-languages of (non-deterministic) Turing machines which also form the class of effective analytic CK 0 sets. In particular, for each non-null recursive ordinal α < ω1 there exist some Σα-complete and some 0 Πα-complete ω-languages of Petri nets, and the supremum of the set of Borel ranks of ω-languages of 1 CK Petri nets is the ordinal γ2 , which is strictly greater than the first non-recursive ordinal ω1 . We also 1 prove that there are some Σ1-complete, hence non-Borel, ω-languages of Petri nets, and that it is consist- 1 ent with ZFC that there exist some ω-languages of Petri nets which are neither Borel nor Σ1-complete. This answers the question of the topological complexity of ω-languages of (non-deterministic) Petri nets which was left open in [9, 19]. Keywords and phrases Automata and formal languages; logic in computer science; Petri nets; infinite words; Cantor topology; Borel hierarchy; Wadge hierarchy; Wadge degrees. Digital Object Identifier 10.4230/LIPIcs... 1 Introduction In the sixties, Büchi was the first to study acceptance of infinite words by finite automata with the now called Büchi acceptance condition, in order to prove the decidability of the monadic second order theory of one successor over the integers.
    [Show full text]
  • Study on Sets
    International Journal of Research (IJR) Vol-1, Issue-10 November 2014 ISSN 2348-6848 Study on Sets Sujeet Kumar & Ashish Kumar Gupta Department of Information and technology Dronacharya College of Engineering,Gurgaon-122001, India Email:[email protected], Email:[email protected] Set difference of U and A, denoted U \ A, Abstract- is the set of all members of Uthat are not members of A. The set difference {1,2,3} \ Set theory is the branch of mathematical logic that studies sets, which {2,3,4} is {1} , while, conversely, the set are collections of objects. Although any type of object can be collected difference {2,3,4} \ {1,2,3} is {4} . into a set, set theory is applied most often to objects that are relevant to mathematics.In this research paper we studied about Basic concepts and When A is a subset of U, the set notation, some ontology and applications. We have also study about difference U \ A is also called combinational set theory, forcing, cardinal invariants, fuzzy set theory. the complement of A inU. In this case, if We have described all the basic concepts of Set Theory. the choice of U is clear from the context, the notation Acis sometimes used instead Keywords- of U \ A, particularly if U is a universal set as in the study of Venn diagrams. Combinational ;fuzzy ; forcing; cardinals; ontology 1. INTRODUCTION Symmetric difference of sets A and B, denoted A △ B or A ⊖ B, is the set of all Set theory is the branch of mathematical logic that studies objects that are a member of exactly one sets, which are collections of objects.
    [Show full text]
  • Borel Subsets of the Real Line and Continuous Reducibility
    BOREL SUBSETS OF THE REAL LINE AND CONTINUOUS REDUCIBILITY DAISUKE IKEGAMI, PHILIPP SCHLICHT, AND HISAO TANAKA Abstract. We study classes of Borel subsets of the real line R such as levels of the Borel hierarchy and the class of sets that are reducible to the set Q of rationals, endowed with the Wadge quasi-order of reducibility with respect to continuous functions on R. Notably, we explore several structural properties of Borel subsets of R that diverge from those of Polish spaces with dimension zero. Our first main result is on the existence of embeddings of several posets into the restriction of this quasi-order to any Borel class that is strictly above the classes of open and ‹ closed sets, for instance the linear order !1, its reverse !1 and the poset Pp!q{fin of inclusion modulo finite error. As a consequence of its proof, it is shown that there are no complete sets for these classes. We further extend the previous theorem to targets that are reducible to Q. These non-structure results motivate the study of further restrictions of the Wadge quasi-order. In our second main theorem, we introduce a combinatorial property that is shown to characterize those Fσ sets that are reducible to Q. This is applied to construct a minimal set below Q and prove its uniqueness up to Wadge equivalence. We finally prove several results concerning gaps and cardinal characteristics of the Wadge quasi-order and thereby answer questions of Brendle and Geschke. Contents 1. Introduction 1 2. Notation 3 3. Embedding posets into the Wadge quasi-order4 4.
    [Show full text]
  • Operations on a Wadge-Type Hierarchy of Ordinal-Valued Functions
    Operations on a Wadge-Type Hierarchy of Ordinal-Valued Functions MSc Thesis (Afstudeerscriptie) written by Alexander C. Block (born November 10th, 1989 in Bad Segeberg, Germany) under the supervision of Prof Dr Benedikt Lowe¨ , and submitted to the Board of Examiners in partial fulfillment of the requirements for the degree of MSc in Logic at the Universiteit van Amsterdam. Date of the public defense: Members of the Thesis Committee: January 28th, 2014 Dr Jakub Szymanik (chair) Dr Benno van den Berg Dr Nick Bezhanishvili Dr Yurii Khomskii Prof Dr Benedikt Lowe¨ Prof Dr Jouko Va¨an¨ anen¨ Contents 1 Introduction and Acknowledgments 1 1.1 Outline of the Thesis . .1 1.2 Original Contribution . .3 1.3 Acknowledgments . .4 2 Prerequisites 5 2.1 Basic Notation and Results . .5 2.1.1 Axiomatic Framework and Set Theory . .5 2.1.2 Sequences . .7 2.1.3 Order Theory . .8 2.1.4 Trees and Topology . .9 2.2 Games and Determinacy . 11 2.3 Descriptive Set Theory . 14 2.3.1 The Original Wadge Hierarchy and the Ordinal Θ ................. 15 2.3.2 Regular Norms . 16 3 Induced Hierarchies of Norms 19 3.1 Original Wadge Hierarchy and Hierarchy of Strictly Regular Norms Revisited . 19 3.2 Games and Wadge’s Lemma . 22 3.3 Better Quasi-Orders and Well-Foundedness . 24 3.4 Self-Duality and the Steel-Van Wesep Theorem . 28 3.5 An Alternative Characterization of Self-Duality . 32 4 The Hierarchy of Regular Norms 35 4.1 The Ordinal Σ ........................................ 35 4.1.1 A Lower Bound .
    [Show full text]
  • THREE DAYS of Ω-LOGIC the Zermelo-Fraenkel Axioms for Set
    THREE DAYS OF Ω-LOGIC PAUL B. LARSON The Zermelo-Fraenkel axioms for set theory with the Axiom of Choice (ZFC) form the most commonly accepted foundations for mathematical practice, yet it is well-known that many mathematical statements are neither proved nor refuted from these axioms. One example is given by G¨odel'sSecond Incompleteness Theorem, which says that no consistent recursive axiom system which is strong enough to describe arithmetic on the integers can prove its own consistency. This presents a prob- lem for those interested in finding an axiomatic basis for mathematics, as the consistency of any such theory would seem to be as well justi- fied as the theory itself. There are many views on how to resolve this situation. While some logicians propose weaker foundations for mathe- matics, some study the question of how to properly extend ZFC. Large cardinal axioms and their many consequences for small sets have been studied as a particularly attractive means to this goal. Large cardinals resolve the projective theory of the real line and banish the various measure-theoretic paradoxes derivable from the Axiom to Choice from the realm of the definable. Moreover, the large cardinal hierarchy itself appears to serve as universal measuring stick for consistency strength, in that the consistency strength of any natural statement of mathemat- ics (over ZFC) can be located on this hierarchy (see [7] for the definitive reference on large cardinals). While there is no technical definition of \large cardinal," Woodin's Ω-logic is an attempt to give a formal definition for the set of con- sequences of large cardinals for rank initial segments of the universe.
    [Show full text]