Complexity of the decidability of the unquantified set theory with a rank operator.
Georgian Mathematical Journal, Tome 1 (1994) no. 5, pp. 561-565.

Voir la notice de l'article provenant de la source European Digital Mathematics Library

Keywords: unquantified set theory, decidability
@article{GMJ_1994__1_5_47154,
     author = {Tetruashvili, M.},
     title = {Complexity of the decidability of the unquantified set theory with a rank operator.},
     journal = {Georgian Mathematical Journal},
     pages = {561--565},
     publisher = {mathdoc},
     volume = {1},
     number = {5},
     year = {1994},
     zbl = {0813.03007},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/GMJ_1994__1_5_47154/}
}
TY  - JOUR
AU  - Tetruashvili, M.
TI  - Complexity of the decidability of the unquantified set theory with a rank operator.
JO  - Georgian Mathematical Journal
PY  - 1994
SP  - 561
EP  - 565
VL  - 1
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/GMJ_1994__1_5_47154/
LA  - en
ID  - GMJ_1994__1_5_47154
ER  - 
%0 Journal Article
%A Tetruashvili, M.
%T Complexity of the decidability of the unquantified set theory with a rank operator.
%J Georgian Mathematical Journal
%D 1994
%P 561-565
%V 1
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/GMJ_1994__1_5_47154/
%G en
%F GMJ_1994__1_5_47154
Tetruashvili, M. Complexity of the decidability of the unquantified set theory with a rank operator.. Georgian Mathematical Journal, Tome 1 (1994) no. 5, pp. 561-565. http://geodesic.mathdoc.fr/item/GMJ_1994__1_5_47154/