Add to ORKGWe study the weak truth-table and truth-table degrees of the images of subsets of computable structures under isomorphisms between computable structures. In particular, we show that there is a low c.e. set that is not weak truth-table reducible to any initial segment of any scattered computable linear order. Countable Π01 subsets of 2w and Kolmogorov complexity play a major role in the proof
AbstractA model is computable if its domain is a computable set and its relations and functions are ...
AbstractThe computable Lipschitz reducibility was introduced by Downey, Hirschfeldt and LaForte unde...
AbstractWhenever a structure with a particularly interesting computability-theoretic property is fou...
We study the weak truth table (wtt) degree spectra of first-order relational structures. We prove a ...
Let X be a unary relation on the domain of (ω,<). The degree spectrum of X on (ω,<) is the set of T...
Linear orders and initial segments A linear order may be highly computable, but have complicated ini...
Abstract. We investigate the connections between the complexity of a c.e. set, as calibrated by its ...
AbstractThe spectrum of a relation R on a computable structure is the set of Turing degrees of the i...
Abstract. A computable presentation of the linearly ordered set (ω,≤), where ω is the set of natural...
AbstractWe show that for every computably enumerable (c.e.) degree a>0 there is an intrinsically c.e...
We explore various areas of computability theory, ranging from applications in computable structure ...
The strong weak truth table (sw) reducibility was suggested by Downey, Hirschfeldt, and LaForte as a...
We survey known results on spectra of structures and on spectra of relations on computable structure...
This paper examines the constructive Hausdorff and packing dimensions of weak truth-table degrees. T...
We study Turing degrees a for which there is a countable structure whose degree spectrum is the col...
AbstractA model is computable if its domain is a computable set and its relations and functions are ...
AbstractThe computable Lipschitz reducibility was introduced by Downey, Hirschfeldt and LaForte unde...
AbstractWhenever a structure with a particularly interesting computability-theoretic property is fou...
We study the weak truth table (wtt) degree spectra of first-order relational structures. We prove a ...
Let X be a unary relation on the domain of (ω,<). The degree spectrum of X on (ω,<) is the set of T...
Linear orders and initial segments A linear order may be highly computable, but have complicated ini...
Abstract. We investigate the connections between the complexity of a c.e. set, as calibrated by its ...
AbstractThe spectrum of a relation R on a computable structure is the set of Turing degrees of the i...
Abstract. A computable presentation of the linearly ordered set (ω,≤), where ω is the set of natural...
AbstractWe show that for every computably enumerable (c.e.) degree a>0 there is an intrinsically c.e...
We explore various areas of computability theory, ranging from applications in computable structure ...
The strong weak truth table (sw) reducibility was suggested by Downey, Hirschfeldt, and LaForte as a...
We survey known results on spectra of structures and on spectra of relations on computable structure...
This paper examines the constructive Hausdorff and packing dimensions of weak truth-table degrees. T...
We study Turing degrees a for which there is a countable structure whose degree spectrum is the col...
AbstractA model is computable if its domain is a computable set and its relations and functions are ...
AbstractThe computable Lipschitz reducibility was introduced by Downey, Hirschfeldt and LaForte unde...
AbstractWhenever a structure with a particularly interesting computability-theoretic property is fou...