Add to ORKG© 2019, Springer Nature Switzerland AG. We show that for both the unary relation of transcendence and the finitary relation of algebraic independence on a field, the degree spectra of these relations may consist of any single computably enumerable Turing degree, or of those c.e. degrees above an arbitrary fixed Δ20 degree. In other cases, these spectra may be characterized by the ability to enumerate an arbitrary Σ20 set. This is the first proof that a computable field can fail to have a computable copy with a computable transcendence basis
We prove that a nontrivial degree spectrum of the successor relation of either strongly η-like or no...
Theory of transcendental numbers has been considered in the paper. The estimation of the transcenden...
© 2016, Association for Symbolic Logic.We study Turing degrees a for which there is a countable stru...
© 2019, Springer Nature Switzerland AG. We show that for both the unary relation of transcendence an...
An algebraic field extension of ℚ or ℤ/(p) may be regarded either as a structure in its own right, o...
© 2020, Pleiades Publishing, Ltd. Abstract: The investigation of computability in topological struct...
A standard way to capture the inherent complexity of the isomorphism type of a countable structure i...
Abstract. We introduce the notion of a degree spectrum of a complete theory to be the set of Turing ...
AbstractWe show that for every computably enumerable (c.e.) degree a>0 there is an intrinsically c.e...
Let X be a unary relation on the domain of (ω,<). The degree spectrum of X on (ω,<) is the set of T...
websupport1.citytech.cuny.edu/faculty/hschoutens/ Abstract. We construct a computable, computably ca...
AbstractThe spectrum of a relation R on a computable structure is the set of Turing degrees of the i...
We survey known results on spectra of structures and on spectra of relations on computable structure...
We establish that for every computably enumerable (c.e.) Turing degree b the upper cone of c.e. Turi...
Abstract. A computable presentation of the linearly ordered set (ω,≤), where ω is the set of natural...
We prove that a nontrivial degree spectrum of the successor relation of either strongly η-like or no...
Theory of transcendental numbers has been considered in the paper. The estimation of the transcenden...
© 2016, Association for Symbolic Logic.We study Turing degrees a for which there is a countable stru...
© 2019, Springer Nature Switzerland AG. We show that for both the unary relation of transcendence an...
An algebraic field extension of ℚ or ℤ/(p) may be regarded either as a structure in its own right, o...
© 2020, Pleiades Publishing, Ltd. Abstract: The investigation of computability in topological struct...
A standard way to capture the inherent complexity of the isomorphism type of a countable structure i...
Abstract. We introduce the notion of a degree spectrum of a complete theory to be the set of Turing ...
AbstractWe show that for every computably enumerable (c.e.) degree a>0 there is an intrinsically c.e...
Let X be a unary relation on the domain of (ω,<). The degree spectrum of X on (ω,<) is the set of T...
websupport1.citytech.cuny.edu/faculty/hschoutens/ Abstract. We construct a computable, computably ca...
AbstractThe spectrum of a relation R on a computable structure is the set of Turing degrees of the i...
We survey known results on spectra of structures and on spectra of relations on computable structure...
We establish that for every computably enumerable (c.e.) Turing degree b the upper cone of c.e. Turi...
Abstract. A computable presentation of the linearly ordered set (ω,≤), where ω is the set of natural...
We prove that a nontrivial degree spectrum of the successor relation of either strongly η-like or no...
Theory of transcendental numbers has been considered in the paper. The estimation of the transcenden...
© 2016, Association for Symbolic Logic.We study Turing degrees a for which there is a countable stru...