MPI-I-95-2-007. March 1995, 16 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry
Abstract in LaTeX format:
This paper is about automated techniques for (modal logic)
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
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.
References to related material:
|To download this research report, please select the type of document that fits best your needs.||Attachement Size(s):|
|95-2-007.pdf||37 KBytes; 156 KBytes|
|Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView|