| P | ~P |
|---|---|
| T | F |
| F | T |
| P | Q | P | Q |
|---|---|---|
| T | T | T |
| T | F | T |
| F | T | T |
| F | F | F |
| P | Q | P & Q |
|---|---|---|
| T | T | T |
| T | F | F |
| F | T | F |
| F | F | F |
| P | Q | P -> Q |
|---|---|---|
| T | T | T |
| T | F | F |
| F | T | T |
| F | F | T |
| P | Q | P <=> Q |
|---|---|---|
| T | T | T |
| T | F | F |
| F | T | F |
| F | F | T |
Tests examples
- Haskell
- Run
ghcicommand - Run
l TautologyParser.hs
Then you can run runFormula eg.
or getFormula eg.
-
Parsing logical formulas with
- Disjunction as |
- Conjunction as &
- Implication as ->
- Biconditional as <=>
- Negation as ~
- Brackets as ()
-
Checking if it's a tautology
Project is: completed
Created by @HondaPL 2021