Conversion to Functionally Complete Set Connectives Examples

In this class, We discuss Conversion to Functionally Complete Set Connectives Examples.

The reader should have prior knowledge of a functionally complete set of connectives. Click Here.

Example 1:

Given proposition ¬(p <-> (q -> (r ∨ p))

Convert the above proposition to an equivalent proposition containing ¬ and ∧.

The diagram below shows the conversion steps.