All courses › Discrete Mathematics › Propositional logic

Propositional logic

A proposition is either true or false. With and, or, not and implication, propositions can be combined, and the truth value is decided with a truth table. An implication is false only when the premise is true and the conclusion false.

p∧qp \land qand: true only when both are true
p∨qp \lor qor: true when at least one is true
p⇒q≡¬p∨qp \Rightarrow q \equiv \lnot p \lor qimplication

Symbols

¬\lnotnot
∧\landand
∨\loror
⇒\Rightarrowif … then

Example

pp: it rains, qq: the ground is wet.

p⇒qp \Rightarrow q is false only if it rains and the ground is dry.

Anything follows from a false premise: then the implication is always true.
Practise logic and sets for free →

De Morgan's laws →

Part of Discrete Mathematics: Logic and sets.