# CODING TRUE ARITHMETIC IN THE MEDVEDEV AND MUCHNIK DEGREES

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 CODING TRUE ARITHMETIC IN THE MEDVEDEV AND MUCHNIK DEGREES PAUL SHAFER Abstract. We prove that the first-order theory of the Medvedev degrees, the first-order theory of the Muchnik degrees, and the third-order theory of true arithmetic are pairwise recursively isomorphic (obtained independently by Lewis, Nies, and Sorbi [7]). We then restrict our attention to the degrees of closed sets and prove that the following theories are pairwise recursively isomorphic: the first-order theory of the closed Medvedev degrees, the first-order theory of the compact Medvedev degrees, the first-order theory of the closed Muchnik degrees, the first-order theory of the compact Muchnik degrees, and the second-order theory of true arithmetic. Our coding methods also prove that neither the closed Medvedev degrees nor the compact Medvedev degrees are elementarily equivalent to either the closed Muchnik degrees or the compact Muchnik degrees. 1. Introduction The complexities of the first-order theories of degree structures are a central topic in computability theory. The results typically show that these theories are computationally as complicated as possible. Major results include (in chronological order): The first-order theory of the Turing degrees is recursively isomorphic to the second-order theory of true arithmetic (Simpson [15]). The first-order theory of the Turing degrees below 0 is recursively isomorphic to the firstorder theory of true arithmetic (Shore [14]). The first-order theory of the Turing degrees of r.e. sets is recursively isomorphic to the first-order theory of true arithmetic (Harrington and Slaman, unpublished; see also Nies, Shore, and Slaman [12]). We continue in this vein by proving two main theorems: Theorem 3.13: The first-order theory of the Medvedev degrees, the first-order theory of the Muchnik degrees, and the third-order theory of true arithmetic are pairwise recursively isomorphic (obtained independently by Lewis, Nies, and Sorbi [7]). Theorem 5.12: The following theories are pairwise recursively isomorphic: the first-order theory of the closed Medvedev degrees, the first-order theory of the compact Medvedev degrees, the first-order theory of the closed Muchnik degrees, the first-order theory of the compact Muchnik degrees, and the second-order theory of true arithmetic. In addition we prove: Theorem 6.3: Neither the closed Medvedev degrees nor the compact Medvedev degrees are elementarily equivalent to either the closed Muchnik degrees or the compact Muchnik degrees. Our codings of arithmetic into the Medvedev and Muchnik degree structures are direct. We define parameters coding ω,, +, and, and then we explain how to simulate quantification. In the third-order case, we show that any Medvedev degree or Muchnik degree codes both a subset of ω and a subset of 2 ω. Hence quantification over the Medvedev degrees or over the Muchnik degrees simulates both quantification over 2 ω and quantification over 2 2ω. In the second-order case, we use This research was partially supported by NSF grants DMS and DMS

2 2 PAUL SHAFER a different coding and again show that quantification over the closed degrees or over the compact degrees simulates quantification over 2 ω. In contrast, Lewis, Nies, and Sorbi s proof of Theorem 3.13 relies on the following facts: The third-order theory of arithmetic is recursively isomorphic to the second-order theory of the reals, and the reals can be coded as a symmetric graph. This paper is organized as follows: The rest of the introduction establishes notation and defines the objects considered. Section 2 interprets the various degree structures in third-order arithmetic or in second-order arithmetic. Section 3 interprets third-order arithmetic in the Medvedev degrees and in the Muchnik degrees. Section 4 interprets second-order arithmetic in the closed Muchnik degrees and in the compact Muchnik degrees. Section 5 interprets second-order arithmetic in the closed Medvedev degrees and in the compact Medvedev degrees. Section 6 distinguishes the first-order theories of the closed Medvedev degrees and the compact Medvedev degrees from the first-order theories of the closed Muchnik degrees and the compact Muchnik degrees 1.1. Basic notation. Φ e denotes the e th Turing functional. The function, : ω ω ω is a fixed recursive bijection. For f, g ω ω, f g ω ω is the function where (f g)(2n) = f(n) and (f g)(2n + 1) = g(n). For finite sequences σ, τ ω <ω, σ τ means that σ is an initial segment of τ. Similarly, σ f means that σ is an initial segment of f. The sequence σ τ is the concatenation of sequences σ and τ. Similarly σ f is the concatenation of σ and f. For σ ω <ω and A ω ω, σ A denotes {σ f f A}. The sequence f n is the initial segment of f of length n. The length of a sequence σ is denoted by σ. A tree is a set T ω <ω closed under initial segments. A function f is a path through T if (f n) T for all n ω. For A, B ω, we write A 1 B if there is a one-to-one recursive function f such that n(n A f(n) B). A and B are recursively isomorphic if there is such an f that is a bijection. The Myhill isomorphism theorem states that A and B are recursively isomorphic if and only if A 1 B and B 1 A (see [18] Section I.5). Our coding will make use of the following familiar definitions from recursion theory: Definition 1.1. A ω ω is a Turing antichain if f T g for any distinct f, g A. Definition 1.2. A ω ω is independent if g T f 1 f n for any distinct g, f 1,..., f n A. Infinite independent sets exist. See [6] section II.3 for an example. An independent set is a Turing antichain Standard relational models of arithmetic. We describe what we mean by true arithmetic by defining the standard relational models of first-order, second-order, and third-order arithmetic. In what follows, equality is always part of the language and is always interpreted as true equality on ω. Equality on 2 ω and 2 2ω is defined in terms of membership via extensionality. The standard model of arithmetic is the structure N = ω,, +,. The relations ω 2, + ω 3, and ω 3 are interpreted as the usual less-than-or-equal-to, plus, and times. Variables x range over ω. The standard model of second-order arithmetic is the structure N 2 = ω, 2 ω,, +,,. The relations, +, and are interpreted as usual. The relation ω 2 ω is interpreted as membership. Variables x range over ω and variables X range over 2 ω. Th(N 2 ) denotes the theory of N 2, the set of all sentences in this language true in N 2. The standard model of third-order arithmetic is the structure N 3 = ω, 2 ω, 2 2ω,, +,, 2, 3. The relations, +, and are interpreted as usual. The relation 2 ω 2 ω is interpreted as second-order membership and the relation 3 2 ω 2 2ω is interpreted as third-order membership. Variables x range over ω, variables X range over 2 ω, and variables X range over 2 2ω. Th(N 3 ) denotes the theory of N 3, the set of all sentences in this language true in N 3. We consider arithmetic with + and as relations ω 3 instead of as the usual functions ω 2 ω because our coding methods most naturally code relations. Any formula in which + and are relation symbols can be trivially translated into an equivalent formula in which + and are

3 CODING TRUE ARITHMETIC IN THE MEDVEDEV AND MUCHNIK DEGREES 3 function symbols. Translations in the other direction require unnesting. In general, a formula is said to be unnested if all its atomic subformulas are of the form x = y, c = y, f(x 1,..., x n ) = y, or R(x 1,..., x n ), where x, y, and the x i are variables, c is a constant symbol, f is a function symbol, and R is a relation symbol. Every formula can be recursively translated into an equivalent unnested formula. See for example [4] section 2.6. When unnesting is applied to a first-order formula in the functional language of arithmetic, we get an equivalent formula whose atomic subformulas are of the form x = y x y x + y = z x y = z, which can easily be translated into a formula in the relational language of arithmetic. Unnesting second-order or third-order formulas is the same but allows additional atomic formulas x X (second-order case) or x 2 X and X 3 X (third-order case). Thus the functional and relational theories of second-order arithmetic are recursively isomorphic, as are the functional and relational theories of third-order arithmetic Mass problems and reducibilities. A mass problem is a set of functions A ω ω. We say mass problem A Medvedev reduces to mass problem B (written A M B) if there is a Turing functional Φ such that for every f B, Φ f computes a total function that is in A (written Φ(B) A). We say A and B are Medvedev equivalent (written A M B) if A M B and B M A. The relation M is an equivalence relation on 2 ωω, and the equivalence class [A] is called the Medvedev degree of A. Medvedev reducibility induces a partial order on degrees: [A] M [B] if and only if A M B. The structure M = (2 ωω / M, M ) introduced by Medvedev in [9] is called the Medvedev degrees. M is a lattice. For mass problems A and B, let A + B = {f g f A g B} A B = 0 A 1 B. Then join is given by [A] +[B] = [A + B] and meet is given by [A] [B] = [A B]. Th(M) denotes the first-order theory of the Medvedev degrees. We say mass problem A Muchnik reduces (or weakly reduces) to mass problem B (written A w B) if for every f B there is a g A with g T f. Muchnik reducibility is the non-uniform version of Medvedev reducibility. We say A and B are Muchnik equivalent (or weakly equivalent, written A w B) if A w B and B w A. The equivalence class [A] w is called the Muchnik degree of A. Muchnik reducibility induces a partial order on degrees [A] w, and this partial order is a lattice with join and meet computed as in the Medvedev case: [A] w +[B] w = [A + B] w and [A] w [B] w = [A B] w. Notice that in the Muchnik case A B w A B, so one may think of A B as being defined as A B in this case. The structure M w = (2 ωω / w, w ) introduced by Muchnik in [11] is called the Muchnik degrees. Th(M w ) denotes the first-order theory of the Muchnik degrees. M and M w both have a least element and a greatest element. In both lattices, ω ω has minimum degree. In fact, a mass problem has minimum degree if and only if it contains a recursive function. The empty mass problem has maximum degree, and it is the only such mass problem. M and M w are also both distributive lattices. That is, they satisfy x y z[x + (y z) = (x + y) (x + z)] and x y z[x (y + z) = (x y) + (x z)]. Sorbi s [22] is a good introduction to M and M w. We note that Lewis, Nies, and Sorbi [7] prove that M and M w are not elementary equivalent. Thus the theorem Th(M) 1 Th(M w ) is nontrivial. For the sake of definiteness, the official language of M (and of all lattices considered here) is that of partial orders. In any lattice, + and are first-order definable from, so we will freely use the symbols + and with the understanding that they are abbreviations for their first-order definitions. The notation Th(M) is also used to denote the collection of propositional formulas valid in M when studying M as a Brouwer algebra. In fact, this interpretation was the main motivation

