Engineering Mathematics · topic
Propositional laws, normal forms, tautology and satisfiability, valid arguments and inference rules, functional completeness; first-order logic with quantifier negation, nested quantifier order, distribution laws and translation of English statements.
Propositional logic studies statements that are either true or false, and how the truth of a compound statement depends on the truth of its parts. It gives a precise language for conditions ("if the cache misses and the bus is free, then fetch"), for specifications, and for correctness arguments.
Propositional logic treats "every prime greater than 2 is odd" as one indivisible proposition. It cannot see the structure inside: the objects (numbers), the properties (prime, odd) and the word "every".
One-page visual sheets for this topic, in the sheet library on the store. Previews are free; the full sheets come with the subject pack.
