Geodesic
Structures computable in polynomial time. II
Algebra i logika, Tome 56 (2017) no. 6, pp. 651-670

Voir la notice de l'article provenant de la source Math-Net.Ru

We consider a new approach to investigating categoricity of structures computable in polynomial time. The approach is based on studying polynomially computable stable relations. It is shown that this categoricity is equivalent to the usual computable categoricity for computable Boolean algebras with computable set of atoms, and for computable linear orderings with computable set of adjacent pairs. Examples are constructed which show that this does not always hold. We establish a connection between dimensions based on computable and polynomially computable stable relations.
Keywords: computable stable relations, polynomially computable stable relations, categoricity, computable categoricity. 
@article{AL_2017_56_6_a0,
     author = {P. E. Alaev},
     title = {Structures computable in polynomial {time.~II}},
     journal = {Algebra i logika},
     pages = {651--670},
     publisher = {mathdoc},
     volume = {56},
     number = {6},
     year = {2017},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/AL_2017_56_6_a0/}
}
TY  - JOUR
AU  - P. E. Alaev
TI  - Structures computable in polynomial time. II
JO  - Algebra i logika
PY  - 2017
SP  - 651
EP  - 670
VL  - 56
IS  - 6
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/AL_2017_56_6_a0/
LA  - ru
ID  - AL_2017_56_6_a0
ER  - 
%0 Journal Article
%A P. E. Alaev
%T Structures computable in polynomial time. II
%J Algebra i logika
%D 2017
%P 651-670
%V 56
%N 6
%I mathdoc
%U http://geodesic.mathdoc.fr/item/AL_2017_56_6_a0/
%G ru
%F AL_2017_56_6_a0
P. E. Alaev. Structures computable in polynomial time. II. Algebra i logika, Tome 56 (2017) no. 6, pp. 651-670. http://geodesic.mathdoc.fr/item/AL_2017_56_6_a0/