Decidability and NP-completeness for some languages which extend Boolean Set Theory
Logic
2021-09-01 v1
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.
Keywords
Cite
@article{arxiv.2108.13913,
title = {Decidability and NP-completeness for some languages which extend Boolean Set Theory},
author = {Pietro Ursino},
journal= {arXiv preprint arXiv:2108.13913},
year = {2021}
}
Comments
arXiv admin note: substantial text overlap with arXiv:2106.01224