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.
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.
SnowOnion/ATPPFHS
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
master
Could not load branches
Nothing to show
Could not load tags
Nothing to show
{{ refName }}
default
Name already in use
A tag already exists with the provided branch name. Many Git commands accept both tag and branch names, so creating this branch may cause unexpected behavior. Are you sure you want to create this branch?
Code
-
Clone
Use Git or checkout with SVN using the web URL.
Work fast with our official CLI. Learn more.
- Open with GitHub Desktop
- Download ZIP
Sign In Required
Please sign in to use Codespaces.
Launching GitHub Desktop
If nothing happens, download GitHub Desktop and try again.
Launching GitHub Desktop
If nothing happens, download GitHub Desktop and try again.
Launching Xcode
If nothing happens, download Xcode and try again.
Launching Visual Studio Code
Your codespace will open once ready.
There was a problem preparing your codespace, please try again.
Latest commit
Git stats
Files
Failed to load latest commit information.
Type
Name
Latest commit message
Commit time
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
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published