Группы автоморфизмов вычислимо перечислимых предикатов.

Э.Ф. Комбарро

Algebra i Logika (2002)

  • Volume: 41, Issue: 5, page 515-530
  • ISSN: 0373-9252

How to cite

top

Комбарро, Э.Ф.. "Группы автоморфизмов вычислимо перечислимых предикатов.." Algebra i Logika 41.5 (2002): 515-530. <http://eudml.org/doc/188024>.

@article{Комбарро2002,
author = {Комбарро, Э.Ф.},
journal = {Algebra i Logika},
keywords = {universal computable function; universal computably enumerable relation; universal partial recursive function; universal recursively enumerable relation; automorphism group},
language = {rus},
number = {5},
pages = {515-530},
publisher = {Akademija Nauk SSSR, Sibirskoe Otdelenie, Institut Matematiki},
title = {Группы автоморфизмов вычислимо перечислимых предикатов.},
url = {http://eudml.org/doc/188024},
volume = {41},
year = {2002},
}

TY - JOUR
AU - Комбарро, Э.Ф.
TI - Группы автоморфизмов вычислимо перечислимых предикатов.
JO - Algebra i Logika
PY - 2002
PB - Akademija Nauk SSSR, Sibirskoe Otdelenie, Institut Matematiki
VL - 41
IS - 5
SP - 515
EP - 530
LA - rus
KW - universal computable function; universal computably enumerable relation; universal partial recursive function; universal recursively enumerable relation; automorphism group
UR - http://eudml.org/doc/188024
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.