Add to ORKGWe consider the class of so-called k-quasidiscrete linear orderings, show that every k-quasi-discrete ordering of low degree has a computable representation, and study estimates for the complexity of all isomorphisms constructed in the article. © 2010 Pleiades Publishing, Ltd
Abstract. A computable presentation of the linearly ordered set (ω,≤), where ω is the set of natural...
We survey known results on spectra of structures and on spectra of relations on computable structure...
In this thesis, we study computable content of existing classical theorems on linearisations of part...
We consider the class of so-called k-quasidiscrete linear orderings, show that every k-quasi-discret...
We say that L is weakly η-like if L/∼ is isomorphic to the natural ordering of rational numbers. We ...
The main goal of this paper is to study algorithmic properties of countable linear orders by constru...
It is proved that, for any n ω, there exist countable linear orderings Ln whose Δ 2 0 -spectrum cons...
Let L be a quasidiscrete linear ordering. We specify some conditions for the existence of a computab...
Linear orders and initial segments A linear order may be highly computable, but have complicated ini...
In dieser Arbeit verbinden wir die Theorie der Quasi-Ordnungen mit der Theorie der Algorithmen einig...
Abstract. In this paper, we solve a long-standing open ques-tion (see, e.g., Downey [6, §7] and Down...
We develop an approach to the longstanding conjecture of H.A. Kierstead concerning the character of ...
AbstractIt is shown that for every nonzero r.e. degree c there is a linear ordering of degree c whic...
Abstract. We show that the quasi-order of continuous embeddability between Þnitely branching den-dri...
This document is made available in accordance with publisher policies. Please cite only the publishe...
Abstract. A computable presentation of the linearly ordered set (ω,≤), where ω is the set of natural...
We survey known results on spectra of structures and on spectra of relations on computable structure...
In this thesis, we study computable content of existing classical theorems on linearisations of part...
We consider the class of so-called k-quasidiscrete linear orderings, show that every k-quasi-discret...
We say that L is weakly η-like if L/∼ is isomorphic to the natural ordering of rational numbers. We ...
The main goal of this paper is to study algorithmic properties of countable linear orders by constru...
It is proved that, for any n ω, there exist countable linear orderings Ln whose Δ 2 0 -spectrum cons...
Let L be a quasidiscrete linear ordering. We specify some conditions for the existence of a computab...
Linear orders and initial segments A linear order may be highly computable, but have complicated ini...
In dieser Arbeit verbinden wir die Theorie der Quasi-Ordnungen mit der Theorie der Algorithmen einig...
Abstract. In this paper, we solve a long-standing open ques-tion (see, e.g., Downey [6, §7] and Down...
We develop an approach to the longstanding conjecture of H.A. Kierstead concerning the character of ...
AbstractIt is shown that for every nonzero r.e. degree c there is a linear ordering of degree c whic...
Abstract. We show that the quasi-order of continuous embeddability between Þnitely branching den-dri...
This document is made available in accordance with publisher policies. Please cite only the publishe...
Abstract. A computable presentation of the linearly ordered set (ω,≤), where ω is the set of natural...
We survey known results on spectra of structures and on spectra of relations on computable structure...
In this thesis, we study computable content of existing classical theorems on linearisations of part...