Define a new logical connective as follows: P Q is true if P is false
Fantastic news! We've Found the answer you've been seeking!
Question:
Define a new logical connective ⋆ as follows: P ⋆ Q is true if P is false or Q is false. (That is, P ⋆ Q is only false if P and Q are both true.) Show that the operator ∼ (“not”) and the connectives ∨ (“or”), ∧ (“and”), and =⇒ (“if... then...”) can all be written in terms of ⋆ only. To get you started, ∼ P always has exactly the same truth value as (that is, is logically equivalent to) P ⋆ P : make sure you show why!
Related Book For
Finite Mathematics and Its Applications
ISBN: 978-0134768632
12th edition
Authors: Larry J. Goldstein, David I. Schneider, Martha J. Siegel, Steven Hair
Posted Date: