# g4ip: A theorem prover for propositional logic that uses G4ip

[ library, logic, mit ] [ Propose Tags ]

## Modules

• G4ip
• G4ip.Decider
• G4ip.Proposition

#### Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

• No Candidates
Versions [RSS] 0.1.0.0 base (>=4.6 && <4.7) [details] MIT Josh Acay coskuacay@gmail.com Logic https://github.com/cacay/G4ip by cacay at 2017-03-20T22:01:29Z NixOS:0.1.0.0 1 direct, 0 indirect [details] 928 total (3 in the last 30 days) (no votes yet) [estimated by Bayesian average] λ λ λ Docs not available All reported builds failed as of 2017-03-20

[back to package description]

# G4ip

Implementation of a theorem prover for propositional logic using G4ip in Haskell.

## File Structure

• G4ip/Proposition.hs -- Definition of propositions and some syntactic sugar
• G4ip/Decider.hs -- The actual theorem prover (decider?)
• G4ip/Tester.hs -- For defining and running tests
• G4ip/TestMain.hs -- Actually runs the default test suite

## Testing Manually

• Startup ghci
• Load Main.hs by typing :l Main
• Use decide prop to see if prop is provable.

You can use T, F, /\, \/, ==>, <==, <=>, neg, and () with their usual meanings to form propositions. To form an atom, either use Atom "name" or use one of the predefined atoms: a, b, c, d, e, or f. Here is an example:

decide $(neg b ==> neg a) ==> (a ==> b) \/ (a \/ a ==> a)  which prints True as expected ($ if for associativity, you can use parenthesis if you want).

## Contact

Email me at coskuacay@gmail.com for any questions.