Isomorphisms and algorithmic properties of structures with two equivalences
Algebra i logika, Tome 55 (2016) no. 1, pp. 75-86
Voir la notice de l'article provenant de la source Math-Net.Ru
Isomorphisms and algorithmic properties of structures with two equivalences are considered using methods (developed by the author) for determining the definability of a graph in a bipartite graph and in a structure with two equivalences, which respect algorithmic and syntactic properties of the original structure.
Keywords:
computable structures, arithmetic and hyperarithmetic hierarchies, isomorphisms, Scott family
Mots-clés : definable relations.
Mots-clés : definable relations.
@article{AL_2016_55_1_a4,
author = {D. A. Tussupov},
title = {Isomorphisms and algorithmic properties of structures with two equivalences},
journal = {Algebra i logika},
pages = {75--86},
publisher = {mathdoc},
volume = {55},
number = {1},
year = {2016},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/AL_2016_55_1_a4/}
}
D. A. Tussupov. Isomorphisms and algorithmic properties of structures with two equivalences. Algebra i logika, Tome 55 (2016) no. 1, pp. 75-86. http://geodesic.mathdoc.fr/item/AL_2016_55_1_a4/