4 4 PAUL SHAFER behind Medvedev s introduction of M in [9], and in [10] he proves that M provides semantics for intuitionistic logic plus the additional axiom p p (the so-called Jankov s logic [5]). There are many interesting results and problems in this direction. See for example [17], [20], [21], [23], and [13]. However, we do not consider propositional logics here, and for us the notation Th(M) always denotes the first-order theory of M. Our notation for join and meet in lattices conflicts with the notation for plus and times in arithmetic. The lattice join and meet operations are denoted in the literature variously as +,, as,, and confusingly as,. We prefer to conflict with the arithmetic notation rather than the logical notation Mass problems and topology. We consider Baire space ω ω and Cantor space 2 ω, both with their usual product topologies. Basic open sets in ω ω have the form I(σ) = {f ω ω σ f} for σ ω <ω, and similarly for 2 ω. If A ω ω is closed, then A is the set of paths through the tree T ω <ω defined by T = {σ ( f A)[σ f]}. Conversely, if T ω <ω is a tree, then the set of paths through T is a closed subset of ω ω. A set A ω ω is compact if and only if it is closed and bounded if and only if it is the set of paths through a finitely branching tree (here bounded means there is a g : ω ω such that f(n) g(n) for all f A and n ω). A Medvedev degree is said to be closed (compact) if it is of the form [A] where A is closed (compact) in ω ω. By inspecting the definitions, one can check that if A and B are closed (compact) then so are 0 A 1 B and {f g f A g B}. Thus the closed Medvedev degrees form a distributive sublattice of M which we denote by M cl, and the compact Medvedev degrees form a distributive sublattice of M (and of M cl ) which we denote by M 01 cl, both as in [8] (the 01 notation is explained below). Both M cl and M 01 cl inherit the least element and the greatest element from M. Th(M cl ) denotes the first-order theory of M cl, and Th(M 01 cl ) denotes the first-order theory of M01 cl. Similarly, a Muchnik degree is said to be closed (compact) if it is of the form [A] w where A is closed (compact) in ω ω. The closed (compact) Muchnik degrees form a distributive sublattice of M w denoted by M w,cl (M 01 w,cl ). M01 w,cl is also a distributive sublattice of M w,cl. Both M w,cl and M 01 w,cl inherit the least element and the greatest element from M w. Th(M w,cl ) denotes the first-order theory of M w,cl, and Th(M 01 w,cl ) denotes the first-order theory of M01 w,cl. The closed subsets of ω ω (and of 2 ω ) are the topologically simplest classes which yield non-trivial degree structures because every nonempty open set contains a recursive function. As such, they are worthy objects of study. For example, Bianchini and Sorbi [1] studied the filter (in M) generated by the nonminimum closed degrees. Lewis, Shore, and Sorbi [8] have made a recent study of topologically-defined collections of Medvedev degrees. In general, every A ω ω is Medvedev equivalent (and hence also Muchnik equivalent) to some B 2 ω : Lemma 1.3. If A ω ω then there is a B 2 ω with A M B. Proof. For f ω ω, let graph f ω denote { n, m f(n) = m} Given A, let B = {graph f f A}. Let Φ be the functional such that Φ f ( n, m ) = 1 if f(n) = m and Φ f ( n, m ) = 0 otherwise. Then Φ f = graph f for all f. Thus Φ(A) = B. Let Ψ be the functional such that Ψ g (n) searches for an m such that g( n, m ) = 1 and outputs such an m if it is found. If g is the characteristic function of graph f, then Ψ g is total and equals f. Hence Ψ(B) = A. If we let M 01 denote the Medvedev degrees of mass problems A 2 ω and let M 01 w denote the Muchnik degrees of mass problems A 2 ω, then Lemma 1.3 says M = M 01 and M w = M 01 w. However, if A ω ω is closed, the B 2 ω produced by Lemma 1.3 need not be. Turing functionals are continuous, but ω ω and 2 ω are not homeomorphic. Nevertheless, if A ω ω is compact, Lemma 1.3 produces a closed B 2 ω. So every compact A ω ω is Medvedev equivalent (and hence also Muchnik equivalent) to a closed (hence compact) B 2 ω. This explains the notations M 01 cl and for the collections of compact degrees. M 01 w,cl

5 CODING TRUE ARITHMETIC IN THE MEDVEDEV AND MUCHNIK DEGREES 5 We will prove that neither M cl nor M 01 cl are elementarily equivalent to either M w,cl or M 01 w,cl (Theorem 6.3 below). The relationship between M cl and M 01 cl and the relationship between M w,cl and M 01 w,cl require further study. Question 1.4. Is every closed X ω ω Medvedev equivalent to some closed Y 2 ω? If not, are M cl and M 01 cl isomorphic? If not, are M cl and M 01 cl elementarily equivalent? Is every closed X ω ω Muchnik equivalent to some closed Y 2 ω? If not, are M w,cl and M 01 w,cl isomorphic? If not, are M w,cl and M 01 w,cl elementarily equivalent? Our topological considerations of Medvedev reducibility are consequences of the familiar use property (see [6] section I.3): If Φ f (m) = n, then there is a finite σ f such that σ contains all the answers to the oracle queries made during the computation of Φ f (m) = n. This is written Φ σ (m) = n and implies Φ g (m) = n for any g σ. The starting point is the following simple lemma: Lemma 1.5. Let m, n ω. For any program Φ, the set {f ω ω Φ f (m) = n} is open. If Φ f is total for all f A, then {f A Φ f (m) = n} is clopen in A (i.e. it is both the intersection of A with a set open in ω ω and the intersection of A with a set closed in ω ω ). Proof. If Φ f (m) = n, then by the use property there is some σ f such that Φ σ (m) = n. Hence {f ω ω Φ f (m) = n} = {I(σ) Φ σ (m) = n}. If Φ is total on A, then {f A Φ f (m) = n} = A {f ω ω Φ f (m) = n} = A ( i n {f ω ω Φ f (m) i} ). The last equality holds because if Φ f is total and Φ f (m) i for all i n, then it must be that Φ f (m) = n. 2. Interpreting the Medvedev degrees and the Muchnik degrees in arithmetic In this section we prove that Th(M), Th(M w ) 1 Th(N 3 ) and also that Th(M cl ), Th(M 01 cl ), Th(M w,cl ), Th(M 01 w,cl ) 1 Th(N 2 ). The reductions Th(M), Th(M w ) 1 Th(N 3 ) follow from the fact that every mass problem A is equivalent to some B 2 ω (i.e. Lemma 1.3) and that the Medvedev and Muchnik reducibilities are definable in N 3. Lemma 2.1. Th(M), Th(M w ) 1 Th(N 3 ). Proof. The relation R(X, e, m, n) expressing Φ X e (m) = n is definable by a formula which says there exists a number s coding a sequence of configurations witnessing the computation Φ X e (m) = n. The relation S(X, Y, e) expressing Φ X e = Y is definable by the formula m[(m Y R(X, e, m, 1)) (m / Y R(X, e, m, 0))]. Thus the relation A M B is definable by the formula ϕ(a, B) := e X[X B Y (Y A S(X, Y, e))]. Now, given a sentence ψ in the language of partial orders, produce a sentence ψ in the language of N 3 by replacing quantifications x and x with third-order quantifications X and X, by replacing atomic formulas x y with ϕ(x, Y), and by replacing atomic formulas x = y with ϕ(x, Y) ϕ(y, X ). Then N 3 = ψ if and only if M = ψ. The reduction Th(M w ) 1 Th(N 3 ) is obtained by switching the quantifiers e and X in the definition of the formula ϕ above. The interpretations of M cl and M w,cl (M 01 cl and M 01 w,cl ) in N 2 rely on the fact that A ω ω (A 2 ω ) is closed if and only if it is the set of paths through some tree T ω <ω (T 2 <ω ). Thus we quantify over all closed mass problems by quantifying over all trees. So fix some definable coding of sequences, trees, and functions in N 2. See [16] section II.2 for a particularly careful method.

6 6 PAUL SHAFER Lemma 2.2. Th(M cl ), Th(M 01 cl ), Th(M w,cl), Th(M 01 w,cl ) 1 Th(N 2 ). Proof. The relation P (f, T ) expressing function f is a path through tree T is definable by the formula n σ(σ T σ = n ( i < σ )[σ(i) = f(i)]). Relations R(f, e, m, n) expressing Φ f e (m) = n and S(f, g, e) expressing Φ f e = g are definable as in Lemma 2.1. Thus the relation T M S (expressing that the set of paths through T Medvedev reduces to the set of paths through S) is definable by the formula ϕ(t, S) := e f[p (f, S) g(p (g, T ) S(f, g, e))]. Now, given a sentence ψ in the language of partial orders, produce a sentence ψ in the language of N 2 by replacing quantifications x and x with second-order quantifications T x and T x quantifying over trees T x ω <ω, by replacing atomic formulas x y with ϕ(t x, T y ), and by replacing atomic formulas x = y with ϕ(t x, T y ) ϕ(t y, T x ). Then N 2 = ψ if and only if M cl = ψ. The reduction Th(M 01 cl ) 1 Th(N 2 ) is exactly the same, except we quantify over trees T 2 <ω. The reductions Th(M w,cl ), Th(M 01 w,cl ) 1 Th(N 2 ) are obtained by switching the quantifiers e and f in the definition of the formula ϕ above. 3. Interpreting arithmetic in the Medvedev degrees and in the Muchnik degrees In this section we prove Th(N 3 ) 1 Th(M w ) 1 Th(M), thereby completing the proof that all three theories are pairwise recursively isomorphic. The proof of Th(N 3 ) 1 Th(M w ) is also valid with M in place of M w. This makes the Th(M w ) 1 Th(M) step unnecessary, but the definability of M w in M is still worthwhile to notice Defining M w in M. The Muchnik degrees are definable in the Medvedev degrees [2], thereby giving Th(M w ) 1 Th(M). Definition 3.1. For a mass problem A, let C(A) denote the Turing upward-closure of A: C(A) = {f ( g A)[g T f]}. Definition 3.2. A Medvedev degree s is called a degree of solvability if s = [{f}] for some f ω ω. Definition 3.3. A Medvedev degree m is called a Muchnik degree if m = [C(A)] for some mass problem A. Notice that C(A) M B if and only if B C(A). Medvedev degrees of the form [C(A)] are called Muchnik degrees because A w B if and only if C(B) C(A) if and only if C(A) M C(B). The mapping [A] w [C(A)] embeds M w into M as an upper-semilattice but not as a lattice [19]. Lemma 3.4 (Medvedev [9], Dyment [2]). The degrees of solvability and the Muchnik degrees are definable in M. The formula defining the degrees of solvability is θ(x) := y[x < y z(x < z y z)]. For a degree of solvability x = [{f}], the witnessing y is the degree [{e g Φ g e = f g T f}]. Complete proofs that θ defines the degrees of solvability are found in [2] and [22]. We reproduce the definability of the Muchnik degrees here. The result essentially appears in [2], but is not phrased in terms of definability. Proof that the Muchnik degrees are definable in M. The defining formula is χ(x) := y[ z[(θ(z) y z) x z] x y], where θ is the formula defining the degrees of solvability as above. Let [C(A)] be a Muchnik degree. If B satisfies ( f ω ω )[B M {f} C(A) M {f}], then in particular we must have C(A) M {f} for all f B. Hence B C(A) and so χ([c(a)]) holds. Conversely, suppose χ([a]). As ( f ω ω )[C(A) M {f} A M {f}], we have A M C(A). Thus A M C(A), so [A] is a Muchnik degree. Corollary 3.5. Th(M w ) 1 Th(M).

7 CODING TRUE ARITHMETIC IN THE MEDVEDEV AND MUCHNIK DEGREES 7 Proof. Interpret Th(M w ) inside Th(M) by restricting quantification in M to quantify only over degrees of the form [C(A)]. That is, given a sentence ψ in the language of partial orders, generate a sentence ψ by inductively replacing subformulas xϕ and xϕ by formulas x(χ(x) ϕ) and x(χ(x) ϕ). Then M w = ψ if and only if M = ψ. In M w, a degree s is also called a degree of solvability if s = [{f}] w for some f ω ω. The formula θ(x) as above defines the degrees of solvability in M w, and the proof is similar to that for M Defining a code for N 3. We code N 3 into M w to prove that Th(N 3 ) 1 Th(M w ). Although we phrase what follows in terms of M w, the same coding can be used to code N 3 into M and thus to prove Th(N 3 ) 1 Th(M) without appealing to the definability of M w in M. We view each degree w as coding the set of minimal degrees of solvability above it. Degree s is a minimal degree of solvability above w if and only if η(s, w) where η(s, w) := θ(s) w s z[(θ(z) w z) z s] and θ(x) is the formula defining the degrees of solvability from Lemma 3.4. Definition 3.6. For w M w, E(w) = {s M w η(s, w)} denotes the set of minimal degrees of solvability above w. Our coding makes use of the following obvious lemma: Lemma 3.7. If W is a Turing antichain, then E([W] w ) = {[{f}] w f W}. Proof. Obvious Definition 3.8. A code for N 3 in M w is a collection of degrees w 0, w 1, w 2, m, l, p, t, r M w such that: (i) For every degree a there is an s E(r) such that for all u E(w 0 ), u E(a) if and only if u w s. (ii) If R is the following 2-ary relation defined on E(w 0 ) 2 and R + and R are the following 3-ary relations defined on E(w 0 ) 3 : R (s 0, u 0 ) if and only if there is a u 1 E(w 1 ) with u 0 + u 1 E(m) and s 0 + u 1 E(l), R + (s 0, u 0, v 0 ) if and only if there is a u 1 E(w 1 ) and a v 2 E(w 2 ) with u 0 + u 1 E(m), v 0 + v 2 E(m), and s 0 + u 1 + v 2 E(p), R (s 0, u 0, v 0 ) if and only if there is a u 1 E(w 1 ) and a v 2 E(w 2 ) with u 0 + u 1 E(m), v 0 + v 2 E(m), and s 0 + u 1 + v 2 E(t), then M w satisfies the formula that says E(w 0 ) is a discretely ordered commutative semiring with unity and for every a M w, if there is an s E(a) E(w 0 ), then there is a least such s, where, +, and are interpreted as R, R +, and R respectively. The property w 0, w 1, w 2, m, l, p, t, r is a code for N 3 in M w is first-order definable. The relation s E(w) is defined by the first-order formula η(s, w). By inspecting Definition 3.8, we see that the property in item (i) is first-order and that the relations R, R +, and R in item (ii) are first-order. The axioms of a discretely ordered commutative semiring with unity are first-order, so if we change these axioms to make quantification be over E(w 0 ) and to make, +, and be interpreted as the relations R, R +, and R respectively, we have a first-order formula in the language of partial orders expressing that E(w 0 ) is a discretely ordered commutative semiring with unity. Therefore the property in item (ii) is also first-order. In Definition 3.8, think w for ω, m for match, l for less, p for plus, t for times, and r for reals. Our intention is that w 0 codes ω as E(w 0 ) and that the auxiliary degrees w 1, w 2, m, l, p, t code, +, on E(w 0 ). The idea is that, for s and u in some E(w), we would like to code the tuple (s, u) as the degree s + u. However, with this coding we would not be able to tell (s, u) from (u, s) because s + u = u + s. To fix this problem, we let w 0 code both the true ω and

8 8 PAUL SHAFER the first-coordinate version of ω, and we introduce w 1 and w 2 to code second- and third-coordinate versions of ω. The degree m matches first-coordinate numbers with their corresponding secondand third-coordinate numbers. We think of u 0 E(w 0 ) and u 1 E(w 1 ) as coding the same number if u 0 + u 1 E(m). Similarly, v 0 E(w 0 ) and v 2 E(w 2 ) code the same number if v 0 + v 2 E(m). Now, for s 0, u 0 E(w 0 ), if there is a u 1 E(w 1 ) with u 0 + u 1 E(m), then we can code the tuple (s 0, u 0 ) as s 0 + u 1. For example, in item (ii) of Definition 3.8, R (s 0, u 0 ) holds if and only if there is a second-coordinate version of u 0 (called u 1 ) such that s 0 + u 1 E(l). Similarly, R + (s 0, u 0, v 0 ) holds if and only if there are a second-coordinate version of u 0 (called u 1 ) and a third-coordinate version of v 0 (called v 2 ) such that s 0 + u 1 + v 2 E(p). The degree m need not code bijections (or even functions) between E(w 0 ) and E(w 1 ) and between E(w 0 ) and E(w 2 ). However, this is irrelevant because the definitions of the relations R, R +, and R make sense for any degree m. A degree a codes the set E(a) E(w 0 ) E(w 0 ). Every subset of E(w 0 ) has a code: If X E(w 0 ), then for each s X fix an f s ω ω such that s = [{f s }] w. Let A = {f s s X} and let a = [A] w. A is a Turing antichain, so E(a) = X by Lemma 3.7. Thus a is a code for X. We then quantify over all subsets of E(w 0 ) by quantifying over all degrees a and interpreting each as a subset of E(w 0 ). Therefore item (ii) above ensures that, for a code for N 3 in M w, the structure E(w 0 ), R, R +, R is a well-founded model of arithmetic and as such is isomorphic to N. A degree b can also be interpreted as coding a subset S(b) of 2 E(w0) as follows. Definition 3.9. For w 0 as in a code for N 3 in M w and b M w, S(b) = {X E(w 0 ) ( s E(b))( u E(w 0 ))[u X u w s]}. Let π(a, b, w) be the formula π(a, b, w) := ( s E(b))( u E(w))[u E(a) u s]. We write a S(b) for π(a, b, w 0 ), which expresses that the subset of E(w 0 ) coded by a is an element of the subset of 2 E(w0) coded by b. Every subset of 2 E(w0) has a code: If X 2 E(w0) then for each X X fix a degree a X with E(a X ) E(w 0 ) = X. Then by item (i), for each a X find a degree s X E(r) such that ( u E(w 0 ))[u E(a X ) u w s X ]. For each s X, fix f X ω ω such that s X = [{f X }] w. Let b = [{f X X X }] w. Then S(b) = X. We have seen that, for a code for N 3 in M w, every degree can be interpreted as a subset of E(w 0 ) and as a subset of 2 E(w0). Moreover, quantifying over all degrees quantifies over all subsets of E(w 0 ) and quantifies over all subsets of 2 E(w0). Thus for a code for N 3 in M w, the coded structure is exactly E(w 0 ), 2 E(w0), 2 2E(w 0 ), R, R +, R, and this structure is isomorphic to N 3. As discussed above, there is a sentence in the language of partial orders expressing the existence of a code for N 3. Given a sentence ψ in the language of N 3, we translate it into a sentence in the language of partial orders that says there is a code for N 3 in M w and ψ is true in the coded structure. It remains to prove the existence of such a code Finding a code for N 3 in M w. The crucial point is the existence of the degree r coding 2 2ω. The following lemma is proved using standard recursion theoretic techniques: Lemma If A = {f i i ω} is a countable independent set, then there exists a Turing antichain R = {g X X 2 ω } such that {f i i X} = {f A f T g X } for each X 2 ω. Proof. We construct partial functions g σ : ω ω for σ 2 <ω and put g X = n ω g X n. The g σ will have the following properties: (i) If σ τ then dom g σ dom g τ and the two functions agree on their common domain. (ii) If s < σ and σ(s) = 0 then g σ ( s, j ) is defined for all j and equals 0 for all but finitely many j. (iii) If s < σ and σ(s) = 1 then g σ ( s, j ) is defined for all j and equals f s (j) for all but finitely many j.

9 CODING TRUE ARITHMETIC IN THE MEDVEDEV AND MUCHNIK DEGREES 9 (iv) g σ ( s, j ) is defined for only finitely many s, j with s σ. Items (i) (iii) ensure that each g X is a total function, and item (iii) ensures f s T g X for all s X. In addition we satisfy the following requirements for all e, i ω and all X, Y ω: Re,i X : i / X Φg X e f i Q X,Y e : X Y Φ g X e g Y Let g =. At stage s we have g σ for all σ of length s. At stage s = 2 e, i we handle requirement Re,i X. For each σ of length s do the following: If σ(i) = 0, if there is a finite partial function h σ with domain disjoint from g σ, and if there is a number n such that Φ gσ hσ e (n) f i (n), then redefine g σ to be g σ h σ. Then for each σ of length s put g σ 0 = g σ { s, j, 0 s, j / dom g σ } and put g σ 1 = g σ { s, j, f s (j) s, j / dom g σ }. At stage s = 2e+1 we handle requirement Q X,Y e. List the pairs (σ, τ) with σ = τ = s and σ τ. For each such (σ, τ) do the following: Let n be least such that n / dom g τ. If there is a finite partial function h σ with domain disjoint from g σ and if there is a number m such that Φ gσ hσ e (n) = m, then redefine g σ to be g σ h σ and redefine g τ to be g τ { n, m + 1 }. After these extensions are made for each pair (σ, τ), then for each σ of length s put g σ 0 = g σ { s, j, 0 s, j / dom g σ } and put g σ 1 = g σ { s, j, f s (j) s, j / dom g σ }. We verify i / X f i T g X. Suppose that i / X and Φ g X e = f i. Consider stage s = 2 e, i of the construction. Let σ = X s and let f = {f t t < s σ(t) = 1}. The function f computes the graph of the partial function g σ. Thus we can use f to simulate the computation Φe gσ h (n) for any finite partial function h with domain disjoint from g σ. We now have the contradiction f i T f as follows: Given input n, use f to search for a finite partial function h with domain disjoint from g σ such that Φ gσ h e (n) = m for some m. There must be such an h because g X extends g σ and Φ g X e (n). Moreover, we must have m = f i (n). Otherwise at stage s we would have been able to find an h σ such that Φ gσ hσ e (n) = f i (n), and this would imply Φ g X e f i. We verify X Y g Y T g X. Suppose for a contradiction that Φ g X = g Y. Choose an index e for Φ greater than the least e such that X(e) Y (e), put s = 2e + 1, and let σ = X s, τ = Y s. Consider the g σ and g τ we have right before we process the pair (σ, τ) in stage s. Let n be least such that n / dom g τ. Since g X extends g σ and Φ g X e is total, we must have found a finite h σ and number m such that Φ gσ hσ e (n) = m. But then we extended g τ so that g τ (n) = m + 1. Thus Φ g X e (n) = m g Y (n), a contradiction. Lemma There is a code for N 3 in M w. Proof. Let W 0 = {f 0,i i ω}, W 1 = {f 1,i i ω}, and W 2 = {f 2,i i ω} be such that W 0 W 1 W 2 is independent, M = {f 0,i f 1,i i ω} {f 0,i f 2,i i ω}, L = {f 0,i f 1,j i j}, P = {f 0,i f 1,j f 2,k i + j = k}, T = {f 0,i f 1,j f 2,k i j = k}, by Lemma 3.10, let R = {g X X 2 ω } be a Turing antichain such that {f 0,i W 0 i X} = {f 0,i W 0 f 0,i T g X } for each X 2 ω. Put w 0 = [W 0 ] w, w 1 = [W 1 ] w, w 2 = [W 2 ] w, m = [M] w, l = [L] w, p = [P] w, t = [T ] w, r = [R] w. We check the two cases of Definition 3.8. Notice that the above mass problems are all Turing antichains. (i) Given a degree a, let X = {i [{f 0,i }] w E(a) E(w 0 )} and let s = [{g X }] w. Then s E(r) and ( u E(w 0 ))[u E(a) u w s]. (ii) For [{f 0,i }] w, [{f 0,j }] w E(w 0 ) we have R ([{f 0,i }] w, [{f 0,j }] w ) if and only if there is a u 1 E(w 1 ) with [{f 0,j }] w + u 1 E(m) and [{f 0,i }] w + u 1 E(l). By the independence

10 10 PAUL SHAFER of W 0 W 1 W 2 and Lemma 3.7, this happens if and only if u 1 = [{f 1,j }] w and i j. Thus R ([{f 0,i }] w, [{f 0,j }] w ) if and only if i j. Similarly R + ([{f 0,i }] w, [{f 0,j }] w, [{f 0,k }] w ) if and only if i + j = k and R ([{f 0,i }] w, [{f 0,j }] w, [{f 0,k }] w ) if and only if i j = k. Hence E(w 0 ) is a discretely ordered commutative semiring with unity. Moreover, if E(a) E(w 0 ) is nonempty, then there is a least i for which s = [{f 0,i }] w is in E(a) E(w 0 ). This s is the R -least element of E(a) E(w 0 ). We are ready to interpret N 3 in M w. Lemma Th(N 3 ) 1 Th(M w ). Proof. Let ϕ be a sentence in the language of N 3. Each atomic subformula of ϕ has one of the following forms: x = y x y x + y = z x y = z x 2 X X 3 X. Now let ϕ (w 0, w 1, w 2, m, l, p, t, r) be the formula (with the displayed variables free) in the language of partial orders obtained from ϕ by making the replacements below. The second-order variable X in ϕ corresponds to the variable v X in ϕ and the third-order variable X in ϕ corresponds to the variable v X in ϕ. Replace x y by the formula defining R (x, y). Replace x + y = z by the formula defining R + (x, y, z). Replace x y = z by the formula defining R (x, y, z). Replace x 2 X by the formula expressing x E(v X ). Replace X 3 X by the formula expressing v X S(v X ). Replace quantifiers x and x by x E(w 0 ) and x E(w 0 ). Replace quantifiers X and X by v X and v X. Replace quantifiers X and X by v X and v X. Let ψ be the sentence saying there is a code w 0, w 1, w 2, m, l, p, t, r for N 3 in M w and ϕ (w 0, w 1, w 2, m, l, p, t, r). A code for N 3 in M w codes a structure isomorphic to N 3, and so M w = ψ if and only if N 3 = ϕ. Theorem 3.13 (Independently by Lewis, Nies, and Sorbi [7]). Th(M w ) 1 Th(M) 1 Th(N 3 ). Proof. We have Th(M) 1 Th(N 3 ) by Lemma 2.1, Th(M w ) 1 Th(M) by Corollary 3.5, and we have Th(N 3 ) 1 Th(M w ) by Lemma Interpreting arithmetic in the closed and compact Muchnik degrees Our coding of third-order arithmetic in M w relied on the definability of the degrees of solvability in M w. The definability of degrees of solvability in M cl, M 01 cl, M w,cl, and M 01 w,cl would give an immediate proof of Th(N 2 ) 1 Th(M cl ), Th(M 01 cl ), Th(M w,cl), Th(M 01 w,cl ). This is because the Turing degrees are isomorphic to the degrees of solvability and because the first-order theory of the Turing degrees is recursively isomorphic to Th(N 2 ) [15]. Singleton mass problems {f} are compact, so the degrees of solvability are in M cl, M 01 cl, M w,cl, and M 01 w,cl. However, we do not know if the degrees of solvability are definable in any of these structures. Question 4.1. Are the degrees of solvability definable in M cl, M 01 cl, M w,cl, or M 01 w,cl? In this section we prove that Th(N 2 ) 1 Th(M w,cl ), Th(M 01 w,cl ), and in Section 5 we prove that Th(N 2 ) 1 Th(M cl ), Th(M 01 cl ). We will use the same definition of a code for N 2 (Definition 4.6 below) in all four cases. The difference between the Muchnik cases and the Medvedev cases is in how we prove that each subset of ω has a code.

11 CODING TRUE ARITHMETIC IN THE MEDVEDEV AND MUCHNIK DEGREES Defining a code for N 2. In Section 3, a degree w coded the set of minimal degrees of solvability above it. Now a degree w codes the set of minimal meet-irreducible degrees that meet to it. Definition 4.2. An element of a lattice is called meet-reducible if it satisfies the formula θ(x) := y z(x < y x < z x = y z). An element of a lattice is called meet-irreducible if it is not meet-reducible. We will take advantage of the following easily checkable fact: In a distributive lattice, if x is meet-irreducible and x y z, then x y or x z. Definition 4.3. For elements s and w of a lattice, we say s meets to w if s and w satisfy the formula χ(s, w) := y(y > w s y = w). Hence for s and w in a lattice, s is a minimal meet-irreducible that meets to w if and only if η(s, w) where η(s, w) := θ(s) χ(s, w) y[y < s (w y θ(y))]. Definition 4.4. For a lattice L and an element w L, F (w) = {s L s w} denotes the set of elements above w and Ẽ(w) = {s L η(s, w)} denotes the set of minimal meet-irreducibles that meet to w. Notice that Ẽ(w) is an antichain by the minimality of its elements. Keep in mind that the lattices we now consider are M w,cl and M 01 w,cl and that meet-reducible means meet-reducible in these lattices. If a closed (compact) W has meet-reducible degree in M w,cl (M 01 w,cl ), then it has meet-reducible degree in M w. However, we do not know the converse. Question 4.5. If W is closed (compact) and W w X Y for X, Y > w W, then are there closed (compact) such X and Y? The converse does hold in the Medvedev cases: A closed (compact) W has meet-reducible degree in M cl (M 01 cl ) if and only if it has meet-reducible degree in M. See Lemma 5.1 below. Definition 4.6. Let L be one of M cl, M 01 cl, M w,cl, M 01 w,cl. A code for N 2 in L is a collection of degrees w 0, w 1, w 2, m, l, p, t L such that if R is the following 2-ary relation defined on Ẽ(w 0) 2 and R + and R are the following 3-ary relations defined on Ẽ(w 0) 3 : R (s 0, u 0 ) if and only if there is a u 1 Ẽ(w 1) with u 0 + u 1 Ẽ(m) and s 0 + u 1 Ẽ(l), R + (s 0, u 0, v 0 ) if and only if there is a u 1 Ẽ(w 1) and a v 2 Ẽ(w 2) with u 0 + u 1 Ẽ(m), v 0 + v 2 Ẽ(m), and s 0 + u 1 + v 2 Ẽ(p), R (s 0, u 0, v 0 ) if and only if there is a u 1 Ẽ(w 1) and a v 2 Ẽ(w 2) with u 0 + u 1 Ẽ(m), v 0 + v 2 Ẽ(m), and s 0 + u 1 + v 2 Ẽ(t), then L satisfies the formula that says Ẽ(w 0) is a discretely ordered commutative semiring with unity and for every a L, if there is an s F (a) Ẽ(w 0), then there is a least such s, where, +, and are interpreted as R, R +, and R respectively. We think of w 0 as coding ω as Ẽ(w 0) and any degree a as coding F (a) Ẽ(w 0) Ẽ(w 0). If we can show that every subset of Ẽ(w 0) has a code, then we will know that the coded structure is exactly Ẽ(w 0), 2Ẽ(w 0), R, R +, R and is isomorphic to N 2. In fact, it suffices to show that every countable subset of Ẽ(w 0) has a code. This is because if there is a nonempty S Ẽ(w 0) with no R -least element, then there is a countable such S. So if every countable subset of Ẽ(w 0) has a code and every nonempty coded subset of Ẽ(w 0) has an R -least element, then Ẽ(w 0), R, R +, R is a well-founded model of arithmetic and, as such, is isomorphic to N. In particular, Ẽ(w 0 ) is

12 12 PAUL SHAFER countable, so every subset is countable and hence has a code. Our attention now turns to finding these codes Coding subsets of ω in M w,cl and M 01 w,cl. It is well-known that M w is a complete lattice. That is, every arbitrary collection of degrees S M w has a least upper bound and a greatest lower bound. Let X i i I be a selection of one representative for each degree in S. Then the least upper bound of S is [ i I C(X i) ] w and the greatest lower bound of S is [ i I C(X i) ] w (which equals [ i I X ] i w ). In M w,cl and M 01 w,cl, arbitrary countable collections of degrees have greatest lower bounds. This fact allows us to code all countable subsets of an Ẽ(w). Lemma 4.7. Both M w,cl and M 01 w,cl are countably meet-complete. Proof. For M w,cl, let {x i i ω} M w,cl be a countable set of degrees and let X i ω ω be a closed representative of x i for each i. The degree a = [ i ω i X i ]w is in M w,cl and is a lower bound for the degrees x i. Suppose b is any other lower bound for the x i and let B be a representative for b. Then B w X i for each i which means ( i ω)( f X i )( g B)[g T f]. So ( f )( i ω i X i g B )[ g T f ]. Hence b w a. The above proof does not work for M 01 w,cl because i ω i X i is not compact. We provide a modified proof for M 01 w,cl. Let {x i i ω} M 01 w,cl be a countable set of degrees and let X i 2 ω be a closed representative of x i for each i. Choose any g in any non-empty X i (if all the X i are empty, then [ ] w is the greatest-lower-bound). Let σ i = (g i) (1 g(i)) for each i ω. The set A = {g} ( i ω σ i X ) i is closed in 2 ω, so let a = [A] w. Then a M 01 w,cl and the rest of the proof proceeds as in the M w,cl case. In contrast, M, M cl, and M 01 cl are not countably complete, as shown by Dyment s Lemma 6.2 below. Lemma 4.8. Let L be M w,cl or M 01 w,cl. Then for any w L and any at-most-countable S Ẽ(w) there is an a L such that F (a) Ẽ(w) = S. Proof. In either case take a to be the greatest-lower-bound of S by Lemma 4.7. This ensures S F (a) Ẽ(w). To see equality, let x Ẽ(w) S and let y be such that y > w w and x y = w. If s S, then s w x because Ẽ(w) is an antichain. Thus s w y for all s S because s is meet-irreducible and s w w = x y for all s S. Therefore a w y which implies x w a. It is possible for Ẽ(w) to be uncountable for w M w,cl or w M 01 w,cl. This is in contrast to the Medvedev cases, in which Ẽ(w) is always at most countable (see Corollary 5.3 below). Lemma 4.9. If W ω ω (W 2 ω ) is a closed Turing antichain, then, in M w,cl (M 01 w,cl ), Ẽ([W] w) = {[{f}] w f W}. Proof. Assume in both cases that W > 1, for otherwise the lemma is trivial. For M w,cl, let W ω ω be closed and a Turing antichain, and let f W. Let T be a tree whose set of paths is W. Let τ i i ω list the sequences in T that are not initial segments of f (so that, for g W, g f i[τ i g]). Let T i denote the full subtree of T rooted at τ i : T i = {σ ω <ω τ i σ T }. Let R be the tree i ω i T i where i T i = {i σ σ T i } for each i. Let Y be the set of paths through R. If, for a mass problem A, we let deg T A = {deg T f f A} denote the set of Turing degrees of the members of A, we see that deg T Y = deg T W {deg T f}. From this and the fact that W is a Turing antichain, it follows that Y > w W and W w {f} Y. Hence [{f}] w is meet-irreducible and meets to [W] w. We need to show that [{f}] w is minimal. First suppose that B w W is closed and has meet-irreducible degree in M w,cl. We claim B w {f} implies {f} w B. We have B w {f} or B w Y because B w W w {f} Y and B has meet-irreducible

