Vestnik Novosibirskogo Gosudarstvennogo Universiteta. Seriya Matematika, Mekhanika, Informatika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Sib. J. Pure and Appl. Math.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

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
Full-text PDF (255 kB)
References:
PDF
HTML
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
Document Type: Article
UDC: 517.1+519.5
Language: Russian
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
Citation in format AMSBIB
\Bibitem{Gon08}
\by S.~S.~Goncharov
\paper Algorithmic Compexity of Countable Models of Strongly Minimal Theories
\jour Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform.
\yr 2008
\vol 8
\issue 2
\pages 38--53
\mathnet{http://mi.mathnet.ru/vngu287}
Linking options:
  • https://www.mathnet.ru/eng/vngu287
  • https://www.mathnet.ru/eng/vngu/v8/i2/p38
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Вестник Новосибирского государственного университета. Серия: математика, механика, информатика
    Statistics & downloads:
    Abstract page:180
    Full-text PDF :60
    References:40
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024