Turing degrees of isomorphism types of algebraic objects

Calvert, Wesley; Harizanov, Valentina S.; Shlapentokh, Alexandra

doi:10.1112/jlms/jdl012

Cited by 27 publications

(26 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The results in [1] were proved using the two following cumbersome, but not technically difficult frameworks. Theorem 1.4 ( [1]). Let C be a class of countable structures in a computable language L, closed under isomorphisms.…”

Section: Introductionmentioning

confidence: 86%

Turing Degrees of Isomorphism Types of Geometric Objects

2014

Self Cite

View full text Add to dashboard Cite

We initiate the computability-theoretic study of ringed spaces and schemes. In particular, we show that any Turing degree may occur as the least degree of an isomorphic copy of a structure of these kinds. We also show that these structures may fail to have a least degree. a category, one must construct pathological examples, and all of the examples in this paper are, in some sense, pathological.A broader goal of this paper is to initiate work in model theory and computable model theory on these classes of objects, especially schemes. To date, while there has been work on varieties, compact complex manifolds, and Kähler manifolds [13,14,15], we have been able to find no work on schemes in model theory or computable model theory.We believe that this does not owe to a lack of interest in schemes, but rather to their reputation for difficulty. Since the calculation of degrees of isomorphism types is a central question of computable model theory, it is our hope that our success with this problem will encourage more work in this area. In any case, Section 2 provides the logical infrastructure that any such work would require: a determination of a language whose morphisms correspond exactly to the classical homomorphisms.More precisely, we study Turing degrees of isomorphism types of structures from some well-known classes. This is a natural way, introduced by Jockusch and Richter (see [16]), of expressing the algorithmic complexity of the structure. We consider only countable structures for computable languages. The universe A of an infinite countable structure A can be identified with the set ω of all natural numbers. Furthermore, we often use the same symbol for the structure and its universe. (For the definition of a language and a structure see p. 8 of [11], and for a definition of a computable language see p. 509 of [12].)The two motivating constructions of the paper are of a union of varieties (Section 4) and schemes (Section 5). In the remainder of the present section, we will describe some necessary algorithmic and geometric background. Section 2 will describe a language for treating varieties, schemes, and other ringed spaces as first order structures (in the sense of model theory). The remaining three sections (excluding the appendix) will each develop an example of a class of structures that admits (in a sense to be made precise in Section 1.1) the encoding of arbitrary Turing degrees and of a minimal pair of Turing degrees. Section 3 explores the class of unions of subspaces of a fixed variety, under a weak topology. Section 4 constructs a union of varieties, and section 5 constructs schemes.1.1. Definitions, and Statement of Main Results. We say that a set X is Turing reducible to (computable in) a set Y , in symbols X ≤ T Y , if X can be computed by an algorithm with Y in its oracle. Turing reducibility is the more basic notion, in terms of which Turing degree is defined. We say that the sets X and Y are Turing equivalent, or have the same Turing degree, if X ≤ T Y and Y ≤ T X. We use ≡ T for Turing equiv...

show abstract

Section: Introductionmentioning

confidence: 86%

Turing Degrees of Isomorphism Types of Geometric Objects

2014

Self Cite

View full text Add to dashboard Cite

show abstract

“…Corollary 2 (Calvert, Harizanov, Shlapentokh; see [1]). There exists an algebraic field whose spectrum contains no least Turing degree.…”

Section: Consequencesmentioning

confidence: 99%

“…Corollary 3 (Calvert, Harizanov, Shlapentokh; see [1]). Every upper cone of Turing degrees forms the spectrum of some algebraic field.…”

Section: Consequencesmentioning

confidence: 99%

Spectra of Algebraic Fields and Subfields

Frolov

Kalimullin

Miller

2009

Mathematical Theory and Computational Practice

View full text Add to dashboard Cite

Abstract. An algebraic field extension of Q or Z/(p) may be regarded either as a structure in its own right, or as a subfield of its algebraic closure F (either Q or Z/(p)). We consider the Turing degree spectrum of F in both cases, as a structure and as a relation on F , and characterize the sets of Turing degrees that are realized as such spectra. The results show a connection between enumerability in the structure F and computability when F is seen as a subfield of F .

show abstract

Section: Introduction Preliminaries and Notationmentioning

confidence: 99%

“…Calvert, Harizanov and Shlapentokh [5] recently proved that there are torsion-free abelian groups of any finite rank whose isomorphism types have arbitrary Turing degrees, as well as torsion-free abelian groups of any finite rank whose isomorphism types fail to have a Turing degree. Calvert, Harizanov and Shlapentokh [5] also obtained similar results for (countable) fields and rings of algebraic numbers and functions. Hirschfeldt, Khoussainov, Shore and Slinko [15] established a general result from which it follows that there is a 2-step nilpotent group, also called metabelian (see [28]), with an arbitrary Turing degree of its isomorphism type, as well as a metabelian group without a degree of its isomorphism type.…”

Section: Introduction Preliminaries and Notationmentioning

confidence: 99%

Turing degrees of nonabelian groups

Dabkowska

Da̧bkowski

Harizanov

et al. 2007

Proc. Amer. Math. Soc.

View full text Add to dashboard Cite

Abstract. For a countable structure A, the (Turing) degree spectrum of A is the set of all Turing degrees of its isomorphic copies. If the degree spectrum of A has the least degree d, then we say that d is the (Turing) degree of the isomorphism type of A. So far, degrees of the isomorphism types have been studied for abelian and metabelian groups. Here, we focus on highly nonabelian groups. We show that there are various centerless groups whose isomorphism types have arbitrary Turing degrees. We also show that there are various centerless groups whose isomorphism types do not have Turing degrees.

show abstract

Turing degrees of isomorphism types of algebraic objects

Cited by 27 publications

References 28 publications

Turing Degrees of Isomorphism Types of Geometric Objects

Turing Degrees of Isomorphism Types of Geometric Objects

Spectra of Algebraic Fields and Subfields

Turing degrees of nonabelian groups

Contact Info

Product

Resources

About