Degrees of Autostability Relative to Strong Constructivizations of Graphs
- Авторы: Bazhenov N.1, Marchuk M.1
-
Учреждения:
- Sobolev Institute of Mathematics
- Выпуск: Том 59, № 4 (2018)
- Страницы: 565-577
- Раздел: Article
- URL: https://journals.rcsi.science/0037-4466/article/view/171937
- DOI: https://doi.org/10.1134/S0037446618040018
- ID: 171937
Цитировать
Аннотация
We show that each computably enumerable Turing degree is a degree of autostability relative to strong constructivizations for a decidable directed graph. We construct a decidable undirected graph whose autostability spectrum relative to strong constructivizations is equal to the set of all PA-degrees.
Ключевые слова
Об авторах
N. Bazhenov
Sobolev Institute of Mathematics
Автор, ответственный за переписку.
Email: bazhenov@math.nsc.ru
Россия, Novosibirsk
M. Marchuk
Sobolev Institute of Mathematics
Email: bazhenov@math.nsc.ru
Россия, Novosibirsk