Geodesic
Constructing decidable graphs from decidable structures
Algebra i logika, Tome 58 (2019) no. 5, pp. 553-573

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

It is shown that every structure (including one in an infinite language) can be transformed into a graph that is bi-interpretable with the original structure, for which the full elementary diagrams can be computed one from the other.
Keywords: decidable structure, decidable graph, bi-interpretable structures, full diagram. 
@article{AL_2019_58_5_a0,
     author = {N. A. Bazhenov and M. Harrison-Trainor},
     title = {Constructing decidable graphs from decidable structures},
     journal = {Algebra i logika},
     pages = {553--573},
     publisher = {mathdoc},
     volume = {58},
     number = {5},
     year = {2019},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/AL_2019_58_5_a0/}
}
TY  - JOUR
AU  - N. A. Bazhenov
AU  - M. Harrison-Trainor
TI  - Constructing decidable graphs from decidable structures
JO  - Algebra i logika
PY  - 2019
SP  - 553
EP  - 573
VL  - 58
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/AL_2019_58_5_a0/
LA  - ru
ID  - AL_2019_58_5_a0
ER  - 
%0 Journal Article
%A N. A. Bazhenov
%A M. Harrison-Trainor
%T Constructing decidable graphs from decidable structures
%J Algebra i logika
%D 2019
%P 553-573
%V 58
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/AL_2019_58_5_a0/
%G ru
%F AL_2019_58_5_a0
N. A. Bazhenov; M. Harrison-Trainor. Constructing decidable graphs from decidable structures. Algebra i logika, Tome 58 (2019) no. 5, pp. 553-573. http://geodesic.mathdoc.fr/item/AL_2019_58_5_a0/