Decidability and NP-completeness for some languages which extend Boolean Set Theory

Abstract

We prove the decidability for a class of languages which extend BST and N P -completeness for a subclass of them. The languages BST extended with unordered cartesian product (BST⊗), BST extended with ordered cartesian product (BST×) and BST extended with powerset (BSTP ) fall in this last subclass. * We gratefully acknowledge partial support from the projects MEGABIT -