|
This article is cited in 7 scientific papers (total in 7 papers)
Degrees of autostability relative to strong constructivizations of graphs
N. A. Bazhenovab, M. I. Marchukab a Sobolev Institute of Mathematics, Novosibirsk, Russia
b Novosibirsk State University, Novosibirsk, Russia
Abstract:
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.
Keywords:
computable model, strongly constructivizable model, autostability, autostability relative to strong constructivizations, degree of autostability relative to strong constructivizations, autostability spectrum relative to strong constructivizations, $PA$-degree, computably enumerable degree, graph.
Received: 01.11.2017
Citation:
N. A. Bazhenov, M. I. Marchuk, “Degrees of autostability relative to strong constructivizations of graphs”, Sibirsk. Mat. Zh., 59:4 (2018), 719–735; Siberian Math. J., 59:4 (2018), 565–577
Linking options:
https://www.mathnet.ru/eng/smj3006 https://www.mathnet.ru/eng/smj/v59/i4/p719
|
Statistics & downloads: |
Abstract page: | 249 | Full-text PDF : | 42 | References: | 39 | First page: | 6 |
|