Hilberts Tenth problem and NP-completeness of Boolean Syllogistic with unordered cartesian product
published by Pietro Ursino
in 2021
and research's language is
English
Download
Abstract in English
We relate the decidability problem for BS with unordered cartesian product with Hilberts Tenth problem and prove that BS with unordered cartesian product is NP-complete.