Geodesic
Recognition complexity of theories and their computational expressivity
Algebra i logika, Tome 51 (2012) no. 2, pp. 216-238

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

Computational complexity of a theory for a class $\mathfrak B$ of Boolean algebras is evaluated. We introduce a concept of computational expressivity for a theory, which is close in meaning to its computational complexity, but, as distinct from the latter, also fits well with undecidable theories.
Keywords: Boolean algebra, theory, computational expressivity of theories. 
@article{AL_2012_51_2_a4,
     author = {I. V. Latkin},
     title = {Recognition complexity of theories and their computational expressivity},
     journal = {Algebra i logika},
     pages = {216--238},
     publisher = {mathdoc},
     volume = {51},
     number = {2},
     year = {2012},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/AL_2012_51_2_a4/}
}
TY  - JOUR
AU  - I. V. Latkin
TI  - Recognition complexity of theories and their computational expressivity
JO  - Algebra i logika
PY  - 2012
SP  - 216
EP  - 238
VL  - 51
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/AL_2012_51_2_a4/
LA  - ru
ID  - AL_2012_51_2_a4
ER  - 
%0 Journal Article
%A I. V. Latkin
%T Recognition complexity of theories and their computational expressivity
%J Algebra i logika
%D 2012
%P 216-238
%V 51
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/AL_2012_51_2_a4/
%G ru
%F AL_2012_51_2_a4
I. V. Latkin. Recognition complexity of theories and their computational expressivity. Algebra i logika, Tome 51 (2012) no. 2, pp. 216-238. http://geodesic.mathdoc.fr/item/AL_2012_51_2_a4/