Computability on linear orderings enriched with predicates

Abstract

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. © 2009 Springer Science+Business Media, Inc.