13 CODING TRUE ARITHMETIC IN THE MEDVEDEV AND MUCHNIK DEGREES 13 degree. But B w {f}, so we must have B w Y. Thus {f} w B because {f} w Y. Therefore, if we have a closed B of meet-irreducible degree in M w,cl with W w B w {f}, then the contrapositive of the claim tells us {f} w B. Thus [{f}] w is minimal, making [{f}] w Ẽ([W] w). Conversely, suppose for a contradiction that B is closed and [B] w Ẽ([W] w), but B w {f} for all f W. By the claim, we also have {f} w B for all f W. Then if C is closed such that W w B C, it must be that {f} w C for all f W. Hence W w C. So for any closed C such that W w B C we have W w C. This contradicts that [B] w meets to [W] w. Thus if b Ẽ([W] w), we must have b w [{f}] w for some f W. But [{f}] w Ẽ([W] w), hence b = [{f}] w by minimality. For M 01 w,cl, let W 2ω be closed and a Turing antichain, and let f W. Let T be a tree whose set of paths is W. Let τ i i ω list the sequences in T that are not initial segments of f. Let T i denote the full subtree of T rooted at τ i. Choose any g W {f}. Let σ i = (g i) (1 g(i)) for each i ω. Let R be the tree i ω σ i T i. Let Y be the set of paths through R. Then deg T Y = deg T W {deg T f}. The proof now proceeds exactly as in the M w,cl case. Corollary Let L be M w,cl or M 01 uncountable. w,cl. Then there is a degree w L such that Ẽ(w) is Proof. In either case, let T 2 <ω be a perfect tree whose set of paths is a Turing antichain, and let w be the degree of this set of paths. See [18] Section VI.1 for the construction of such a tree Finding a code for N 2 in M w,cl. Definition 4.11 (Dyment [2]). W ω ω is called effectively discrete if ( f W)( g W)[f g f(0) g(0)]. An effectively discrete mass problem is closed and at most countable. Lemma There is a code for N 2 in M w,cl. Proof. Let W 0 = {i f 0,i i ω}, W 1 = {i f 1,i i ω}, and W 2 = {i f 2,i i ω} be such that W 0 W 1 W 2 is independent, M = {(2i) (f 0,i f 1,i ) i ω} {(2i + 1) (f 0,i f 2,i ) i ω}, L = { i, j (f 0,i f 1,j ) i j}, P = { i, j, k (f 0,i f 1,j f 2,k ) i + j = k}, T = { i, j, k (f 0,i f 1,j f 2,k ) i j = k}. The above mass problems are effectively discrete Turing antichains. Put w 0 = [W 0 ] w, w 1 = [W 1 ] w, w 2 = [W 2 ] w, m = [M] w, l = [L] w, p = [P] w, t = [T ] w. The verification that these degrees satisfy Definition 4.6 is the same as the verification that the corresponding degrees defined in Lemma 3.11 satisfy case (ii) of Definition 3.8. Use Lemma 4.9 in place of Lemma 3.7. We are ready to interpret N 2 in M w,cl. Lemma Th(N 2 ) 1 Th(M w,cl ). Proof. Let ϕ be a sentence in the language of N 2. Each atomic subformula of ϕ has one of the following forms: x = y x y x + y = z x y = z x X. Now let ϕ (w 0, w 1, w 2, m, l, p, t) be the formula (with the displayed variables free) in the language of partial orders obtained from ϕ by making the replacements below. The second-order variable X in ϕ corresponds to the variable v X in ϕ. Replace x y by the formula defining R (x, y). Replace x + y = z by the formula defining R + (x, y, z).

14 14 PAUL SHAFER Replace x y = z by the formula defining R (x, y, z). Replace x X by the formula expressing x F (v x ). Replace quantifiers x and x by x Ẽ(w 0) and x Ẽ(w 0). Replace quantifiers X and X by v X and v X. Let ψ be the sentence saying there is a code w 0, w 1, w 2, m, l, p, t, for N 2 in M w,cl and ϕ (w 0, w 1, w 2, m, l, p, t). A code for N 2 in M w,cl codes a structure isomorphic to N 2, and so M w,cl = ψ if and only if N 2 = ϕ Finding a code for N 2 in M 01 w,cl. An infinite effectively discrete Turing antichain is not compact, so we can no longer rely on them to provide a code. Instead we use the following definition: Definition Let g 2 ω. A set A 2 ω is called a g-spine (or just a spine) if it is of the form {g} {σ i f i i X} where X ω is infinite, σ i = (g i) (1 g(i)) for each i X, and f i 2 ω for each i X. Definition Let g 2 ω and let A 2 ω be countable. Fix an enumeration f i i ω of A. We denote by spine(g, A) the g-spine {g} {σ i f i i ω} where σ i = (g i) (1 g(i)) for each i ω. We denote by spine(a) the f 0 -spine spine(f 0, A {f 0 }). Notice that a spine is a closed subset of 2 ω. Lemma There is a code for N 2 in M 01 w,cl. Proof. Let W 0 = {f 0,i i ω}, W 1 = {f 1,i i ω}, and W 2 = {f 2,i i ω} be such that W 0 W 1 W 2 2ω is independent. Then let W 0 = spine(w 0 ), W 1 = spine(w 1 ), W 2 = spine(w 2 ), M = spine({f 0,i f 1,i i ω} {f 0,i f 2,i i ω}), L = spine({f 0,i f 1,j i j}), P = spine({f 0,i f 1,j f 2,k i + j = k}), T = spine({f 0,i f 1,j f 2,k i j = k}). The above mass problems are spines that are Turing antichains. Put w 0 = [W 0 ] w, w 1 = [W 1 ] w, w 2 = [W 2 ] w, m = [M] w, l = [L] w, p = [P] w, t = [T ] w. The verification that these degrees satisfy Definition 4.6 is the same as the verification that the corresponding degrees defined in Lemma 3.11 satisfy case (ii) of Definition 3.8. Use Lemma 4.9 in place of Lemma 3.7. Lemma Th(N 2 ) 1 Th(M 01 cl ). Proof. As in Lemma Interpreting arithmetic in the closed and compact Medvedev degrees In this section we prove that Th(N 2 ) 1 Th(M cl ), Th(M 01 cl ). As always, the crucial point is coding any S Ẽ(w) as some F (a) Ẽ(w). In the Muchnik cases, this was accomplished by assuming that S is countable, fixing a closed representative for each degree in S, and essentially taking the union of these representatives. However, the proof that this produced such an a relied on the non-uniformity afforded by Muchnik reducibility. Specifically, if X i w Y for each i ω, then i ω X i w Y. In the Medvedev cases, it may be that X i M Y for each i ω but i ω X i M Y because the reductions witnessing each X i M Y cannot be combined into one uniform reduction witnessing i ω X i M Y. We will show that it is possible to choose the representatives X i in such a way that taking their union preserves uniformity.

15 CODING TRUE ARITHMETIC IN THE MEDVEDEV AND MUCHNIK DEGREES Coding subsets of ω. The results of this section apply to arbitrary mass problems, not just closed and compact ones. We consider arbitrary mass problems W and degrees w M. The next lemma is a clarifying example. It implies that a closed (compact) W has meet-reducible degree in M cl (M 01 cl ) if and only if it has meet-reducible degree in M. Lemma 5.1 (Dyment [2]). If W M X Y, then W = X Ŷ where X and Ŷ are disjoint and clopen in W, X M X, Ŷ M Y, and W M X Ŷ. Proof. Let Φ be such that Φ(W) 0 X 1 Y. Put X = {f W Φ f (0) = 0} and put Ŷ = {f W Φ f (0) = 1}. By Lemma 1.5, X and Ŷ are clopen in W, and it is easily checked that X M X and Ŷ M Y (hence W M X Ŷ). We have W M 0 X 1 Ŷ by the reduction which sends f to 0 f if Φ f (0) = 0 and sends f to 1 f if Φ f (0) = 1. Our coding relies on the following lemma similar to Lemma 5.1. Lemma 5.2. If W M X Y where X has meet-irreducible degree and Y > M W, then W = X Ŷ where X and Ŷ are disjoint and clopen in W, X M X, and X M Ŷ. Proof. As in Lemma 5.1, let Φ be such that Φ(W) 0 X 1 Y, put X = {f W Φ f (0) = 0}, and put Ŷ = {f W Φf (0) = 1}. Then W = X Ŷ, X Ŷ =, X and Ŷ are clopen in W, X M X, Ŷ M Y, and W M X Ŷ. To see X M X, observe X M W M X Ŷ. X has meet-irreducible degree, so X M X or X M Ŷ. We cannot have X M Ŷ because Ŷ M Y and this would imply W M X Y M Y > M W. Thus X M X. Similarly X M Ŷ for otherwise W M Ŷ M Y > M W. Corollary 5.3. For any degree w M there are at most countably many meet-irreducible degrees that meet to w. Proof. Fix a representative W for w. In Lemma 5.2 we showed that if x is meet-irreducible and meets to w, then x has a representative {f W Φ f (0) = 0} for some program Φ. There are only countably many programs, so there can be at most countably many such x. Notice that Corollary 5.3 is in contrast to the Muchnik case, in which a degree may have uncountably many meet-irreducibles that meet to it (see Lemma 4.9). Also notice that if w is closed (compact) and x is meet-irreducible and meets to w, then Lemma 5.2 produces a closed (compact) representative for x. Thus for a closed (compact) degree w, the meet-irreducible degrees that meet to w are the same whether they are computed in M or in M cl (M 01 cl ). Lemma 5.4. Let W be a mass problem whose degree has countably many minimal meet-irreducible degrees meeting to it, and let X i i ω be a list of representatives for these degrees. Then there are mass problems X i i ω such that: (i) X i W is clopen in W for each i, (ii) X i X j = for i j, (iii) X i M X i for each i, (iv) X i M W X i for each i. Proof. Inductively construct the sequence X i i ω. At the start of step n + 1 we have X i i n satisfying (i) (iv) for i, j n, and we have indices e 0,..., e n such that, for i n, X i = { f W j<i X j Φ f e i (0) = 0 } and W j i X j = { f W j<i X j Φ f e i (0) = 1 }. We first show W M X0 X n ( W i n X i ). The meet is M W because each term is a subset of W. To see the reverse inequality, write the meet as i n i Xi ( n + 1 ) ( W i n X i ).

16 16 PAUL SHAFER Then apply the following reduction: For each i n in order, check if Φ f e i (0) is 0 or 1. If it is 0, send f to i f. If it is 1, go to the next i. If Φ f e i (0) = 1 for each i n, then send f to (n + 1) f. We now have X n+1 M W M X0 X n ( W i n X i ). We cannot have Xn+1 M Xi for any i n because X i M X i and the X i s are incomparable by minimality. However, X n+1 has meetirreducible degree. Therefore X n+1 M W i n X i. Moreover, by distributivity [ X n+1 ] meets to [ W i n X i ] because [ Xn+1 ] meets to [ W ] and [ Xn+1 ] M [ W i n X i ] M [ W ]. Thus, as in Lemma 5.2, there is an X n+1 W i n X i clopen in W i n X i and an e n+1 such that X n+1 = { f W i n X i Φ f e n+1 (0) = 0 }, W i n+1 X i = { f W i n X i Φ f e n+1 (0) = 1 }, X n+1 M X n+1, and X n+1 M W i n+1 X i. Clearly X n+1 is disjoint from X i for i n. Xn+1 is clopen in W because it is clopen in W i n X i which is clopen in W. Finally, Xn+1 M W X n+1 because X n+1 has meet-irreducible degree, Xn+1 M Xi for i n, Xn+1 M W i n+1 X i, and W X n+1 M X0 X n ( W i n+1 X i ). The next lemma implies that every subset of ω has a code. That is, if w is closed (compact) and S Ẽ(w) then there is a closed (compact) a such that F (a) Ẽ(w) = S. Lemma 5.5. Let w M and let W be a representative for w. Then for any S Ẽ(w) there is an A W closed in W such that F ([A]) Ẽ(w) = S. Proof. We only consider the case in which Ẽ(w) is infinite. By Corollary 5.3, Ẽ(w) is countable. Let X i i ω be a list of representatives for the degrees in Ẽ(w). Apply Lemma 5.4 to W and X i i ω to get a new set of representatives X i i ω disjoint and clopen in W with X i M W X i for each i. Put A = W { X i [ X i ] / S}, and note that A is closed in W. We show X i M A if and only if [ X i ] S. If [ X i ] S then X i A and so X i M A. If [ X i ] / S then A W X i and so A M W X i. Thus X i M A because X i M W X i Finding a code for N 2 in M cl and in M 01 cl. The following lemma is the M cl analog to Lemma 3.7 and Lemma 4.9: Lemma 5.6. If W is an effectively discrete Turing antichain, then Ẽ([W]) = {[{f}] f W}. Proof. First, let f W and suppose B M W has meet-irreducible degree. We claim B M {f} implies {f} M B. To see this, use the effectively discreteness of W to show W M {f} (W {f}). If B M {f}, then it must be that B M W {f} because B has meet-irreducible degree and B M {f} (W {f}). Hence {f} M B because {f} M W {f}. Now, if f W, it is clear that [{f}] is meet-irreducible and meets to [W]. To see that [{f}] is minimal, suppose B is closed, has meet-irreducible degree, and W M B M {f}. The contrapositive of the claim tells us {f} M B. Thus [{f}] is minimal, making [{f}] Ẽ([W]). Conversely, suppose for a contradiction that B is closed and [B] Ẽ([W]), but B M{f} for all f W. By the claim, we also have {f} M B for all f W. So if W M B C for some C, we must have W M C because no Φ can send a member of W to a member of B. This contradicts that [B] meets to [W]. So if b Ẽ([W]), we must have b M[{f}] for some f W. But [{f}] Ẽ([W]), hence b = [{f}] by minimality. We also need the compact version of Lemma 5.6 for M 01 cl : Lemma 5.7. If W = {g} {σ i f i i X} is a g-spine that is a Turing antichain, then Ẽ([W]) = {[{f i }] i X}.

