Let p and q be distinct prime formulas (a.k.a. atomic propositions) and P be a set constructed as follows:(adsbygoogle = window.adsbygoogle || []).push({});

1) p and q are in P;

2) if r and s are in P, then (r -> s) is in P.

Prove that no formula in P is tautologically equivalent to (p & q). In other words, there exists no t in P such that t^{v}

= T when p^{v}= T and q^{v}= T;

= F otherwise.

I can't get anywhere. I'll be going through the possibilities until I notice something.

Oh, nevermind, I got it by contradiction and going backwards; every possibility dead ends. Maybe there's a better (more useful) way though.

**Physics Forums - The Fusion of Science and Community**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Logic; prove set of connectives incomplete

Loading...

Similar Threads for Logic prove connectives | Date |
---|---|

Predicate logic to prove equality of two formulas | Jul 2, 2012 |

To logically prove measure theory | Jan 3, 2012 |

Curry's paradox (a.k.a. omigod, this is so weird. I just proved that 1+1=3 w/ LOGIC) | Jul 16, 2009 |

Prove that the law of excluded middle does not hold in some many-valued logic | May 10, 2009 |

LOGIC proving/disproving general laws | Feb 19, 2008 |

**Physics Forums - The Fusion of Science and Community**