Browsing by Subject "Computable linear order"

Sort by: Order: Results:

  • Ng K.; Zubkov M. (2019)
    © 2019 American Mathematical Society. We settle the long-standing Kierstead conjecture in the negative. We do this by constructing a computable linear order with no rational subintervals, where every block has order type ...

Search DSpace

Browse

My Account