A Henkin-style completeness proof for the modal logic S5

10/03/2019
by   Bruno Bentzen, et al.
0

This paper presents a recent formalization of a Henkin-style completeness proof for the propositional modal logic S5 using the Lean theorem prover. The proof formalized is close to that of Hughes and Cresswell [9], except that it is given for a system based on a different choice of axioms. Here the proof is based on a Hilbert-style presentation better described as a Mendelson system augmented with axiom schemes for K, T, S4, and B, and the necessitation rule as rule of inference. The language has the false and implication as the only primitive logical connectives and necessity as the only primitive modal operator. The full source code is available online and has been typechecked with Lean 3.4.1.

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
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ö...
research
10/12/2017

Flat modal fixpoint logics with the converse modality

We prove a generic completeness result for a class of modal fixpoint log...
research
05/07/2022

A theorem prover and countermodel constructor for provability logic in HOL Light

We introduce our implementation in HOL Light of a prototype of a general...
research
10/23/2017

Fitch-Style Modal Lambda Calculi

Fitch-style modal deduction, in which modalities are eliminated by openi...
research
06/25/2021

A logical framework with a graph meta-language

We conjecture that the relative unpopularity of logical frameworks among...
research
03/03/2021

Provability in BI's Sequent Calculus is Decidable

The logic of Bunched Implications (BI) combines both additive and multip...

Please sign up or login with your details

Forgot password? Click here to reset