Hilbert's Tenth problem and NP-completeness of Boolean Syllogistic with unordered cartesian product
Domenico Cantone, Pietro Ursino·2021-01-01·via math.CO updates on arXiv.org
We relate the decidability problem for BS with unordered cartesian product with Hilbert's Tenth problem and prove that BS with unordered cartesian product is NP-complete.