Skip to content

alyata/formalising-math-1

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

15 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Formalising the Soundness & Completeness Theorems for Propositional Logic

This is a formalisation of the proofs for the soundness & completeness theorems of classical propositional logic with the ⋀, ⋁, ⊥, ~ connectives in Lean, submitted as my first project for Imperial's Formalising Mathematics module.

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Languages