I have been trying to refresh my memory with regards to classical logic. As a result, I am currently going over the basics.
The following proposition seems to be false in all possible worlds. However, this isn't the smallest proposition in the world and it required me to analyse $2^{3}$ possible worlds through truth tables.
I'm just wondering, is there a quicker way to check if the proposition is false in all possible worlds?
$\left[p \wedge (q \lor r)\right] \equiv \left[( \sim q \ \ \lor \sim p) \wedge (\sim r \ \ \lor \sim p)\right]$
DeMorgan's laws:
$\sim (x \vee y) = (\sim x ) \wedge (\sim y)$
$\sim (x \wedge y) = (\sim x ) \vee (\sim y)$
In some notations where the overline indicates the complement, the rule is "break the line, change the sign":
$\overline{x+y} = \overline{x} \ \overline{y}$
$\overline{xy} = \overline{x} + \overline{y}$
By only manipulating the right hand side, we have $$( \sim q \ \lor \sim p) \wedge (\sim r \ \lor \sim p) \\ = [\sim (q\wedge p)] \wedge [\sim (r \land p)] \\ = \sim [(q\wedge p) \lor (r \land p)] \\ = \sim [(p \land q) \lor (p \land r)] \\ = \sim [p \land (q \lor r)] $$
which is contradictory (false in all possible worlds) to the original left hand side.