Showing 2021 · math.LOShow all
2 papers · 2 filters
math.LO2021
Decidability of the satisfiability problem for Boolean set theory with the unordered Cartesian product operator
Domenico Cantone, Pietro Ursino
The satisfiability problem for multilevel syllogistic extended with the Cartesian product operator (MLSC) is a long-standing open problem in computable set theory. For long, it was…
math.LO2021
Hilbert's Tenth problem and NP-completeness of Boolean Syllogistic with unordered cartesian product
Domenico Cantone, Pietro Ursino
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.