AI Chat AI Image Generator AI Video Text to Speech

Formalization of PAL·S5 in Proof Assistant

12/17/2020

∙

by Jiatu Li, et al.

∙

∙

As an experiment to the application of proof assistant for logic research, we formalize the model and proof system for multi-agent modal logic S5 with PAL-style dynamic modality in Lean theorem prover. We provide a formal proof for the reduction axiom of public announcement, and the soundness and completeness of modal logic S5, which can be typechecked with Lean 3.19.0. The complete proof is now available at Github.

page 1

page 2

page 3

page 4

research

∙ 10/03/2019

A Henkin-style completeness proof for the modal logic S5

This paper presents a recent formalization of a Henkin-style completenes...

0 Bruno Bentzen, et al. ∙

research

∙ 06/07/2022

Towards a Coq formalization of a quantified modal logic

We present a Coq formalization of the Quantified Reflection Calculus wit...

0 Ana de Almeida Borges, et al. ∙

research

∙ 02/11/2021

A formal proof of modal completeness for provability logic

This work presents a formalized proof of modal completeness for Gödel-Lö...

0 Marco Maggesi, et al. ∙

research

∙ 04/03/2018

Inadequacy of modal logic in quantum settings

We explore the extent to which the principles of classical modal logic c...

0 Nuriya Nurgalieva, et al. ∙

research

∙ 11/15/2021

Birkhoff's Completeness Theorem for Multi-Sorted Algebras Formalized in Agda

This document provides a formal proof of Birkhoff's completeness theorem...

0 Andreas Abel, et al. ∙

research

∙ 09/01/2023

Intuitionistic Gödel-Löb logic, à la Simpson: labelled systems and birelational semantics

We derive an intuitionistic version of Gödel-Löb modal logic (GL) in the...

0 Anupam Das, et al. ∙

research

∙ 12/15/2017

A Heuristic Proof Procedure for First-Order Logic

Inspired by the efficient proof procedures discussed in Computability l...

0 Keehang Kwon, et al. ∙