Quantified Multimodal Logics in Simple Type Theory

05/14/2009
by   Christoph Benzmueller, et al.
0

We present a straightforward embedding of quantified multimodal logic in simple type theory and prove its soundness and completeness. Modal operators are replaced by quantification over a type of possible worlds. We present simple experiments, using existing higher-order theorem provers, to demonstrate that the embedding allows automated proofs of statements in these logics, as well as meta properties of them.

READ FULL TEXT
research
05/27/2009

Automating Quantified Multimodal Logics in Simple Type Theory -- A Case Study

In a case study we investigate whether off the shelf higher-order theore...
research
04/26/2012

Quantified Conditional Logics are Fragments of HOL

A semantic embedding of (constant domain) quantified conditional logic i...
research
04/30/2010

Simple Type Theory as Framework for Combining Logics

Simple type theory is suited as framework for combining classical and no...
research
06/07/2022

Towards a Coq formalization of a quantified modal logic

We present a Coq formalization of the Quantified Reflection Calculus wit...
research
05/30/2017

Strength Factors: An Uncertainty System for a Quantified Modal Logic

We present a new system S for handling uncertainty in a quantified modal...
research
07/03/2018

Quantified Markov Logic Networks

Markov Logic Networks (MLNs) are well-suited for expressing statistics s...
research
09/07/2016

Equilibrium Graphs

In this paper we present an extension of Peirce's existential graphs to ...

Please sign up or login with your details

Forgot password? Click here to reset