On Transfinite Levels of the Ershov Hierarchy

In this thesis, we study Turing degrees in the context of classical recursion theory. What we are interested in is the partially ordered structures $\mathcal {D}_{\alpha }$ for ordinals $\alpha <\omega ^2$ and $\mathcal {D}_{a}$ for notations $a\in \mathcal {O}$ with $|a|_{o}\geq \omega ^2$ .The dissertation is motivated by the $\Sigma _{1}$ -elementary substructure problem: Can one structure in the following structures $\mathcal {R}\subsetneqq \mathcal {D}_{2}\subsetneqq \dots \subsetneqq \mathcal {D}_{\omega }\subsetneqq \mathcal {D}_{\omega +1}\subsetneqq \dots \subsetneqq \mathcal {D(\leq \textbf {0}')}$ be a $\Sigma _{1}$ -elementary substructure of another? For finite levels of the Ershov hierarchy, Cai, Shore, and Slaman [Journal of Mathematical Logic, vol. 12 (2012), p. 1250005] showed that $\mathcal {D}_{n}\npreceq _{1}\mathcal {D}_{m}$ for any $n < m$ . We consider the problem for transfinite levels of the Ershov hierarchy and show that $\mathcal {D}_{\omega }\npreceq _{1}\mathcal {D}_{\omega +1}$ . The techniques in Chapters 2 and 3 are motivated by two remarkable theorems, Sacks Density Theorem and the d.r.e. Nondensity Theorem.In Chapter 1, we first briefly review the background of the research areas involved in this thesis, and then review some basic definitions and classical theorems. We also summarize our results in Chapter 2 to Chapter 4. In Chapter 2, we show that for any $\omega $ -r.e. set D and r.e. set B with $D<_{T}B$ , there is an $\omega +1$ -r.e. set A such that $D<_{T}A<_{T}B$ . In Chapter 3, we show that for some notation a with $|a|_{o}=\omega ^{2}$ , there is an incomplete $\omega +1$ -r.e. set A such that there are no a-r.e. sets U with $A<_{T}U<_{T}K$ . In Chapter 4, we generalize above results to higher levels (up to $\varepsilon _{0}$ ). We investigate Lachlan sets and minimal degrees on transfinite levels and show that for any notation a, there exists a $\Delta ^{0}_{2}$ -set A such that A is of minimal degree and $A\not \equiv _T U$ for all a-r.e. sets U.Abstract prepared by Cheng Peng.E-mail: [email protected]

Counting algebraic points in expansions of o-minimal structures by a dense set

The Pila–Wilkie theorem states that if a set $X\subseteq \mathbb{R}^n$ is definable in an o-minimal structure $\mathcal{R}$ and contains ‘many’ rational points, then it contains an infinite semialgebraic set. In this paper, we extend this theorem to an expansion $\widetilde{\mathcal{R}}=\langle {\mathcal{R}}, P\rangle$ of ${\mathcal{R}}$ by a dense set P, which is either an elementary substructure of ${\mathcal{R}}$, or it is $\mathrm{dcl}$-independent, as follows. If X is definable in $\widetilde{\mathcal{R}}$ and contains many rational points, then it is dense in an infinite semialgebraic set. Moreover, it contains an infinite set which is ${\emptyset}$-definable in $\langle \overline{\mathbb{R}}, P\rangle$, where $\overline{\mathbb{R}}$ is the real field. Along the way we introduce the notion of the ‘algebraic trace part’ $X^{{\, alg}}_t$ of any set $X\subseteq \mathbb{R}^n$, and we show that if X is definable in an o-minimal structure, then $X^{{\, alg}}_t$ coincides with the usual algebraic part of X.

Weakly minimal groups with a new predicate

Fix a weakly minimal (i.e. superstable [Formula: see text]-rank [Formula: see text]) structure [Formula: see text]. Let [Formula: see text] be an expansion by constants for an elementary substructure, and let [Formula: see text] be an arbitrary subset of the universe [Formula: see text]. We show that all formulas in the expansion [Formula: see text] are equivalent to bounded formulas, and so [Formula: see text] is stable (or NIP) if and only if the [Formula: see text]-induced structure [Formula: see text] on [Formula: see text] is stable (or NIP). We then restrict to the case that [Formula: see text] is a pure abelian group with a weakly minimal theory, and [Formula: see text] is mutually algebraic (equivalently, weakly minimal with trivial forking). This setting encompasses most of the recent research on stable expansions of [Formula: see text]. Using various characterizations of mutual algebraicity, we give new examples of stable structures of the form [Formula: see text]. Most notably, we show that if [Formula: see text] is a weakly minimal additive subgroup of the algebraic numbers, [Formula: see text] is enumerated by a homogeneous linear recurrence relation with algebraic coefficients, and no repeated root of the characteristic polynomial of [Formula: see text] is a root of unity, then [Formula: see text] is superstable for any [Formula: see text].

ON PRODUCTS OF ELEMENTARILY INDIVISIBLE STRUCTURES

We say a structure ${\cal M}$ in a first-order language ${\cal L}$ is indivisible if for every coloring of its universe in two colors, there is a monochromatic substructure ${\cal M}\prime \subseteq {\cal M}$ such that ${\cal M}\prime \cong {\cal M}$. Additionally, we say that ${\cal M}$ is symmetrically indivisible if ${\cal M}\prime$ can be chosen to be symmetrically embedded in ${\cal M}$ (that is, every automorphism of ${\cal M}\prime$ can be extended to an automorphism of ${\cal M}$). Similarly, we say that ${\cal M}$ is elementarily indivisible if ${\cal M}\prime$ can be chosen to be an elementary substructure. We define new products of structures in a relational language. We use these products to give recipes for construction of elementarily indivisible structures which are not transitive and elementarily indivisible structures which are not symmetrically indivisible, answering two questions presented by A. Hasson, M. Kojman, and A. Onshuus.

MODEL COMPLETENESS OF O-MINIMAL FIELDS WITH CONVEX VALUATIONS

We let R be an o-minimal expansion of a field, V a convex subring, and (R0,V0) an elementary substructure of (R,V). Our main result is that (R,V) considered as a structure in a language containing constants for all elements of R0 is model complete relative to quantifier elimination in R, provided that kR (the residue field with structure induced from R) is o-minimal. Along the way we show that o-minimality of kR implies that the sets definable in kR are the same as the sets definable in k with structure induced from (R,V). We also give a criterion for a superstructure of (R,V) being an elementary extension of (R,V).

Returning to semi-bounded sets

An o-minimal expansion of an ordered group is called semi-bounded if there is no definable bijection between a bounded and an unbounded interval in it (equivalently, it is an expansion of the group by bounded predicates and group automorphisms). It is shown that every such structure has an elementary extension N such that either N is a reduct of an ordered vector space, or there is an o-minimal structure , with the same universe but of different language from N, with (i) Every definable set in N is definable in , and (ii) has an elementary substructure in which every bounded interval admits a definable real closed field.As a result certain questions about definably compact groups can be reduced to either ordered vector spaces or expansions of real closed fields. Using the known results in these two settings, the number of torsion points in definably compact abelian groups in expansions of ordered groups is given. Pillay's Conjecture for such groups follows.

Assignment of ordinals to patterns of resemblance

In [2] T. J. Carlson introduces an approach to ordinal notation systems which is based on the notion of Σ1-elementary substructure. We gave a detailed ordinal arithmetical analysis (see [7]) of the ordinal structure based on Σ1-elementarily as defined in [2]. This involved the development of an appropriate ordinal arithmetic that is based on a system of classical ordinal notations derived from Skolem hull operators, see [6]. In the present paper we establish an effective order isomorphism between the classical and the new system of ordinal notations using the results from [6] and [7]. Moreover, on the basis of a concept of relativization we develop mutual (relatively) elementary recursive assignments which are uniform with respect to the underlying relativization.

On Σ1-Structural Differences Among Finite Levels of the Ershov Hierarchy

We show that the structure of recursively enumerable degrees is not a Σ1-elementary substructure of , where (n > 1) is the structure of n-r.e. degrees in the Ershov hierarchy.

Stable theories with a new predicate

Let M be an L-structure and A be an infinite subset of M. Two structures can be defined from A:• The induced structure on A has a name Rφ for every ∅-definable relation φ(M) ∩ An on A. Its language isA with its Lind-structure will be denoted by Aind.• The pair (M, A) is an L(P)-structure, where P is a unary predicate for A and L(P) = L ∪{P}.We call A small if there is a pair (N, B) elementarily equivalent to (M, A) and such that for every finite subset b of N every L–type over Bb is realized in N.A formula φ(x, y) has the finite cover property (f.c.p) in M if for all natural numbers k there is a set of φ–formulaswhich is k–consistent but not consistent in M. M has the f.c.p if some formula has the f.c.p in M. It is well known that unstable structures have the f.c.p. (see [6].) We will prove the following two theorems.Theorem A. Let A be a small subset of M. If M does not have the finite cover property then, for every λ ≥ ∣L∣, if both M andAindare λ–stable then (M, A) is λ–stable.Corollary 1.1 (Poizat [5]). If M does not have the finite cover property and N ≺ M is a small elementary substructure, then (M, N) is stable.Corollary 1.2 (Zilber [7]). If U is the group of wots of unity in the field ℂ of complex numbers the pair (ℂ, U) isω–stable.Proof. (See [4].) As a strongly minimal set ℂ is ω–stable and does not have the f.c.p. By the subspace theorem of Schmidt [3] every algebraic set intersects U in a finite union of translates of subgroups definable in the group structure of U alone. Whence Uind is nothing more than a (divisible) abelian group, which is ω–stable.

Filtral powers of structures

Among the results of this paper are the following:1. Every Boolean (ultra)power is the union of an updirected elementary family of direct ultrapowers.2. Under certain conditions, a finitely iterated Boolean ultrapower is isomorphic to a single Boolean ultrapower.3. A ω-bounded filtral power is an elementary substructure of a filtral power.4. Let be an elementary class closed under updirected unions (e.g., if is an amalgamation class); then is closed under finite products if and only if is closed under reduced products if and only if is a Horn class.