(adsbygoogle = window.adsbygoogle || []).push({}); 1. The problem statement, all variables and given/known data

[tex](S \wedge T) \wedge \neg (S \wedge T)[/tex]

[tex] (S \vee T) \Rightarrow (S \wedge T) [/tex]

Are the two (predicates?) logically equivalent?

2. Relevant equations

Not sure, but I believe that logical equivalence means that two predicates give the same output on the same input.

3. The attempt at a solution

Worked truth tables. The end result of both where statement T is t t f f and statement S is t f t f, in both cases is t f f t. I guess I am not really sure if that means that the two predicates are logically equivalent or not. I was actually just playing with truth tables and got this on accident, and wasn't sure if the fact that they both have the same end result is worth noting or not.

**Physics Forums | Science Articles, Homework Help, Discussion**

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!

# Homework Help: Logical equivalence of statements with truth tables

**Physics Forums | Science Articles, Homework Help, Discussion**