|
Sibirskii Matematicheskii Zhurnal, 1993, Volume 34, Number 5, Pages 23–37
(Mi smj829)
|
|
|
|
This article is cited in 5 scientific papers (total in 5 papers)
Computable classes of constructivizations for models of finite computability type
S. S. Goncharov
Abstract:
Computable classes of weak constructivizations are studied for models admitting strong constructivizations. We prove that for strongly constnictivizable models $n$-complete in some finite expansion with constants but $(n+1)$-complete in any expansion with constants, it is possible, given an arbitraty class of constructivizations, to construct effectively a constructivization beyond the class which is not an $(n+1)$-constructivization, i.e., whose $(n+1)$-restricted theory is not decidable in any expansion with constants for indices.
Received: 16.03.1993
Citation:
S. S. Goncharov, “Computable classes of constructivizations for models of finite computability type”, Sibirsk. Mat. Zh., 34:5 (1993), 23–37; Siberian Math. J., 34:5 (1993), 812–824
Linking options:
https://www.mathnet.ru/eng/smj829 https://www.mathnet.ru/eng/smj/v34/i5/p23
|
Statistics & downloads: |
Abstract page: | 254 | Full-text PDF : | 74 |
|