1. Cantone, D., Cincotti, G.: The decision problem in graph theory with reachability related constructs. In: Baumgartner, P., Zhang, H. (eds.), Proceedings of Third International Workshop on First-Order Theorem Proving (FTP 2000), pp. 68–90, Universität Koblenz-Landau (2000)
2. Cantone, D., Ferro, A., Omodeo, E.G.: Computable set theory. Number 6 in International Series of Monographs on Computer Science, Oxford Science Publications. Clarendon Press, Oxford, UK (1989)
3. Cantone, D., Maugeri, P., Omodeo, E.G.: Complexity assessments for decidable fragments of set theory. II: A taxonomy for ‘small’ languages involving membership. Theor. Comput. Sci. 848, 28–46 (2020)
4. Cantone, D., Omodeo, E.G., Policriti, A.: Set theory for computing - From decision procedures to declarative programming with sets. Monographs in Computer Science. Springer-Verlag, New York (2001)
5. Cantone, D., Ursino, P.: An Introduction to the Technique of Formative Processes in Set Theory. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-74778-1