Quantifier Elimination in Elementary Set Theory
2006 (English)In: Proceedings of the 8th International Conference on Relational Methods in Computer Science (RelMiCS) / [ed] W. MacCaull, I. Duentsch, M. Winter, Springer Berlin/Heidelberg, 2006, 237-248Conference paper (Refereed)
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.
Lecture Notes in Computer Science, ISSN 0302-9743 ; 3929
National CategoryComputer Science
IdentifiersURN: urn:nbn:se:liu:diva-31858DOI: 10.1007/11734673_19Local ID: 17685OAI: oai:DiVA.org:liu-31858DiVA: diva2:252681