Quantifier Elimination in Elementary Set Theory
Linköping University, Department of Computer and Information Science, KPLAB - Knowledge Processing Lab
Linköping University, The Institute of Technology
Conference paper (Refereed)
Proceedings of the 8th International Conference on Relational Methods in Computer Science (RelMiCS)
W. MacCaull, I. Duentsch, M. Winter
Lecture Notes in Computer Science, ISSN 0302-9743; 3929
In the current paper we provide two methods for quantifier elimination applicable to a large class of formulas of the elementary set theory. The first one adapts the Ackermann method  and the second one adapts the fixpoint method of . We show applications of the proposed techniques in the theory of correspondence between modal logics and elementary set theory. The proposed techniques can also be applied in an automated generation of proof rules based on the semantic-based translation of axioms of a given logic into the elementary set theory.