Show that every compound wff is equivalent to a wff using only the connectives of ( ightarrow)
Question:
Show that every compound wff is equivalent to a wff using only the connectives of \(\rightarrow\) and '.
Exercises 47-50 show that defining four basic logical connectives (conjunction, disjunction, implication, and negation) is a convenience rather than a necessity because certain pairs of connectives are enough to express any wff.
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Mathematical Structures For Computer Science Discrete Mathematics And Its Applications
ISBN: 9781429215107
7th Edition
Authors: Judith L. Gersting
Question Posted: