Алгебраические эквиваленты разрешимости теоретико-групповых алгоритмических проблем

О.В. Белеградек

Sibirskij matematiceskij zurnal (1979)

  • Volume: 20, Issue: 5, page 953-963
  • ISSN: 0037-4466; 1573-9260/e

How to cite

top

Белеградек, О.В.. "Алгебраические эквиваленты разрешимости теоретико-групповых алгоритмических проблем." Sibirskij matematiceskij zurnal 20.5 (1979): 953-963. <http://eudml.org/doc/61949>.

@article{Белеградек1979,
author = {Белеградек, О.В.},
journal = {Sibirskij matematiceskij zurnal},
keywords = {word problem; recursively enumerable set; existentially closed group; finitely generated group; finitely presented group; verbal relation},
language = {rus},
number = {5},
pages = {953-963},
publisher = {Izd. AN SSSR},
title = {Алгебраические эквиваленты разрешимости теоретико-групповых алгоритмических проблем},
url = {http://eudml.org/doc/61949},
volume = {20},
year = {1979},
}

TY - JOUR
AU - Белеградек, О.В.
TI - Алгебраические эквиваленты разрешимости теоретико-групповых алгоритмических проблем
JO - Sibirskij matematiceskij zurnal
PY - 1979
PB - Izd. AN SSSR
VL - 20
IS - 5
SP - 953
EP - 963
LA - rus
KW - word problem; recursively enumerable set; existentially closed group; finitely generated group; finitely presented group; verbal relation
UR - http://eudml.org/doc/61949
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.