10 papers
Decision algorithms for fragments of real analysis. III: A theory of differentiable functions with (semi-)open intervals
G. Buriola, D. Cantone, G. Cincotti +2
This paper enriches preexisting satisfiability tests for unquantified languages, which in turn augment a fragment of Tarski's elementary algebra with unary real functions possessin…
Six equations in search of a finite-fold-ness proof
Domenico Cantone, Luca Cuzziol, Eugenio G. Omodeo
By following the same construction pattern which Martin Davis proposed in a 1968 paper of his, we have obtained six quaternary quartic Diophantine equations that candidate as `rule…
Rationalization of indecisive choice behavior by majoritarian ballots
José Carlos R. Alcantud, Domenico Cantone, Alfio Giarlotta +1
We describe a model that explains possibly indecisive choice behavior, that is, quasi-choices (choice correspondences that may be empty on some menus). The justification is here pr…
Complexity assessments for decidable fragments of Set Theory. IV: A quadratic reduction of constraints over nested sets to Boolean formulae
Domenico Cantone, Andrea De Domenico, Pietro Maugeri +1
As a contribution to quantitative set-theoretic inferencing, a translation is proposed of conjunctions of literals of the forms , , and $z =\{x…
On the Convexity of a Fragment of Pure Set Theory with Applications within a Nelson-Oppen Framework
Domenico Cantone, Andrea De Domenico, Pietro Maugeri
The Satisfiability Modulo Theories (SMT) issue concerns the satisfiability of formulae from multiple background theories, usually expressed in the language of first-order predicate…
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…