Boolean algebras with finite families of computable automorphisms.
Morozov, A.S.; Kasymkanuly, Boribaj
Sibirskij Matematicheskij Zhurnal (2004)
- Volume: 45, Issue: 1, page 171-177
- ISSN: 0037-4474
Access Full Article
top
How to cite
topMorozov, A.S., and Kasymkanuly, Boribaj. "Boolean algebras with finite families of computable automorphisms.." Sibirskij Matematicheskij Zhurnal 45.1 (2004): 171-177. <http://eudml.org/doc/52705>.
@article{Morozov2004,
author = {Morozov, A.S., Kasymkanuly, Boribaj},
journal = {Sibirskij Matematicheskij Zhurnal},
keywords = {groups of computable automorphisms; recursive model theory; recursive function; effective computability},
language = {eng},
number = {1},
pages = {171-177},
publisher = {Sibirskoe Otdelenie Rossijskoj Akademii Nauk, Institut Matematiki Im. S. L. Soboleva SO RAN, Novosibirsk; Izdatel'stvo Instituta Matematiki},
title = {Boolean algebras with finite families of computable automorphisms.},
url = {http://eudml.org/doc/52705},
volume = {45},
year = {2004},
}
TY - JOUR
AU - Morozov, A.S.
AU - Kasymkanuly, Boribaj
TI - Boolean algebras with finite families of computable automorphisms.
JO - Sibirskij Matematicheskij Zhurnal
PY - 2004
PB - Sibirskoe Otdelenie Rossijskoj Akademii Nauk, Institut Matematiki Im. S. L. Soboleva SO RAN, Novosibirsk; Izdatel'stvo Instituta Matematiki
VL - 45
IS - 1
SP - 171
EP - 177
LA - eng
KW - groups of computable automorphisms; recursive model theory; recursive function; effective computability
UR - http://eudml.org/doc/52705
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.