https://github.com/igreat/tiny-prover

A simple first order logic theorem prover using tableaux
https://github.com/igreat/tiny-prover

binary-tree coq first-order-logic functional-programming lean logic propositional-logic tableau tableaux theorem-prover theorem-proving

Last synced: about 3 hours ago
JSON representation

A simple first order logic theorem prover using tableaux

• Host: GitHub
• URL: https://github.com/igreat/tiny-prover
• Owner: igreat
• Created: 2024-10-23T00:43:24.000Z (27 days ago)
• Default Branch: main
• Last Pushed: 2024-11-18T22:34:05.000Z (about 4 hours ago)
• Last Synced: 2024-11-18T23:35:05.926Z (about 3 hours ago)
• Topics: binary-tree, coq, first-order-logic, functional-programming, lean, logic, propositional-logic, tableau, tableaux, theorem-prover, theorem-proving
• Language: OCaml
• Homepage:
• Size: 1.12 MB
• Stars: 1
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# tiny prover

This is a tiny theorem prover that will determine the satisfiability or validity of a given first order logic formula. It's based on Tableaux method with a lot of implementation details designed by me.

I'll soon provide a user manual and the limitations of this prover, but as of right now it's basically able to deal with any first order logic formula that doesn't contain free variables.