Proof for association law?

965 Views Asked by At

I am new in logic and I getting a little bit confused with maths. Can I do something like this following the Associative Law?

$$(p ∨ ¬r) ∨ (r ∨ ¬p) ≡ (p ∨ ¬p) ∨ (r ∨ ¬r)$$

Thank you in advance for your help

1

There are 1 best solutions below

0
On BEST ANSWER

Always go back to the (intuitive) intended meaning of the logical symbols. "$P \lor Q$" is true exactly when either "$P$" or "$Q$" is true (or both), which is also equivalent to that at least one of "$P$" or "$Q$" is true.

Now it is then clear that $( P \lor Q ) \lor R$ is going to be true exactly when at least one of $P,Q,R$ is true, and the order and arrangement do not matter.