Photo from archive.org
We give the collection of relations on computable linear orders. For any natural number n, the degree spectrum of such relations of some computable linear orders contains exactly all n-computable… Click to show full abstract
We give the collection of relations on computable linear orders. For any natural number n, the degree spectrum of such relations of some computable linear orders contains exactly all n-computable enumerable degrees. We also study interconnections of these relations among themselves.
Keywords:
computable linear;
orders ershov;
linear orders;
ershov hierarchy
Journal Title: Russian Mathematics
Year Published: 2018
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Russian Mathematics
Year Published: 2018
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!