Вычисления на машинах Тьюринга в конечно-аксиоматизируемых теориях.

М.Г. Перетятькин

Algebra i Logika (1983)

  • Volume: 21, Issue: 4, page 410-441
  • ISSN: 0373-9252

How to cite

top

Перетятькин, М.Г.. "Вычисления на машинах Тьюринга в конечно-аксиоматизируемых теориях.." Algebra i Logika 21.4 (1983): 410-441. <http://eudml.org/doc/187188>.

@article{Перетятькин1983,
author = {Перетятькин, М.Г.},
journal = {Algebra i Logika},
keywords = {complexity of classes of formulas; recursively enumerable theory; Lindenbaum algebra; properties of simple models; superstable theory},
language = {rus},
number = {4},
pages = {410-441},
publisher = {Akademija Nauk SSSR, Sibirskoe Otdelenie, Institut Matematiki},
title = {Вычисления на машинах Тьюринга в конечно-аксиоматизируемых теориях.},
url = {http://eudml.org/doc/187188},
volume = {21},
year = {1983},
}

TY - JOUR
AU - Перетятькин, М.Г.
TI - Вычисления на машинах Тьюринга в конечно-аксиоматизируемых теориях.
JO - Algebra i Logika
PY - 1983
PB - Akademija Nauk SSSR, Sibirskoe Otdelenie, Institut Matematiki
VL - 21
IS - 4
SP - 410
EP - 441
LA - rus
KW - complexity of classes of formulas; recursively enumerable theory; Lindenbaum algebra; properties of simple models; superstable theory
UR - http://eudml.org/doc/187188
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.