Algebra i logika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Algebra Logika:
Year:
Volume:
Issue:
Page:
Find




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

Algebra i logika, 1994, Volume 33, Number 1, Pages 37–75 (Mi al2256)  
This article is cited in 2 scientific papers (total in 2 papers)

Computable classes of constructivizations of models of infinite algorithmic dimension

Yu. G. Ventsov

Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk
Full-text PDF (3454 kB) Citations (2)
Received: 25.05.1993
English version:
Algebra and Logic
DOI: https://doi.org/10.1007/BF00739415
Bibliographic databases:
Document Type: Article
UDC: 510.51
Language: Russian
Citation: Yu. G. Ventsov, “Computable classes of constructivizations of models of infinite algorithmic dimension”, Algebra Logika, 33:1 (1994), 37–75
Citation in format AMSBIB
\Bibitem{Ven94}
\by Yu.~G.~Ventsov
\paper Computable classes of constructivizations of models of
infinite algorithmic dimension
\jour Algebra Logika
\yr 1994
\vol 33
\issue 1
\pages 37--75
\mathnet{http://mi.mathnet.ru/al2256}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1287009}
Linking options:
  • https://www.mathnet.ru/eng/al2256
  • https://www.mathnet.ru/eng/al/v33/i1/p37
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Алгебра и логика Algebra and Logic
    Statistics & downloads:
    Abstract page:29
    Full-text PDF :16
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024