Kazan Federal University Digital Repository

Browsing by Subject "computable presentability"

Browsing by Subject "computable presentability"

Sort by: Order: Results:

  • Frolov A.N. (2021)
    The main goal of this paper is to study algorithmic properties of countable linear orders by constructing effective presentations of these structures on the set of natural numbers. In 1991, C. Jockusch and R. Soare constructed ...

Search DSpace

Browse

My Account