|
Trudy Matematicheskogo Instituta imeni V.A. Steklova, 2011, Volume 274, Pages 119–129
(Mi tm3321)
|
|
|
|
This article is cited in 32 scientific papers (total in 32 papers)
Degrees of autostability relative to strong constructivizations
S. S. Goncharovab a Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russia
b Novosibirsk State University, Novosibirsk, Russia
Abstract:
The spectra of the Turing degrees of autostability of computable models are studied. For almost prime decidable models, it is shown that the autostability spectrum relative to strong constructivizations of such models always contains a certain recursively enumerable Turing degree; moreover, it is shown that for any recursively enumerable Turing degree, there exist prime models in which this degree is the least one in the autostability spectrum relative to strong constructivizations.
Received in November 2010
Citation:
S. S. Goncharov, “Degrees of autostability relative to strong constructivizations”, Algorithmic aspects of algebra and logic, Collected papers. Dedicated to Academician Sergei Ivanovich Adian on the occasion of his 80th birthday, Trudy Mat. Inst. Steklova, 274, MAIK Nauka/Interperiodica, Moscow, 2011, 119–129; Proc. Steklov Inst. Math., 274 (2011), 105–115
Linking options:
https://www.mathnet.ru/eng/tm3321 https://www.mathnet.ru/eng/tm/v274/p119
|
|