# Complexity of the decidability of the unquantified set theory with a rank operator.

Georgian Mathematical Journal (1994)

- Volume: 1, Issue: 5, page 561-565
- ISSN: 1072-947X

## Access Full Article

top## How to cite

topTetruashvili, M.. "Complexity of the decidability of the unquantified set theory with a rank operator.." Georgian Mathematical Journal 1.5 (1994): 561-565. <http://eudml.org/doc/47154>.

@article{Tetruashvili1994,

author = {Tetruashvili, M.},

journal = {Georgian Mathematical Journal},

keywords = {unquantified set theory; decidability},

language = {eng},

number = {5},

pages = {561-565},

publisher = {Walter de Gruyter},

title = {Complexity of the decidability of the unquantified set theory with a rank operator.},

url = {http://eudml.org/doc/47154},

volume = {1},

year = {1994},

}

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

PB - Walter de Gruyter

VL - 1

IS - 5

SP - 561

EP - 565

LA - eng

KW - unquantified set theory; decidability

UR - http://eudml.org/doc/47154

ER -

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.