1. E. Börger. Computability, complexity, logic. North-Holland, Amsterdam, 1989.
2. M. Breban, A. Ferro, E.G. Omodeo, and J.T. Schwartz. Decision procedures for elementary sublanguages of set theory. II. Formulas involving restricted quantifiers, together with ordinal, integer, map, and domain notions. Comm. Pure App. Math., XXXIV:177–195, 1981.
3. C. Cantone. A survey of computable set theory. Le Matematiche, to appear.
4. D. Cantone and V. Cutello. A decision procedure for set-theoretic formulae involving rank and cardinality comparison. Proceedings of 3rd Italian Conference on Theoretical Computer Science, Mantova, pp. 150–163, 1989.
5. D. Cantone, A. Ferro, and E.G. Omodeo. Computable Set Theory. Oxford University Press, to appear.