Вычислимые классы конструктивизаций моделей бесконечной алгоритмической размерности

Ю.Г. Венцов

Algebra i Logika (1994)

  • Volume: 33, Issue: 1, page 37-75
  • ISSN: 0373-9252

How to cite

top

Венцов, Ю.Г.. "Вычислимые классы конструктивизаций моделей бесконечной алгоритмической размерности." Algebra i Logika 33.1 (1994): 37-75. <http://eudml.org/doc/187674>.

@article{Венцов1994,
author = {Венцов, Ю.Г.},
journal = {Algebra i Logika},
keywords = {constructivization; branching model; unbounded model; computable class of constructivizations; autostable model; recursively categorical model; constructivizable model; infinite algorithmic dimension},
language = {rus},
number = {1},
pages = {37-75},
publisher = {Akademija Nauk SSSR, Sibirskoe Otdelenie, Institut Matematiki},
title = {Вычислимые классы конструктивизаций моделей бесконечной алгоритмической размерности},
url = {http://eudml.org/doc/187674},
volume = {33},
year = {1994},
}

TY - JOUR
AU - Венцов, Ю.Г.
TI - Вычислимые классы конструктивизаций моделей бесконечной алгоритмической размерности
JO - Algebra i Logika
PY - 1994
PB - Akademija Nauk SSSR, Sibirskoe Otdelenie, Institut Matematiki
VL - 33
IS - 1
SP - 37
EP - 75
LA - rus
KW - constructivization; branching model; unbounded model; computable class of constructivizations; autostable model; recursively categorical model; constructivizable model; infinite algorithmic dimension
UR - http://eudml.org/doc/187674
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.