This article is cited in 9 papers

Isomorphisms and algorithmic properties of structures with two equivalences

D. A. Tussupov

Gumilyov Eurasian National University, ul. Satpaeva 2, Astana, Kazakhstan

Abstract: 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, definable relations.

UDC: 510.51

Received: 18.12.2012
Revised: 06.09.2015

DOI: 10.17377/alglog.2016.55.105

 English version: Algebra and Logic, 2016, 55:1, 50–57

Bibliographic databases:

• 
• 
•