Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.
A sentence (well formed formula) is defined as follows:
A symbol is a sentence
If S is a sentence, then ¬S is a sentence
If S is a sentence, then (S) is a sentence
If S and T are sentences, then (S ∨ T), (S ∧ T), (S → T), and (S ↔ T) are sentences
A sentence results from a finite number of applications of the above rules
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License