Logic Derivation Machine parses logic sentences and performs derivations
Sentences may be either atomic or compound. Atomic sentences consist solely of a variable, and possible a negation. Compound sentences consist of two inner sentences, connected by an operator.
| Name | Description | Symbol |
|---|---|---|
| Negation | not P | ~ |
| Conjunction | P and Q | & |
| Disjunction | P or Q | v |
| Material Conditional | if P then Q | > |
| Material Biconditional | if and only if P then Q | = |
Since sentences are essentially graphs with interconnected nodes, it may be useful to add them to a SentenceSet to help with memory freeing.
