Complexity of some natural problems on the class of computable -algebras.
Sibirskij Matematicheskij Zhurnal (2006)
- Volume: 47, Issue: 2, page 352-360
- ISSN: 0037-4474
Access Full Article
top
How to cite
topKogabaev, N.T.. "Complexity of some natural problems on the class of computable -algebras.." Sibirskij Matematicheskij Zhurnal 47.2 (2006): 352-360. <http://eudml.org/doc/53169>.
@article{Kogabaev2006,
author = {Kogabaev, N.T.},
journal = {Sibirskij Matematicheskij Zhurnal},
keywords = {computable Boolean algebra with distinguished ideals; computable isomorphism; computably categorical structure; arithmetical complexity; analytical complexity},
language = {eng},
number = {2},
pages = {352-360},
publisher = {Sibirskoe Otdelenie Rossijskoj Akademii Nauk, Institut Matematiki Im. S. L. Soboleva SO RAN, Novosibirsk; Izdatel'stvo Instituta Matematiki},
title = {Complexity of some natural problems on the class of computable -algebras.},
url = {http://eudml.org/doc/53169},
volume = {47},
year = {2006},
}
TY - JOUR
AU - Kogabaev, N.T.
TI - Complexity of some natural problems on the class of computable -algebras.
JO - Sibirskij Matematicheskij Zhurnal
PY - 2006
PB - Sibirskoe Otdelenie Rossijskoj Akademii Nauk, Institut Matematiki Im. S. L. Soboleva SO RAN, Novosibirsk; Izdatel'stvo Instituta Matematiki
VL - 47
IS - 2
SP - 352
EP - 360
LA - eng
KW - computable Boolean algebra with distinguished ideals; computable isomorphism; computably categorical structure; arithmetical complexity; analytical complexity
UR - http://eudml.org/doc/53169
ER -
NotesEmbed ?
topYou 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.