Decidability and NP-completeness for some languages which extend Boolean Set Theory
arXiv:2108.13913
Abstract
We prove the decidability for a class of languages which extend BST and NP-completeness for a subclass of them. The languages BST extended with unordered cartesian product, BST extended with ordered cartesian product and BST extended with powerset fall in this last subclass.
arXiv admin note: substantial text overlap with arXiv:2106.01224