Related papers: Degree spectra for transcendence in fields

The finite spectrum of a first-order sentence is the set of positive integers that are the sizes of its models. The class of finite spectra is known to be the same as the complexity class NE. We consider the spectra obtained by limiting…

Let $A$ be a finite-dimensional division algebra containing a base field $k$ in its center $F$. We say that $A$ is defined over a subfield $F_0$ of $F$ if $A = A_0\otimes_{F_0} F$ for some $F_0$-subalgebra $A_0$ of $A$. We show that: (1) In…

We study the degree spectra and reverse-mathematical applications of computably enumerable and co-computably enumerable partial orders. We formulate versions of the chain/antichain principle and ascending/descending sequence principle for…

Models of computation operating over the real numbers and computing a larger class of functions compared to the class of general recursive functions invariably introduce a non-finite element of infinite information encoded in an arbitrary…

We define a transcendence degree for division algebras, by modifying the lower transcendence degree construction of Zhang. We show that this invariant has many of the desirable properties one would expect a noncommutative analogue of the…

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

We study degree spectra of structures with respect to the bi-embeddability relation. The bi-embeddability spectrum of a structure is the family of Turing degrees of its bi-embeddable copies. To facilitate our study we introduce the notions…

We use a generalization of a construction by Ziegler to show that for any field $F$ and any countable collection of countable subsets $A_i \subseteq F, i \in \calI \subset \Z_{>0}$ there exist infinitely many fields $K$ of arbitrary…

We give a characterization of the strong degrees of categoricity of computable structures greater or equal to $\mathbf 0''$. They are precisely the \emph{treeable} degrees -- the least degrees of paths through computable trees -- that…

We prove that there is a structure, indeed a linear ordering, whose degree spectrum is the set of all non-hyperarithmetic degrees. We also show that degree spectra can distinguish measure from category.

To what extent does the maximal subfield spectrum of a division algebra determine the isomorphism class of that algebra? It has been shown that over some fields a quaternion division algebra's isomorphism class is largely if not entirely…

A computably presented algebraic field $F$ has a \emph{splitting algorithm} if it is decidable which polynomials in $F[X]$ are irreducible there. We prove that such a field is computably categorical iff it is decidable which pairs of…

One of the fundamental results in computability is the existence of well-defined functions that cannot be computed. In this paper we study the effects of data representation on computability; we show that, while for each possible way of…

We are studying the degrees in which a computable structure is relatively computably categoricity, i.e., computably categorcial among all non-computable copies of the structure. Unlike the degrees of computable categoricity we can bound the…

We give a sufficient condition for an algebraic structure to have a computable presentation with a computable basis and a computable presentation with no computable basis. We apply the condition to differentially closed, real closed, and…

A standard tool for classifying the complexity of equivalence relations on $\omega$ is provided by computable reducibility. This reducibility gives rise to a rich degree structure. The paper studies equivalence relations, which induce…

Computably enumerable equivalence relations (ceers) received a lot of attention in the literature. The standard tool to classify ceers is provided by the computable reducibility $\leq_c$. This gives rise to a rich degree-structure. In this…

We examine categoricity issues for computable algebraic fields. We give a structural criterion for relative computable categoricity of these fields, and use it to construct a field that is computably categorical, but not relatively…

We examine the degree structure $\mathbf{ER}$ of equivalence relations on $\omega$ under computable reducibility. We examine when pairs of degrees have a join. In particular, we show that sufficiently incomparable pairs of degrees do not…

Selman's Theorem in classical Computability Theory gives a characterization of the enumeration reducibility for arbitrary sets in terms of the enumeration reducibility on the total sets: $A \le_e B \iff \forall X [X \equiv_{e} X \oplus…