Complexity of the decidability of the unquantified set theory with a rank operator.
Tetruashvili, M.
Georgian Mathematical Journal, Tome 1 (1994), p. 561-565 / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 1994-01-01
DOI : https://doi.org/10.1007/BF02317684
EUDML-ID : urn:eudml:doc:47154 
@article{00679898,
     title = {Complexity of the decidability of the unquantified set theory with a rank operator.},
     journal = {Georgian Mathematical Journal},
     volume = {1},
     year = {1994},
     pages = {561-565},
     doi = {10.1007/BF02317684},
     zbl = {0813.03007},
     language = {en},
     url = {http://dml.mathdoc.fr/item/00679898}
}

Tetruashvili, M. Complexity of the decidability of the unquantified set theory with a rank operator.. Georgian Mathematical Journal, Tome 1 (1994) pp. 561-565. doi : 10.1007/BF02317684. http://gdmltest.u-ga.fr/item/00679898/