Complexity of some natural problems on the class of computable -algebras.
Sibirskij Matematicheskij Zhurnal, Tome 47 (2006) no. 2, p. 352.
Voir la notice de l'article dans European Digital Mathematics Library
Classification :
03D45
Mots-clés : computable Boolean algebra with distinguished ideals, computable isomorphism, computably categorical structure, arithmetical complexity, analytical complexity
Mots-clés : computable Boolean algebra with distinguished ideals, computable isomorphism, computably categorical structure, arithmetical complexity, analytical complexity
@article{SMZ_2006__47_2_53169, author = {Kogabaev, N.T.}, title = {Complexity of some natural problems on the class of computable -algebras.}, journal = {Sibirskij Matematicheskij Zhurnal}, pages = {352}, publisher = {mathdoc}, volume = {47}, number = {2}, year = {2006}, zbl = {1115.03050}, language = {en}, url = {https://geodesic-test.mathdoc.fr/item/SMZ_2006__47_2_53169/} }
Kogabaev, N.T. Complexity of some natural problems on the class of computable -algebras.. Sibirskij Matematicheskij Zhurnal, Tome 47 (2006) no. 2, p. 352. https://geodesic-test.mathdoc.fr/item/SMZ_2006__47_2_53169/