17 CODING TRUE ARITHMETIC IN THE MEDVEDEV AND MUCHNIK DEGREES 17 Proof. One can check W M {f i } (W {σ i f i }) for each i X. So if B M W has meet-irreducible degree and B M {f i }, we have both B M W {σ i f i } and {f i } M B. The proof that [{f i }] Ẽ([W]) is then the same as in Lemma 5.6. Conversely, suppose for a contradiction that [B] Ẽ([W]) but B M{f i } for all i X. Therefore {f i } M B for all i X. Suppose then that W M B C for some C, and let Φ be such that Φ(W) 0 B 1 C. We must have Φ σ i f i 1 C for each i X because otherwise {f i } M B for some i. We must also have Φ g 1 C: If not, Φ g (0) = 0 and there is some τ g such that Φ τ (0) = 0. Choose i X with i > τ. Then τ σ i, and we have the contradiction Φ σ i f i (0) = 0. We must therefore have W M C. This contradicts that [B] meets to [W]. So if b Ẽ([W]), we must have b M [{f i }] for some i. But [{f i }] Ẽ([W]), hence b = [{f i}] by minimality. Notice the difference between Lemma 4.9 and Lemma 5.7. If A is a g-spine that is a Turing antichain, then in M 01 w,cl we have [{g}] w Ẽ([A] w), but in M 01 cl we have [{g}] / Ẽ([A]). Lemma 5.8. There is a code for N 2 in M cl. Proof. As in Lemma Use Lemma 5.6 in place of Lemma 4.9. Lemma 5.9. Th(N 2 ) 1 Th(M cl ). Proof. As in Lemma Lemma There is a code for N 2 in M 01 cl. Proof. Let g, W 0 = {f 0,i i ω}, W 1 = {f 1,i i ω}, and W 2 = {f 2,i i ω} be such that {g} W 0 W 1 W 2 2ω is independent. Then let W 0 = spine(g, W 0 ), W 1 = spine(g, W 1 ), W 2 = spine(g, W 2 ), M = spine(g, {f 0,i f 1,i i ω} {f 0,i f 2,i i ω}), L = spine(g, {f 0,i f 1,j i j}), P = spine(g, {f 0,i f 1,j f 2,k i + j = k}), T = spine(g, {f 0,i f 1,j f 2,k i j = k}). The above mass problems are g-spines that are Turing antichains. Put w 0 = [W 0 ], w 1 = [W 1 ], w 2 = [W 2 ], m = [M], l = [L], p = [P], t = [T ]. The verification that these degrees satisfy Definition 4.6 is the same as the verification that the corresponding degrees defined in Lemma 3.11 satisfy case (ii) of Definition 3.8. Use Lemma 5.7 in place of Lemma 3.7. Lemma Th(N 2 ) 1 Th(M 01 cl ). Proof. As in Lemma Theorem Th(M w,cl ) 1 Th(M 01 w,cl ) 1 Th(M cl ) 1 Th(M 01 cl ) 1 Th(N 2 ). Proof. First Th(M cl ), Th(M 01 cl ), Th(M w,cl), Th(M 01 w,cl ) 1 Th(N 2 ) by Lemma 2.2. Next we have Th(N 2 ) 1 Th(M w,cl ), Th(M 01 Th(M 01 cl w,cl ) by Lemma 4.13 and Lemma Finally Th(N 2) 1 Th(M cl ), ) by Lemma 5.9 and Lemma A first-order sentence distinguishing M cl and M 01 cl from M w,cl and M 01 w,cl We have seen in Lemma 4.7 that M w,cl and M 01 w,cl are countably meet-complete. In contrast, Dyment proved that in M there are countable collections of degrees which do not have greatest lower bounds [3]. This result holds for M cl and M 01 cl as well. Definition 6.1. In a lattice L, a set X L is called strongly meet-incomplete if for any finite {y i i n} X there is an x X such that x y 1 y 2 y n.

18 18 PAUL SHAFER Lemma 6.2 (Dyment [3]; See also [22]). No countable strongly meet-incomplete X M has a greatest lower bound. The proof of Lemma 6.2 works in M cl, and it only requires a slight modification for M 01 cl. We have shown that if w 0 is as in a code for N 2 in any of M cl, M 01 cl, M w,cl, M 01 w,cl, then Ẽ(w 0) is countable. This observation gives us the following theorem: Theorem 6.3. Neither M cl nor M 01 cl is elementarily equivalent to either M w,cl or M 01 w,cl. Proof. Let ϕ be the first-order sentence that says for all w 0, if w 0 is as in a code for N 2, then Ẽ(w 0 ) has a greatest lower bound. The sentence ϕ is true in both M w,cl and M 01 w,cl because such an Ẽ(w 0) is countable and these lattices are countably meet-complete. On the other hand, ϕ fails in both M cl and M 01 cl. If w 0 is as in the code for N 2 produced in either Lemma 5.8 or Lemma 5.10, then Ẽ(w 0) = {[{f}] i i ω} where {f i i ω} is a Turing antichain. It is then easy to check that Ẽ(w 0) is strongly meet-incomplete and hence has no greatest lower bound. Acknowledgements Many thanks to my advisor Richard Shore for many helpful discussions. Thanks as well to Andrew Lewis, André Nies, and Andrea Sorbi for their gracious acknowledgement of my work on Theorem 3.13 during their presentation of it at CiE Lastly, thanks to my anonymous reviewers and their helpful suggestions which improved the clarity of this work. References 1. Caterina Bianchini and Andrea Sorbi, A note on closed degrees of difficulty of the Medvedev lattice, Mathematical Logic Quarterly 42 (1996), no. 1, Elena Z. Dyment, Certain properties of the Medvedev lattice, Mathematics of the USSR Sbornik 30 (1976), , Exact bounds of denumerable collections of degrees of difficulty, Matematicheskie Zametki 28 (1980), no. 6, Wilfrid Hodges, A Shorter Model Theory, Cambridge University Press, V. A. Jankov, The calculus of the weak law of excluded middle, Mathematics of the USSR Izvestiya 2 (1968), no. 5, Manuel Lerman, Degrees of Unsolvability, Springer Verlag, Andrew E.M. Lewis, André Nies, and Andrea Sorbi, The first order theories of the Medvedev and Muchnik lattices, CiE (Klaus Ambos-Spies, Benedikt Löwe, and Wolfgang Merkle, eds.), Lecture Notes in Computer Science, vol. 5635, Springer, 2009, pp Andrew E.M. Lewis, Richard A. Shore, and Andrea Sorbi, Topological aspects of the Medvedev lattice, to appear. 9. Yuri T. Medvedev, Degrees of difficulty of the mass problems, Doklady Akademii Nauk SSSR (NS), vol. 104, 1955, pp , Finite problems, Doklady Akademii Nauk SSSR (NS), vol. 142, 1962, pp Albert A. Muchnik, On strong and weak reducibilities of algorithmic problems, Sibirskii Matematicheskii Zhurnal 4 (1963), André Nies, Richard A. Shore, and Theodore A. Slaman, Interpretability and definability in the recursively enumerable degrees, Proceedings of the London Mathematical Society 77 (1998), no. 02, Paul Shafer, Characterizing the join-irreducible Medvedev degrees, to appear in the Notre Dame Journal of Formal Logic. 14. Richard A. Shore, The theory of the degrees below 0, Journal of the London Mathematical Society 24 (1981), Stephen G. Simpson, First-order theory of the degrees of recursive unsolvability, Annals of Mathematics 105 (1977), no. 1, , Subsystems of Second Order Arithmetic, Cambridge University Press, Elena Z. Skvortsova, A faithful interpretation of the intuitionistic propositional calculus by means of an initial segment of the Medvedev lattice, Sibirskii Matematicheskii Zhurnal 29 (1988), no. 1, Robert I. Soare, Recursively Enumerable Sets and Degrees, Springer Verlag, Andrea Sorbi, Some remarks on the algebraic structure of the Medvedev lattice, Journal of Symbolic Logic 55 (1990), no. 2,

19 CODING TRUE ARITHMETIC IN THE MEDVEDEV AND MUCHNIK DEGREES , Embedding Brouwer algebras in the Medvedev lattice, Notre Dame Journal of Formal Logic 32 (1991), no. 2, , Some quotient lattices of the Medvedev lattice, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 37 (1991), no. 9 12, , The Medvedev lattice of degrees of difficulty, Computability, Enumerability, Unsolvability: Directions in Recursion Theory (S. B. Cooper, T. A. Slaman, and S. S. Wainer, eds.), London Mathematical Society Lecture Notes, vol. 224, Cambridge University Press, 1996, pp Andrea Sorbi and Sebastiaan A. Terwijn, Intermediate logics and factors of the Medvedev lattice, Annals of Pure and Applied Logic 155 (2008), no. 2, Department of Mathematics, Malott Hall, Cornell University, Ithaca, NY 14853, USA address: URL:

### Turing Degrees and Definability of the Jump. Theodore A. Slaman. University of California, Berkeley. CJuly, 2005

Turing Degrees and Definability of the Jump Theodore A. Slaman University of California, Berkeley CJuly, 2005 Outline Lecture 1 Forcing in arithmetic Coding and decoding theorems Automorphisms of countable

### THE SEARCH FOR NATURAL DEFINABILITY IN THE TURING DEGREES

THE SEARCH FOR NATURAL DEFINABILITY IN THE TURING DEGREES ANDREW E.M. LEWIS 1. Introduction This will be a course on the Turing degrees. We shall assume very little background knowledge: familiarity with

### FIRST ORDER THEORY OF THE s-degrees AND ARITHMETIC

FIRST ORDER THEORY OF THE s-degrees AND ARITHMETIC DANIELE MARSIBILIO AND ANDREA SORBI Abstract. We show that the first order theories of the s-degrees, and of the Q-degrees, are computably isomorphic

### DEGREES OF CATEGORICITY AND THE HYPERARITHMETIC HIERARCHY

DEGREES OF CATEGORICITY AND THE HYPERARITHMETIC HIERARCHY BARBARA F. CSIMA, JOHANNA N. Y. FRANKLIN, AND RICHARD A. SHORE Abstract. We study arithmetic and hyperarithmetic degrees of categoricity. We extend

