de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Labelled quantified modal logics

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44075

Basin,  David A.
Programming Logics, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45002

Matthews,  Seán
Programming Logics, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45670

Viganò,  Luca
Programming Logics, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Basin, D. A., Matthews, S., & Viganò, L. (1997). Labelled quantified modal logics. In G. Brewka, C. Habel, & B. Nebel (Eds.), Proceedings of the 21st Annual German Conference on Artificial Intelligence (KI-97): Advances in Artificial Intelligence (pp. 171-182). Berlin, Germany: Springer.


Cite as: http://hdl.handle.net/11858/00-001M-0000-000F-39E8-6
Abstract
We present an approach to providing natural deduction style proof systems for a large class of quantified modal logics with varying, increasing, decreasing or constant domains of quantification. The systems we develop are modular both in the behavior of the accessibility relation and quantification relative to the semantics, and in the proofs of soundness and completeness relative to that semantics. Our systems also provide the basis of simple implementations of quantified modal logics in a standard logical framework theorem prover.