Szalas, Andrzej 2008 (English)In: Journal of applied non-classical logics, ISSN 1166-3081, Vol. 18, no 2-3, 325-340Article in journal (Refereed) Published
In the paper we present a technique for eliminating quantifiers of arbitrary order, in particular of first-order. Such a uniform treatment of the elimination problem has been problematic up to now, since techniques for eliminating first-order quantifiers do not scale up to higher-order contexts and those for eliminating higher-order quantifiers are usually based on a form of monotonicity w.r.t implication (set inclusion) and are not applicable to the first-order case. We make a shift to arbitrary relations "ordering" the underlying universe. This allows us to incorporate background theories into higher-order quantifier elimination methods which, up to now, has not been achieved. The technique we propose subsumes many other results, including the Ackermann's lemma and various forms of fixpoint approaches when the "ordering" relations are interpreted as implication and reveals the common principle behind these approaches.
Place, publisher, year, pages
Éditions Hermès-Lavoisier, 2008. Vol. 18, no 2-3, 325-340
National CategoryComputer Science
Identifiersurn:nbn:se:liu:diva-44633 (URN)10.3166/jancl.18.325-340 (DOI)77213 (Local ID)oai:DiVA.org:liu-44633 (OAI)diva2:265495 (DiVA)