FMLtoHOL (version 1.0): Automating First-order Modal Logics with LEO-II and Friends

07/28/2012

∙

A converter from first-order modal logics to classical higher- order logic is presented. This tool enables the application of off-the-shelf higher-order theorem provers and model finders for reasoning within first- order modal logics. The tool supports logics K, K4, D, D4, T, S4, and S5 with respect to constant, varying and cumulative domain semantics.

READ FULL TEXT

FMLtoHOL (version 1.0): Automating First-order Modal Logics with LEO-II and Friends

Embedding and Automating Conditional Logics in Classical Higher-Order Logic

Systematic Verification of the Modal Logic Cube in Isabelle/HOL

A Simplified and Improved Free-Variable Framework for Hilbert's epsilon as an Operator of Indefinite Committed Choice

Connectives in Quantum and other Cumulative Logics

A (Simplified) Supreme Being Necessarily Exists, says the Computer: Computationally Explored Variants of Gödel's Ontological Argument

First-order justification logic with constant domain semantics

Separability and harmony in ecumenical systems

FMLtoHOL (version 1.0): Automating First-order Modal Logics with LEO-II and Friends

Related Research

Embedding and Automating Conditional Logics in Classical Higher-Order Logic

Systematic Verification of the Modal Logic Cube in Isabelle/HOL

A Simplified and Improved Free-Variable Framework for Hilbert's epsilon as an Operator of Indefinite Committed Choice

Connectives in Quantum and other Cumulative Logics

A (Simplified) Supreme Being Necessarily Exists, says the Computer: Computationally Explored Variants of Gödel's Ontological Argument

First-order justification logic with constant domain semantics

Separability and harmony in ecumenical systems