MPI-I-97-2-001. January 1997, 31 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry
Abstract in LaTeX format:
In previous work we gave an approach, based on labelled natural
deduction, for formalizing proof systems for a large class of
propositional modal logics, including K, D, T, B, S4, S4.2, KD45,
and S5. Here we extend this approach to quantified modal logics,
providing formalizations for logics with varying, increasing,
decreasing, or constant domains. The result is modular both with
respect to properties of the accessibility relation in the Kripke
frame and the way domains of individuals change between worlds.
Our approach has a modular metatheory too; soundness, completeness,
and normalization are proved uniformly for every logic in our class.
Finally, our work leads to a simple implementation of a modal logic
theorem prover in standard logical frameworks.
References to related material:
|To download this research report, please select the type of document that fits best your needs.||Attachement Size(s):|
|Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView|