caa a22 4500 477073646 CHVBK 20180405111433.0 cr unu---uuuuu 170330e19960101xx s 000 0 eng 10.1007/BF02256801 doi (NATIONALLICENCE)springer-10.1007/BF02256801 Tetruashvili M. I. Vekua Institute of Applied Mathematics, Tbilisi State University, 2, University St., 380043, Tbilisi, Republic of Georgia aut Complexity of the decidability of one class of formulas in quantifier-free set theory with a set-union operator [Elektronische Daten] [M. Tetruashvili] We consider the quantifier-free set theoryMLSUn containing the symbolsU, \,=,∈,Un. Un(p) is interpreted as the union of all members of the setp. It is proved that there exists an algorithm which for any formulaQ of theMLSUn theory containing at most one occurrence of the symbolUn decides whetherQ is true or not using the spacecn 3 log2 n (n is the lenhth ofQ). Plenum Publishing Corporation, 1996 Complexity of decidability nationallicence set theory nationallicence set-union operator nationallicence Georgian Mathematical Journal Kluwer Academic Publishers-Plenum Publishers 3/1(1996-01-01), 97-100 1072-947X 3:1<97 1996 3 11290 https://doi.org/10.1007/BF02256801 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/BF02256801 text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Tetruashvili M. I. Vekua Institute of Applied Mathematics, Tbilisi State University, 2, University St., 380043, Tbilisi, Republic of Georgia aut NATIONALLICENCE 773 0- Georgian Mathematical Journal Kluwer Academic Publishers-Plenum Publishers 3/1(1996-01-01), 97-100 1072-947X 3:1<97 1996 3 11290 Metadata rights reserved Springer special CC-BY-NC licence nationallicence SWISSBIB 378248375 BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer