Decidability and NP-completeness for some languages which extend Boolean Set Theory
Pietro Ursino
TL;DR
This paper investigates the computational complexity of extended Boolean Set Theory languages, establishing decidability results for some and NP-completeness for a specific subclass, including extensions with cartesian products and powerset.
Contribution
It proves decidability for a broad class of extended BST languages and NP-completeness for a particular subclass involving product and powerset extensions.
Findings
Decidability established for certain extended BST languages.
NP-completeness shown for a subclass with product and powerset extensions.
Includes specific results for unordered and ordered cartesian products.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Formal Methods in Verification · Logic, programming, and type systems