Logical equivalence of statements with truth tables

[icantadd]

Homework Statement

$$(S \wedge T) \wedge \neg (S \wedge T)$$

$$(S \vee T) \Rightarrow (S \wedge T)$$


Are the two (predicates?) logically equivalent?

Homework Equations

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

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.

 

[djeitnstine]

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

Correct.

I will take a look at this in the afternoon if other PF'ers haven't got to it before me...its 2.30 in the morning.

 

[NoMoreExams]

Homework Statement

$$(S \wedge T) \wedge \neg (S \wedge T)$$

$$(S \vee T) \Rightarrow (S \wedge T)$$


Are the two (predicates?) logically equivalent?

Homework Equations

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

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.

The way I see it is you just work the logic tables look at all possibilities for (S,T) i.e. (True, True), (True, False), (False, True), (False, False). If that's what you did and got the same result then I would believe they are logically equivalent.

 

[HallsofIvy]

Homework Statement

$$(S \wedge T) \wedge \neg (S \wedge T)$$

$$(S \vee T) \Rightarrow (S \wedge T)$$


Are the two (predicates?) logically equivalent?

Homework Equations

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

Yes, that is correct. If this is homework, surely you could look that up in your textbook?

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.

You just said " logical equivalence means that two predicates give the same output on the same input"

 

[statdad]

First, note that

$$(S \wedge T) \wedge \neg (S \wedge T)$$

will always be false (for every combination of S and T) since $$(S \wedge T)$$ and $$\neg (S \wedge T)$$ always have opposite truth values.

However, if both S and T are true, then so is

$$(S \vee T) \Rightarrow (S \wedge T)$$

These two statements are not equivalent.