Kazan Federal University Digital Repository

Browsing by Subject "Quasidiscrete linear ordering"

Browsing by Subject "Quasidiscrete linear ordering"

Sort by: Order: Results:

  • Alaev P.; Thurber J.; Frolov A. (2009)
    Let L be a quasidiscrete linear ordering. We specify some conditions for the existence of a computable presentation for L or for the structure (L, adj), where adj(x, y) is a predicate distinguishing adjacent elements. © ...

Search DSpace

Browse

My Account