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

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

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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2021-08
1. Verfasser: Ursino, Pietro
Format: Artikel
Sprache:eng
Schlagworte:
Boolean algebra
Cartesian coordinates
Completeness
Languages
Set theory
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:2331-8422