Geodesic
Computability on linear orderings enriched with predicates
Algebra i logika, Tome 48 (2009) no. 5, pp. 549-563

Voir la notice de l'article provenant de la source Math-Net.Ru

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,\operatorname{adj})$, where $\operatorname{adj}(x,y)$ is a predicate distinguishing adjacent elements.
Keywords: computability, quasidiscrete linear ordering. 
@article{AL_2009_48_5_a0,
     author = {P. E. Alaev and J. Thurber and A. N. Frolov},
     title = {Computability on linear orderings enriched with predicates},
     journal = {Algebra i logika},
     pages = {549--563},
     publisher = {mathdoc},
     volume = {48},
     number = {5},
     year = {2009},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/AL_2009_48_5_a0/}
}
TY  - JOUR
AU  - P. E. Alaev
AU  - J. Thurber
AU  - A. N. Frolov
TI  - Computability on linear orderings enriched with predicates
JO  - Algebra i logika
PY  - 2009
SP  - 549
EP  - 563
VL  - 48
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/AL_2009_48_5_a0/
LA  - ru
ID  - AL_2009_48_5_a0
ER  - 
%0 Journal Article
%A P. E. Alaev
%A J. Thurber
%A A. N. Frolov
%T Computability on linear orderings enriched with predicates
%J Algebra i logika
%D 2009
%P 549-563
%V 48
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/AL_2009_48_5_a0/
%G ru
%F AL_2009_48_5_a0
P. E. Alaev; J. Thurber; A. N. Frolov. Computability on linear orderings enriched with predicates. Algebra i logika, Tome 48 (2009) no. 5, pp. 549-563. http://geodesic.mathdoc.fr/item/AL_2009_48_5_a0/