Geodesic
Complexity of the decidability of one class of formulas in quantifier-free set theory with a set-union operator.
Georgian mathematical journal, Tome 3 (1996) no. 1, pp. 97-100 Cet article a éte moissonné depuis la source European Digital Mathematics Library

Voir la notice de l'article

Keywords: complexity, decidability, quantifier-free set theory 
@article{GMJ_1996__3_1_47540,
     author = {Tetruashvili, M.},
     title = {Complexity of the decidability of one class of formulas in quantifier-free set theory with a set-union operator.},
     journal = {Georgian mathematical journal},
     pages = {97--100},
     year = {1996},
     volume = {3},
     number = {1},
     zbl = {0852.03016},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/GMJ_1996__3_1_47540/}
}
TY  - JOUR
AU  - Tetruashvili, M.
TI  - Complexity of the decidability of one class of formulas in quantifier-free set theory with a set-union operator.
JO  - Georgian mathematical journal
PY  - 1996
SP  - 97
EP  - 100
VL  - 3
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/GMJ_1996__3_1_47540/
LA  - en
ID  - GMJ_1996__3_1_47540
ER  - 
%0 Journal Article
%A Tetruashvili, M.
%T Complexity of the decidability of one class of formulas in quantifier-free set theory with a set-union operator.
%J Georgian mathematical journal
%D 1996
%P 97-100
%V 3
%N 1
%U http://geodesic.mathdoc.fr/item/GMJ_1996__3_1_47540/
%G en
%F GMJ_1996__3_1_47540
Tetruashvili, M. Complexity of the decidability of one class of formulas in quantifier-free set theory with a set-union operator.. Georgian mathematical journal, Tome 3 (1996) no. 1, pp. 97-100. http://geodesic.mathdoc.fr/item/GMJ_1996__3_1_47540/