1. Wilhlern Ackermann. Untersuchung über das Eliminationsproblem der mathematischen Logik. Mathematische Annalen, 110: 390–413, 1935.
2. Wühlern Ackermann. Zum Eliminationsproblem der Mathematischen Logik. Mathematische Annalen, 111: 61–63, 1935.
3. Patrick Doherty, Witold Lukaszewicz, and Andrzej Szałas. Computing circumscription revisited: a reduction algorithm. Technical Report LiTH-IDA-R-94-42, Institutionen for Datavetenskap. University of Linköping, 1994. A preliminary report published in Proceedings 4th IJCAI, Morgan Kaufmann Pub. Inc., pp 1502–1508, 1995. To appear in Journal of Automated Reasoning.
4. Patrick Doherty, Witold Lukaszewicz, and Andrzej Szałas. A characterization result for circumscribed normal logic programs. Technical Report LiTH-IDA-R-95-20, Institutionen för Datavetenskap, University of Linköping, 1995. To appear in Fundamenta Informaticae.
5. Thorsten Engel. Elimination of Predicate and Function Quantifiers. Diploma Thesis. Max-Planck-Institut für Informatik, Saarbrücken, 1996.