https://github.com/quasarbright/sequentcalculus

automatic theorem proving for simple formulae
https://github.com/quasarbright/sequentcalculus

Last synced: 26 days ago
JSON representation

automatic theorem proving for simple formulae

• Host: GitHub
• URL: https://github.com/quasarbright/sequentcalculus
• Owner: quasarbright
• License: bsd-3-clause
• Created: 2021-01-21T03:30:12.000Z (almost 4 years ago)
• Default Branch: master
• Last Pushed: 2021-01-25T07:30:54.000Z (almost 4 years ago)
• Last Synced: 2024-11-06T07:42:17.232Z (3 months ago)
• Language: Haskell
• Size: 20.5 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • Changelog: ChangeLog.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# SequentCalculus

Automates proving logic statements in the [sequent calculus](https://en.wikipedia.org/wiki/Sequent_calculus)

The main algorithm accepts a formula and

outputs whether it is always true for any variable assignment

or if it is possibly false for some variable assignments

I also turned this into a sat decider (exponential time)

I also made it so it can print out the whole inference

tree in LaTeX! run Main.main for an example.

I should make a type inference algorithm which outputs the inference tree.

Would be great for explaining type inference.