Skip to content

/ ATPPFHS

Automated Theorem Prover for Propositional logic by Forward proof search in Hilbert-style axiomatic System implemented in HaSkell. Inefficient by fate. Just wanna visualize the craziness of deriving theorems in Hilbert-style axiomatic System.

1 star 0 forks
Star
Watch
master
1 branch 0 tags
Go to file
Code
Clone

Use Git or checkout with SVN using the web URL.

Latest commit

 

Git stats

Files

Permalink
Failed to load latest commit information.
Type
Name
Latest commit message
Commit time
app
 
 
doc
 
 
src
 
 
test
 
 
.gitignore
 
 
ChangeLog.md
 
 
README.md
 
 
Setup.hs
 
 
package.yaml
 
 
stack.yaml
 
 

README.md

ATPPFHS.hs

  • Automated Theorem Prover
  • for Propositional Logic
  • by Forward Proof Search
  • in Hilbert System
  • implemented in Haskell.

I know Hilbert System is inefficient for ATP. Just for fun.

About

Automated Theorem Prover for Propositional logic by Forward proof search in Hilbert-style axiomatic System implemented in HaSkell. Inefficient by fate. Just wanna visualize the craziness of deriving theorems in Hilbert-style axiomatic System.

Resources

Readme

Releases

No releases published

Packages

No packages published

Languages

You can’t perform that action at this time.