Skip to content

Verified proofs for consistency of propositional logics

Notifications You must be signed in to change notification settings

lives-group/consistency

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

11 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Formalizing consistency of minimal propositional logics in Coq

This repository contains proofs of consistency for minimal propositional logics in Coq. One proof is based on the admissibility of cut property and another one by using a normalization argument.

All results are completely verified using Coq version 8.10.2.

About

Verified proofs for consistency of propositional logics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published