Complexity of the decidability of one class of formulas in quantifier-free set theory with a set-union operator.
Georgian Mathematical Journal (1996)
- Volume: 3, Issue: 1, page 97-100
- ISSN: 1072-947X
Access Full Article
top
How to cite
topTetruashvili, M.. "Complexity of the decidability of one class of formulas in quantifier-free set theory with a set-union operator.." Georgian Mathematical Journal 3.1 (1996): 97-100. <http://eudml.org/doc/47540>.
@article{Tetruashvili1996,
author = {Tetruashvili, M.},
journal = {Georgian Mathematical Journal},
keywords = {complexity; decidability; quantifier-free set theory},
language = {eng},
number = {1},
pages = {97-100},
publisher = {Walter de Gruyter},
title = {Complexity of the decidability of one class of formulas in quantifier-free set theory with a set-union operator.},
url = {http://eudml.org/doc/47540},
volume = {3},
year = {1996},
}
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
PB - Walter de Gruyter
VL - 3
IS - 1
SP - 97
EP - 100
LA - eng
KW - complexity; decidability; quantifier-free set theory
UR - http://eudml.org/doc/47540
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.