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 [1] and the second one adapts the fixpoint method of [20]. 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. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Orłowska, E., & Szałas, A. (2006). Quantifier elimination in elementary set theory. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3929 LNCS, pp. 237–248). Springer Verlag. https://doi.org/10.1007/11734673_19
Mendeley helps you to discover research relevant for your work.