A fixpoint approach to second-order quantifier elimination with applications to 
correspondence theory

Nonnengart, Andreas; Szalas, Andrzej

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Report

A fixpoint approach to second-order quantifier elimination with applications to correspondence theory

MPS-Authors

/persons/resource/persons45132

Nonnengart, Andreas
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

95-2-007.pdf
(Any fulltext), 156KB

Supplementary Material (public)

There is no public supplementary material available

Citation

Nonnengart, A., & Szalas, A.(1995). A fixpoint approach to second-order quantifier elimination with applications to correspondence theory (MPI-I-1995-2-007). Saarbrücken: Max-Planck-Institut für Informatik.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-A1C0-D

Abstract

This paper is about automated techniques for (modal logic) correspondence theory. The theory we deal with concerns the problem of finding fixpoint characterizations of modal axiom schemata. Given a modal schema and a semantics based method of translating modal formulae into classical ones, we try to derive automatically a fixpoint formula characterizing precisely the class of frames validating this schema. The technique we consider can, in many cases, be easily applied without any computer support. Although we mainly concentrate on Kripke semantics, our fixpoint approach is much more general, as it is based on the elimination of second-order quantifiers from formulae. Thus it can be applied in second-order theorem proving as well. We show some application examples for the method which may serve as new, automated proofs of the respective correspondences.