Add to ORKGThis thesis explores computable linear orders through Turing Reductions and codes zero jump and zero double jump into linear orders using discrete, dense, and block linear relations
We survey known results on spectra of structures and on spectra of relations on computable structure...
The main goal of this paper is to study algorithmic properties of countable linear orders by constru...
We study computable linear orders with computable neighborhood and block predicates. In particular, ...
This thesis explores computable linear orders through Turing Reductions and codes zero jump and zero...
© 2018, Allerton Press, Inc. We give the collection of relations on computable linear orders. For an...
© 2020 Cambridge University Press. All rights reserved. We characterize the linear order types with ...
© 2014, Pleiades Publishing, Ltd. We study an algorithmic dependence of natural relations on linear ...
This thesis examines three areas in computability theory. In Chapter 2 we look at certain classes...
We prove that a nontrivial degree spectrum of the successor relation of either strongly η-like or no...
Linear orders and initial segments A linear order may be highly computable, but have complicated ini...
We establish that for every computably enumerable (c.e.) Turing degree b the upper cone of c.e. Turi...
Abstract. In this paper, we solve a long-standing open ques-tion (see, e.g., Downey [6, §7] and Down...
We describe a programme of research which aims to find natural definability results in the Turing de...
We survey known results on spectra of structures and on spectra of relations on computable structure...
The main goal of this paper is to study algorithmic properties of countable linear orders by constru...
We study computable linear orders with computable neighborhood and block predicates. In particular, ...
This thesis explores computable linear orders through Turing Reductions and codes zero jump and zero...
© 2018, Allerton Press, Inc. We give the collection of relations on computable linear orders. For an...
© 2020 Cambridge University Press. All rights reserved. We characterize the linear order types with ...
© 2014, Pleiades Publishing, Ltd. We study an algorithmic dependence of natural relations on linear ...
This thesis examines three areas in computability theory. In Chapter 2 we look at certain classes...
We prove that a nontrivial degree spectrum of the successor relation of either strongly η-like or no...
Linear orders and initial segments A linear order may be highly computable, but have complicated ini...
We establish that for every computably enumerable (c.e.) Turing degree b the upper cone of c.e. Turi...
Abstract. In this paper, we solve a long-standing open ques-tion (see, e.g., Downey [6, §7] and Down...
We describe a programme of research which aims to find natural definability results in the Turing de...
We survey known results on spectra of structures and on spectra of relations on computable structure...
The main goal of this paper is to study algorithmic properties of countable linear orders by constru...
We study computable linear orders with computable neighborhood and block predicates. In particular, ...