Финитно аппроксимируемая ассоциативная алгебра с неразрешимой проблемой равенства

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

Algebra i Logika (2000)

  • Volume: 39, Issue: 4, page 441-451
  • ISSN: 0373-9252

How to cite

top

Белеградек, О.В.. "Финитно аппроксимируемая ассоциативная алгебра с неразрешимой проблемой равенства." Algebra i Logika 39.4 (2000): 441-451. <http://eudml.org/doc/187938>.

@article{Белеградек2000,
author = {Белеградек, О.В.},
journal = {Algebra i Logika},
keywords = {word problem; associative algebras; residually finite algebras; finitely generated algebras; recursively defined algebras; commutative rings},
language = {rus},
number = {4},
pages = {441-451},
publisher = {Akademija Nauk SSSR, Sibirskoe Otdelenie, Institut Matematiki},
title = {Финитно аппроксимируемая ассоциативная алгебра с неразрешимой проблемой равенства},
url = {http://eudml.org/doc/187938},
volume = {39},
year = {2000},
}

TY - JOUR
AU - Белеградек, О.В.
TI - Финитно аппроксимируемая ассоциативная алгебра с неразрешимой проблемой равенства
JO - Algebra i Logika
PY - 2000
PB - Akademija Nauk SSSR, Sibirskoe Otdelenie, Institut Matematiki
VL - 39
IS - 4
SP - 441
EP - 451
LA - rus
KW - word problem; associative algebras; residually finite algebras; finitely generated algebras; recursively defined algebras; commutative rings
UR - http://eudml.org/doc/187938
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.