liu.seSearch for publications in DiVA
ReferencesLink to record
Permanent link

Direct link
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-248Konferensbidrag (Refereed)
Abstract [en]

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.

Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 3929
National Category
Computer Science
Identifiers
urn:nbn:se:liu:diva-31858 (URN)10.1007/11734673_19 (DOI)17685 (Local ID)oai:DiVA.org:liu-31858 (OAI)
Available from2009-10-09 Created:2009-10-09 Last updated:2012-02-13

Open Access in DiVA

No fulltext

Other links

Publisher's fulltext

Search in DiVA

By author/editor
Orlowska, EwaSzalas, Andrzej
By organisation
Institute of Telecommunications Warsaw UniversityThe Institute of TechnologyKPLAB - Knowledge Processing Lab
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Citations

Web of Science®:

Altmetric score

Totalt: 21 hits
ReferencesLink to record
Permanent link

Direct link