Well formed Formulas
Description
This exercise will test your ability to distinguish between well
formed formulas and random strings.
Instructions
Click on the "NEW" button to generate a new set of formulae.
Tick the boxes next to the valid formulae and press the "ANSWER"
button.
Feedback will be displayed below.
An atom is a string consisting of one or more letters.
The following symbols represent the logical connectives:
| ^ | (and) |
| v | (or) |
| => | (implication) |
| <=> | (equivalence) |
| ~ | (not) |
|