Decidability and NP-completeness for some languages which extend Boolean Set Theory
Pietro Ursino · arXiv (Cornell University) · 2021
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.