Difficulty understanding a logical equivalence

zelmac
Messages
5
Reaction score
0
\exists{x}(P(x)\Rightarrow{Q(x)})\equiv{\forall{x}P(x)\Rightarrow{\exists{x}Q(x)}}

I am able to derive this equivalence by using the standard equivalences of symbolic logic, but when I try to verify this semantically, with an example, I just can't see why these two expressions are equivalent.

Example:
Lets say that x represents days, P(x) represents it's cold on day x, and Q(x) represents it is snowing on day x. If it is true that it is cold every day, and it is true that there is a snowy day, why must it be true that there is a day when, if it is cold, than snow MUST fall?
 
Physics news on Phys.org
If it is cold every day, and there is at least one snowy day, this snowy day has to be cold. Therefore, there is a day (∃) where it is cold and snow falls.
 
You concluded:
\exists{x}(P(x)\wedge{Q(x)})
and I'm wondering how do you get to:
\exists{x}(P(x)\Rightarrow{Q(x)})
 
If P(x) ∧ Q(x) is true for this x, then P(x) => Q(x).
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Namaste & G'day Postulate: A strongly-knit team wins on average over a less knit one Fundamentals: - Two teams face off with 4 players each - A polo team consists of players that each have assigned to them a measure of their ability (called a "Handicap" - 10 is highest, -2 lowest) I attempted to measure close-knitness of a team in terms of standard deviation (SD) of handicaps of the players. Failure: It turns out that, more often than, a team with a higher SD wins. In my language, that...
Back
Top