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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have