|
Vestnik Novosibirskogo Gosudarstvennogo Universiteta. Seriya Matematika, Mekhanika, Informatika, 2008, Volume 8, Issue 2, Pages 38–53
(Mi vngu287)
|
|
|
|
Algorithmic Compexity of Countable Models of Strongly Minimal Theories
S. S. Goncharov Novosibirsk State University
Abstract:
A positive solution of S. Lempp’s hypothesis is obtained. We’ve proved, that all countable models of strongly minimal models are computable with oracle $0^2$, if this theory has at least one computable model.
Received: 20.12.2007
Citation:
S. S. Goncharov, “Algorithmic Compexity of Countable Models of Strongly Minimal Theories”, Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 8:2 (2008), 38–53
Linking options:
https://www.mathnet.ru/eng/vngu287 https://www.mathnet.ru/eng/vngu/v8/i2/p38
|
Statistics & downloads: |
Abstract page: | 167 | Full-text PDF : | 53 | References: | 36 | First page: | 1 |
|