Talbot, Jean-Marc Programming Logics, MPI for Informatics, Max Planck Society;
Talbot, J.-M. (2000). The $\exists \forall^2$ fragment of the First-Order Theory of Set Constraints is $\pi^0_1$-hard. Information Processing Letters, 74(1/2), 27-33.