|
This article is cited in 8 scientific papers (total in 8 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.
Received: 18.12.2012 Revised: 06.09.2015
Citation:
D. A. Tussupov, “Isomorphisms and algorithmic properties of structures with two equivalences”, Algebra Logika, 55:1 (2016), 75–86; Algebra and Logic, 55:1 (2016), 50–57
Linking options:
https://www.mathnet.ru/eng/al730 https://www.mathnet.ru/eng/al/v55/i1/p75
|
Statistics & downloads: |
Abstract page: | 239 | Full-text PDF : | 49 | References: | 39 | First page: | 6 |
|