|
This article is cited in 14 scientific papers (total in 14 papers)
Index set of structures with two equivalence relations that are autostable relative to strong constructivizations
M. I. Marchukab a Sobolev Institute of Mathematics, pr. Akad. Koptyuga 4, Novosibirsk, 630090 Russia
b Novosibirsk State University, ul. Pirogova 2, Novosibirsk, 630090 Russia
Abstract:
We derive a bound on the algorithmic complexity for the class of computable structures with two equivalence relations that have a strong constructivization and are autostable relative to strong constructivizations. We construct codings of a linear order and of an automorphically nontrivial directed irreflexive graph into a structure with two equivalence relations. It is proved that such codings preserve the degree spectrum and $d$-computable dimension.
Keywords:
autostability relative to strong constructivizations, computable structure, hyperarithmetical hierarchy, index set, irreflexive directed graph, coding, linear order, strongly constructivizable structure, structure with two equivalence relations.
Received: 25.02.2016 Revised: 17.07.2016
Citation:
M. I. Marchuk, “Index set of structures with two equivalence relations that are autostable relative to strong constructivizations”, Algebra Logika, 55:4 (2016), 465–477; Algebra and Logic, 55:4 (2016), 306–314
Linking options:
https://www.mathnet.ru/eng/al753 https://www.mathnet.ru/eng/al/v55/i4/p465
|
Statistics & downloads: |
Abstract page: | 205 | Full-text PDF : | 44 | References: | 45 | First page: | 9 |
|