Минимальные нумерации позитивно вычислимых семейств

С.А. Бадаев; S. A. Badaev; S. A. Badaev; S. A. Badaev

Algebra i Logika (1994)

  • Volume: 33, Issue: 3, page 233-254
  • ISSN: 0373-9252

How to cite

top

Бадаев, С.А., et al. "Минимальные нумерации позитивно вычислимых семейств." Algebra i Logika 33.3 (1994): 233-254. <http://eudml.org/doc/187684>.

@article{Бадаев1994,
author = {Бадаев, С.А., Badaev, S. A., Badaev, S. A., Badaev, S. A.},
journal = {Algebra i Logika},
keywords = {computable numerations; computable family of recursively enumerable sets; semilattices of computable numerations},
language = {rus},
number = {3},
pages = {233-254},
publisher = {Akademija Nauk SSSR, Sibirskoe Otdelenie, Institut Matematiki},
title = {Минимальные нумерации позитивно вычислимых семейств},
url = {http://eudml.org/doc/187684},
volume = {33},
year = {1994},
}

TY - JOUR
AU - Бадаев, С.А.
AU - Badaev, S. A.
AU - Badaev, S. A.
AU - Badaev, S. A.
TI - Минимальные нумерации позитивно вычислимых семейств
JO - Algebra i Logika
PY - 1994
PB - Akademija Nauk SSSR, Sibirskoe Otdelenie, Institut Matematiki
VL - 33
IS - 3
SP - 233
EP - 254
LA - rus
KW - computable numerations; computable family of recursively enumerable sets; semilattices of computable numerations
UR - http://eudml.org/doc/187684
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.