Towards a Coq formalization of a quantified modal logic

06/07/2022
βˆ™
by   Ana de Almeida Borges, et al.
βˆ™
0
βˆ™

We present a Coq formalization of the Quantified Reflection Calculus with one modality, or 𝖰𝖱𝖒_1. This is a decidable, strictly positive, and quantified modal logic previously studied for its applications in proof theory. The highlights are a deep embedding of 𝖰𝖱𝖒_1 in the Coq proof assistant, a mechanization of the notion of Kripke model with varying domains and a formalization of the soundness theorem. We focus on the design decisions inherent to the formalization and the insights that led to new and simplified proofs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
βˆ™ 12/17/2020

Formalization of PALΒ·S5 in Proof Assistant

As an experiment to the application of proof assistant for logic researc...
research
βˆ™ 05/14/2009

Quantified Multimodal Logics in Simple Type Theory

We present a straightforward embedding of quantified multimodal logic in...
research
βˆ™ 05/20/2018

One Formalization of Virtue Ethics via Learning

Given that there exist many different formal and precise treatments of d...
research
βˆ™ 12/30/2019

On Quantified Modal Theorem Proving for Modeling Ethics

In the last decade, formal logics have been used to model a wide range o...
research
βˆ™ 07/19/2022

Existentially Quantified Systems of Equations as an Implicit Representation of Answers in Logic Programming

In this paper we present an alternative approach to formalize the theory...
research
βˆ™ 07/03/2018

Quantified Markov Logic Networks

Markov Logic Networks (MLNs) are well-suited for expressing statistics s...
research
βˆ™ 04/04/2023

Implementing Dynamic Programming in Computability Logic Web

We present a novel definition of an algorithm and its corresponding algo...

Please sign up or login with your details

Forgot password? Click here to reset