Home Complexity of the Decidability of the Unquantified Set Theory with A Rank Operator
Article
Licensed
Unlicensed Requires Authentication

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

  • M. Tetruashvili
Published/Copyright: February 18, 2010
Become an author with De Gruyter Brill
Georgian Mathematical Journal
From the journal Volume 1 Issue 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

Downloaded on 6.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/GMJ.1994.561/html?lang=en
Scroll to top button