1. Aczel, P., Non-Well-Founded Sets, CSLI Lecture Notes, 1988. Zbl 0668.04001 MR 89j:03039
2. Bellè, D., and F. Parlamento, “Deciding unquantified formulae in weak membership theories,” Technical Report 14/92, Università di Udine, 1992.
3. Breban, M., A. Ferro, E. 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,” Communications on Pure and Applied Mathematics, vol. 34 (1981), pp. 177–195. Zbl 0465.03003 MR 82i:03018b
4. Collins, G. E., and J. D. Halpern, “On the interpretability of arithmetic in set theory,” Notre Dame Journal of Formal Logic, vol. 11 (1970), pp. 477–483. Zbl 0185.01601 MR 45:4970
5. Dreben, B., and W. D. Goldfarb, The Decision Problem. Solvable Classes of Quantificational Formulas, Addison Wesley, Reading, 1979. Zbl 0457.03005 MR 81i:03015