Startseite Complexity of the Decidability of the Unquantified Set Theory with A Rank Operator
Artikel
Lizenziert
Nicht lizenziert Erfordert eine Authentifizierung

Complexity of the Decidability of the Unquantified Set Theory with A Rank Operator

  • M. Tetruashvili
Veröffentlicht/Copyright: 18. Februar 2010
Veröffentlichen auch Sie bei De Gruyter Brill
Georgian Mathematical Journal
Aus der Zeitschrift Band 1 Heft 5

Abstract

The unquantified set theory MLSR containing the symbols ∪, \, =, ∈, R (R(x) is interpreted as a rank of x) is considered. It is proved that there exists an algorithm which for any formula Q of the MLSR theory decides whether Q is true or not using the space c|Q|3 (|Q| is the length of Q).

Received: 1993-05-04
Published Online: 2010-02-18
Published in Print: 1994-October

© 1994 Plenum Publishing Corporation

Heruntergeladen am 6.9.2025 von https://www.degruyterbrill.com/document/doi/10.1515/GMJ.1994.561/html?lang=de
Button zum nach oben scrollen