### x < y iff x < y, or x and y are incomparable and x χ(x,y) < y χ(x,y).

12. Large cardinals The study, or use, of large cardinals is one of the most active areas of research in set theory currently. There are many provably different kinds of large cardinals whose descriptions

### INTRODUCTORY SET THEORY

M.Sc. program in mathematics INTRODUCTORY SET THEORY Katalin Károlyi Department of Applied Analysis, Eötvös Loránd University H-1088 Budapest, Múzeum krt. 6-8. CONTENTS 1. SETS Set, equal sets, subset,

### GENERIC COMPUTABILITY, TURING DEGREES, AND ASYMPTOTIC DENSITY

GENERIC COMPUTABILITY, TURING DEGREES, AND ASYMPTOTIC DENSITY CARL G. JOCKUSCH, JR. AND PAUL E. SCHUPP Abstract. Generic decidability has been extensively studied in group theory, and we now study it in

### Finite Sets. Theorem 5.1. Two non-empty finite sets have the same cardinality if and only if they are equivalent.

MATH 337 Cardinality Dr. Neal, WKU We now shall prove that the rational numbers are a countable set while R is uncountable. This result shows that there are two different magnitudes of infinity. But we

### CARDINALITY, COUNTABLE AND UNCOUNTABLE SETS PART ONE

CARDINALITY, COUNTABLE AND UNCOUNTABLE SETS PART ONE With the notion of bijection at hand, it is easy to formalize the idea that two finite sets have the same number of elements: we just need to verify

### Biinterpretability up to double jump in the degrees

Biinterpretability up to double jump in the degrees below 0 0 Richard A. Shore Department of Mathematics Cornell University Ithaca NY 14853 July 29, 2013 Abstract We prove that, for every z 0 0 with z

### Degrees that are not degrees of categoricity

Degrees that are not degrees of categoricity Bernard A. Anderson Department of Mathematics and Physical Sciences Gordon State College banderson@gordonstate.edu www.gordonstate.edu/faculty/banderson Barbara

### Recursion Theory in Set Theory

Contemporary Mathematics Recursion Theory in Set Theory Theodore A. Slaman 1. Introduction Our goal is to convince the reader that recursion theoretic knowledge and experience can be successfully applied

### A NOTE ON INITIAL SEGMENTS OF THE ENUMERATION DEGREES

A NOTE ON INITIAL SEGMENTS OF THE ENUMERATION DEGREES THEODORE A. SLAMAN AND ANDREA SORBI Abstract. We show that no nontrivial principal ideal of the enumeration degrees is linearly ordered: In fact, below

### MA651 Topology. Lecture 6. Separation Axioms.

MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples

### COFINAL MAXIMAL CHAINS IN THE TURING DEGREES

COFINA MAXIMA CHAINS IN THE TURING DEGREES WEI WANG, IUZHEN WU, AND IANG YU Abstract. Assuming ZF C, we prove that CH holds if and only if there exists a cofinal maximal chain of order type ω 1 in the

### MODELS OF SET THEORY

MODELS OF SET THEORY STEFAN GESCHKE Contents 1. First order logic and the axioms of set theory 2 1.1. Syntax 2 1.2. Semantics 2 1.3. Completeness, compactness and consistency 3 1.4. Foundations of mathematics

### EMBEDDING COUNTABLE PARTIAL ORDERINGS IN THE DEGREES

EMBEDDING COUNTABLE PARTIAL ORDERINGS IN THE ENUMERATION DEGREES AND THE ω-enumeration DEGREES MARIYA I. SOSKOVA AND IVAN N. SOSKOV 1. Introduction One of the most basic measures of the complexity of a

### CLASSES, STRONG MINIMAL COVERS AND HYPERIMMUNE-FREE DEGREES

Π 0 1 CLASSES, STRONG MINIMAL COVERS AND HYPERIMMUNE-FREE DEGREES ANDREW E.M. LEWIS Abstract. We investigate issues surrounding an old question of Yates as to the existence of a minimal degree with no

### SMALL SKEW FIELDS CÉDRIC MILLIET

SMALL SKEW FIELDS CÉDRIC MILLIET Abstract A division ring of positive characteristic with countably many pure types is a field Wedderburn showed in 1905 that finite fields are commutative As for infinite

### Mathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson

Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement

### THE TURING DEGREES AND THEIR LACK OF LINEAR ORDER

THE TURING DEGREES AND THEIR LACK OF LINEAR ORDER JASPER DEANTONIO Abstract. This paper is a study of the Turing Degrees, which are levels of incomputability naturally arising from sets of natural numbers.

### Review for Final Exam

Review for Final Exam Note: Warning, this is probably not exhaustive and probably does contain typos (which I d like to hear about), but represents a review of most of the material covered in Chapters

### DEGREES OF ORDERS ON TORSION-FREE ABELIAN GROUPS

DEGREES OF ORDERS ON TORSION-FREE ABELIAN GROUPS ASHER M. KACH, KAREN LANGE, AND REED SOLOMON Abstract. We construct two computable presentations of computable torsion-free abelian groups, one of isomorphism

### Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011

Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011 A. Miller 1. Introduction. The definitions of metric space and topological space were developed in the early 1900 s, largely

### Chapter 1. Informal introdution to the axioms of ZF.

Chapter 1. Informal introdution to the axioms of ZF. 1.1. Extension. Our conception of sets comes from set of objects that we know well such as N, Q and R, and subsets we can form from these determined

### SETS, RELATIONS, AND FUNCTIONS

September 27, 2009 and notations Common Universal Subset and Power Set Cardinality Operations A set is a collection or group of objects or elements or members (Cantor 1895). the collection of the four

### 4 Domain Relational Calculus

4 Domain Relational Calculus We now present two relational calculi that we will compare to RA. First, what is the difference between an algebra and a calculus? The usual story is that the algebra RA is

### GENERALIZED HIGH DEGREES HAVE THE COMPLEMENTATION PROPERTY

The Journal of Symbolic Logic Volume 00, Number 0, XXX 0000 GENERALIZED HIGH DEGREES HAVE THE COMPLEMENTATION PROPERTY NOAM GREENBERG, ANTONIO MONTALBÁN, AND RICHARD A. SHORE Abstract. We show that if

### Global Properties of the Turing Degrees and the Turing Jump

Global Properties of the Turing Degrees and the Turing Jump Theodore A. Slaman Department of Mathematics University of California, Berkeley Berkeley, CA 94720-3840, USA slaman@math.berkeley.edu Abstract

### Embeddability and Decidability in the Turing Degrees

ASL Summer Meeting Logic Colloquium 06. Embeddability and Decidability in the Turing Degrees Antonio Montalbán. University of Chicago Nijmegen, Netherlands, 27 July- 2 Aug. of 2006 1 Jump upper semilattice

### Fixed-Point Logics and Computation

1 Fixed-Point Logics and Computation Symposium on the Unusual Effectiveness of Logic in Computer Science University of Cambridge 2 Mathematical Logic Mathematical logic seeks to formalise the process of

### This asserts two sets are equal iff they have the same elements, that is, a set is determined by its elements.

3. Axioms of Set theory Before presenting the axioms of set theory, we first make a few basic comments about the relevant first order logic. We will give a somewhat more detailed discussion later, but

### SOLUTIONS TO ASSIGNMENT 1 MATH 576

SOLUTIONS TO ASSIGNMENT 1 MATH 576 SOLUTIONS BY OLIVIER MARTIN 13 #5. Let T be the topology generated by A on X. We want to show T = J B J where B is the set of all topologies J on X with A J. This amounts

### Notes on Richard Dedekind s Was sind und was sollen die Zahlen?

Notes on Richard Dedekind s Was sind und was sollen die Zahlen? David E. Joyce, Clark University December 2005 Contents Introduction 2 I. Sets and their elements. 2 II. Functions on a set. 5 III. One-to-one

### Sets and Cardinality Notes for C. F. Miller

Sets and Cardinality Notes for 620-111 C. F. Miller Semester 1, 2000 Abstract These lecture notes were compiled in the Department of Mathematics and Statistics in the University of Melbourne for the use

### Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.

Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize

### o-minimality and Uniformity in n 1 Graphs

o-minimality and Uniformity in n 1 Graphs Reid Dale July 10, 2013 Contents 1 Introduction 2 2 Languages and Structures 2 3 Definability and Tame Geometry 4 4 Applications to n 1 Graphs 6 5 Further Directions

### 1. Prove that the empty set is a subset of every set.

1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since

### Lecture notes on the Turing degrees, AII Graduate Summer School in Logic Singapore, 28 June - 23 July 2010

Lecture notes on the Turing degrees, AII Graduate Summer School in Logic Singapore, 28 June - 23 July 2010 Richard A. Shore 1 Department of Mathematics Cornell University Ithaca NY 14853 January 3, 2012

### it is easy to see that α = a

21. Polynomial rings Let us now turn out attention to determining the prime elements of a polynomial ring, where the coefficient ring is a field. We already know that such a polynomial ring is a UF. Therefore

### The Ideal Class Group

Chapter 5 The Ideal Class Group We will use Minkowski theory, which belongs to the general area of geometry of numbers, to gain insight into the ideal class group of a number field. We have already mentioned

### CHAPTER 7 GENERAL PROOF SYSTEMS

CHAPTER 7 GENERAL PROOF SYSTEMS 1 Introduction Proof systems are built to prove statements. They can be thought as an inference machine with special statements, called provable statements, or sometimes

### 1 if 1 x 0 1 if 0 x 1

Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or

### Introducing Functions

Functions 1 Introducing Functions A function f from a set A to a set B, written f : A B, is a relation f A B such that every element of A is related to one element of B; in logical notation 1. (a, b 1

### The Dirichlet Unit Theorem

Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if

### We give a basic overview of the mathematical background required for this course.

1 Background We give a basic overview of the mathematical background required for this course. 1.1 Set Theory We introduce some concepts from naive set theory (as opposed to axiomatic set theory). The

University of Oslo MAT2 Project The Banach-Tarski Paradox Author: Fredrik Meyer Supervisor: Nadia S. Larsen Abstract In its weak form, the Banach-Tarski paradox states that for any ball in R, it is possible

### Point Set Topology. A. Topological Spaces and Continuous Maps

Point Set Topology A. Topological Spaces and Continuous Maps Definition 1.1 A topology on a set X is a collection T of subsets of X satisfying the following axioms: T 1.,X T. T2. {O α α I} T = α IO α T.

### 1 Sets and Set Notation.

LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most

### AN INTRODUCTION TO SET THEORY. Professor William A. R. Weiss

AN INTRODUCTION TO SET THEORY Professor William A. R. Weiss October 2, 2008 2 Contents 0 Introduction 7 1 LOST 11 2 FOUND 19 3 The Axioms of Set Theory 23 4 The Natural Numbers 31 5 The Ordinal Numbers

### There is no degree invariant half-jump

There is no degree invariant half-jump Rod Downey Mathematics Department Victoria University of Wellington P O Box 600 Wellington New Zealand Richard A. Shore Mathematics Department Cornell University

### In mathematics you don t understand things. You just get used to them. (Attributed to John von Neumann)

Chapter 1 Sets and Functions We understand a set to be any collection M of certain distinct objects of our thought or intuition (called the elements of M) into a whole. (Georg Cantor, 1895) In mathematics

### God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886)

Chapter 2 Numbers God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886) God created the integers and the rest is the work

### Descriptive Set Theory

Descriptive Set Theory David Marker Fall 2002 Contents I Classical Descriptive Set Theory 2 1 Polish Spaces 2 2 Borel Sets 14 3 Effective Descriptive Set Theory: The Arithmetic Hierarchy 27 4 Analytic

### PART I. THE REAL NUMBERS

PART I. THE REAL NUMBERS This material assumes that you are already familiar with the real number system and the representation of the real numbers as points on the real line. I.1. THE NATURAL NUMBERS

### Scalable Automated Symbolic Analysis of Administrative Role-Based Access Control Policies by SMT solving

Scalable Automated Symbolic Analysis of Administrative Role-Based Access Control Policies by SMT solving Alessandro Armando 1,2 and Silvio Ranise 2, 1 DIST, Università degli Studi di Genova, Italia 2 Security

### Any set with a (unique) η-representation is Σ 3, and any set with a strong η-representation is

η-representation OF SETS AND DEGREES KENNETH HARRIS Abstract. We show that a set has an η-representation in a linear order if and only if it is the range of a 0 -computable limitwise monotonic function.

### Automata Theory. Şubat 2006 Tuğrul Yılmaz Ankara Üniversitesi

Automata Theory Automata theory is the study of abstract computing devices. A. M. Turing studied an abstract machine that had all the capabilities of today s computers. Turing s goal was to describe the

### F. ABTAHI and M. ZARRIN. (Communicated by J. Goldstein)

Journal of Algerian Mathematical Society Vol. 1, pp. 1 6 1 CONCERNING THE l p -CONJECTURE FOR DISCRETE SEMIGROUPS F. ABTAHI and M. ZARRIN (Communicated by J. Goldstein) Abstract. For 2 < p

### Parametric Domain-theoretic models of Linear Abadi & Plotkin Logic

Parametric Domain-theoretic models of Linear Abadi & Plotkin Logic Lars Birkedal Rasmus Ejlers Møgelberg Rasmus Lerchedahl Petersen IT University Technical Report Series TR-00-7 ISSN 600 600 February 00

### (LMCS, p. 317) V.1. First Order Logic. This is the most powerful, most expressive logic that we will examine.

(LMCS, p. 317) V.1 First Order Logic This is the most powerful, most expressive logic that we will examine. Our version of first-order logic will use the following symbols: variables connectives (,,,,

### Subsets of Euclidean domains possessing a unique division algorithm

Subsets of Euclidean domains possessing a unique division algorithm Andrew D. Lewis 2009/03/16 Abstract Subsets of a Euclidean domain are characterised with the following objectives: (1) ensuring uniqueness

### Low upper bound of ideals, coding into rich Π 0 1 classes

Low upper bound of ideals, coding into rich Π 0 1 classes Antonín Kučera the main part is a joint project with T. Slaman Charles University, Prague September 2007, Chicago The main result There is a low

### On strong fairness in UNITY

On strong fairness in UNITY H.P.Gumm, D.Zhukov Fachbereich Mathematik und Informatik Philipps Universität Marburg {gumm,shukov}@mathematik.uni-marburg.de Abstract. In [6] Tsay and Bagrodia present a correct

### THE DEGREES OF BI-HYPERHYPERIMMUNE SETS

THE DEGREES OF BI-HYPERHYPERIMMUNE SETS URI ANDREWS, PETER GERDES, AND JOSEPH S. MILLER Abstract. We study the degrees of bi-hyperhyperimmune (bi-hhi) sets. Our main result characterizes these degrees

### Logic, Algebra and Truth Degrees 2008. Siena. A characterization of rst order rational Pavelka's logic

Logic, Algebra and Truth Degrees 2008 September 8-11, 2008 Siena A characterization of rst order rational Pavelka's logic Xavier Caicedo Universidad de los Andes, Bogota Under appropriate formulations,

### A 2-factor in which each cycle has long length in claw-free graphs

A -factor in which each cycle has long length in claw-free graphs Roman Čada Shuya Chiba Kiyoshi Yoshimoto 3 Department of Mathematics University of West Bohemia and Institute of Theoretical Computer Science

### I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

### NATURAL FACTORS OF THE MEDVEDEV LATTICE CAPTURING IPC

NATURAL FACTORS OF THE MEDVEDEV LATTICE CAPTURING IPC RUTGER KUYPER Abstract. Skvortsova showed that there is a factor of the Medvedev lattice which captures intuitionistic propositional logic (IPC). However,

### Graphs without proper subgraphs of minimum degree 3 and short cycles

Graphs without proper subgraphs of minimum degree 3 and short cycles Lothar Narins, Alexey Pokrovskiy, Tibor Szabó Department of Mathematics, Freie Universität, Berlin, Germany. August 22, 2014 Abstract

### DEFINABLE TYPES IN PRESBURGER ARITHMETIC

DEFINABLE TYPES IN PRESBURGER ARITHMETIC GABRIEL CONANT Abstract. We consider the first order theory of (Z, +,

### GROUPS SUBGROUPS. Definition 1: An operation on a set G is a function : G G G.

Definition 1: GROUPS An operation on a set G is a function : G G G. Definition 2: A group is a set G which is equipped with an operation and a special element e G, called the identity, such that (i) the

### A CONSTRUCTION OF THE UNIVERSAL COVER AS A FIBER BUNDLE

A CONSTRUCTION OF THE UNIVERSAL COVER AS A FIBER BUNDLE DANIEL A. RAMRAS In these notes we present a construction of the universal cover of a path connected, locally path connected, and semi-locally simply

### Classical Analysis I

Classical Analysis I 1 Sets, relations, functions A set is considered to be a collection of objects. The objects of a set A are called elements of A. If x is an element of a set A, we write x A, and if

### Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

### SOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 3. Spaces with special properties

SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A Part 3 Fall 2008 III. Spaces with special properties III.1 : Compact spaces I Problems from Munkres, 26, pp. 170 172 3. Show that a finite union of compact subspaces

### Partitioning edge-coloured complete graphs into monochromatic cycles and paths

arxiv:1205.5492v1 [math.co] 24 May 2012 Partitioning edge-coloured complete graphs into monochromatic cycles and paths Alexey Pokrovskiy Departement of Mathematics, London School of Economics and Political

### A Beginner s Guide to Modern Set Theory

A Beginner s Guide to Modern Set Theory Martin Dowd Product of Hyperon Software PO Box 4161 Costa Mesa, CA 92628 www.hyperonsoft.com Copyright c 2010 by Martin Dowd 1. Introduction..... 1 2. Formal logic......

### Degree spectra and immunity properties

Mathematical Logic Quarterly, 28 March 2009 Degree spectra and immunity properties Barbara F. Csima 1, and Iskander S. Kalimullin 2, 1 Department of Pure Mathematics University of Waterloo Waterloo, ON,

### arxiv:math/0510680v3 [math.gn] 31 Oct 2010

arxiv:math/0510680v3 [math.gn] 31 Oct 2010 MENGER S COVERING PROPERTY AND GROUPWISE DENSITY BOAZ TSABAN AND LYUBOMYR ZDOMSKYY Abstract. We establish a surprising connection between Menger s classical covering

### On the Structure of Turing Universe: The Non-Linear Ordering of Turing Degrees

On the Structure of Turing Universe: The Non-Linear Ordering of Turing Degrees Yazan Boshmaf November 22, 2010 Abstract Turing Universe: the final frontier. These are the voyages of five mathematicians.

### Tree-representation of set families and applications to combinatorial decompositions

Tree-representation of set families and applications to combinatorial decompositions Binh-Minh Bui-Xuan a, Michel Habib b Michaël Rao c a Department of Informatics, University of Bergen, Norway. buixuan@ii.uib.no

### FIXED POINT SETS OF FIBER-PRESERVING MAPS

FIXED POINT SETS OF FIBER-PRESERVING MAPS Robert F. Brown Department of Mathematics University of California Los Angeles, CA 90095 e-mail: rfb@math.ucla.edu Christina L. Soderlund Department of Mathematics

### Chapter 1. Metric Spaces. Metric Spaces. Examples. Normed linear spaces

Chapter 1. Metric Spaces Metric Spaces MA222 David Preiss d.preiss@warwick.ac.uk Warwick University, Spring 2008/2009 Definitions. A metric on a set M is a function d : M M R such that for all x, y, z

### 3. Mathematical Induction

3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)

### An example of a computable

An example of a computable absolutely normal number Verónica Becher Santiago Figueira Abstract The first example of an absolutely normal number was given by Sierpinski in 96, twenty years before the concept

### Elementary Number Theory We begin with a bit of elementary number theory, which is concerned

CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,

### Introduction to Algebraic Geometry. Bézout s Theorem and Inflection Points

Introduction to Algebraic Geometry Bézout s Theorem and Inflection Points 1. The resultant. Let K be a field. Then the polynomial ring K[x] is a unique factorisation domain (UFD). Another example of a

### GENTLY KILLING S SPACES TODD EISWORTH, PETER NYIKOS, AND SAHARON SHELAH

GENTLY KILLING S SPACES TODD EISWORTH, PETER NYIKOS, AND SAHARON SHELAH Abstract. We produce a model of ZFC in which there are no locally compact first countable S spaces, and in which 2 ℵ 0 < 2 ℵ 1. A

### Dedekind s forgotten axiom and why we should teach it (and why we shouldn t teach mathematical induction in our calculus classes)

Dedekind s forgotten axiom and why we should teach it (and why we shouldn t teach mathematical induction in our calculus classes) by Jim Propp (UMass Lowell) March 14, 2010 1 / 29 Completeness Three common

Radboud Universiteit Nijmegen Faculteit der Natuurwetenschappen, Wiskunde en Informatica Uniqueness of the Hyperreal Field Noud Aldenhoven (0620874) Supervisor: dr. W.H.M. Veldman Second reader: prof.

### Lecture 1-1,2. Definition. Sets A and B have the same cardinality if there is an invertible function f : A B.

Topology Summary This is a summary of the results discussed in lectures. These notes will be gradually growing as the time passes by. Most of the time proofs will not be given. You are supposed to be able

### 1 = (a 0 + b 0 α) 2 + + (a m 1 + b m 1 α) 2. for certain elements a 0,..., a m 1, b 0,..., b m 1 of F. Multiplying out, we obtain

Notes on real-closed fields These notes develop the algebraic background needed to understand the model theory of real-closed fields. To understand these notes, a standard graduate course in algebra is

### Finite Projective demorgan Algebras. honoring Jorge Martínez

Finite Projective demorgan Algebras Simone Bova Vanderbilt University (Nashville TN, USA) joint work with Leonardo Cabrer March 11-13, 2011 Vanderbilt University (Nashville TN, USA) honoring Jorge Martínez

### Introduction to Topology

Introduction to Topology Tomoo Matsumura November 30, 2010 Contents 1 Topological spaces 3 1.1 Basis of a Topology......................................... 3 1.2 Comparing Topologies.......................................

### First-Order Logics and Truth Degrees

First-Order Logics and Truth Degrees George Metcalfe Mathematics Institute University of Bern LATD 2014, Vienna Summer of Logic, 15-19 July 2014 George Metcalfe (University of Bern) First-Order Logics

### INTRODUCTION TO TOPOLOGY

INTRODUCTION TO TOPOLOGY ALEX KÜRONYA In preparation January 24, 2010 Contents 1. Basic concepts 1 2. Constructing topologies 13 2.1. Subspace topology 13 2.2. Local properties 18 2.3. Product topology

### Constraint Satisfaction Problems and Descriptive Complexity

1 Constraint Satisfaction Problems and Descriptive Complexity Anuj Dawar University of Cambridge AIM workshop on Universal Algebra, Logic and CSP 1 April 2008 2 Descriptive Complexity Descriptive Complexity