Understanding Proof Writing: Why We Use 3) instead of 4)

AI Thread Summary
The discussion focuses on the distinction between two mathematical statements, specifically why statement 3) is preferred over statement 4). Statement 3) correctly asserts that there exists an x that is a member of F and satisfies P(x), while statement 4) introduces ambiguity by allowing for the possibility of x not being in F. The confusion arises from the implications of the truth values in both statements, particularly how the left-hand side of 4) can be true even if F is empty. Participants clarify that including the possibility of x not being in F in statement 4) is not desirable, as it could misrepresent the intended meaning. Overall, the conversation emphasizes the importance of precise language in mathematical proofs.
Salt
Messages
15
Reaction score
0
I have no idea how to type math symbols into here so it's all in the PNG attached.

I'm probably kind of dumb for not getting this but...

I understand that 1) & 3) are true. And the 2) is not right, as it means all x are members of F and true for P(x) when we mean all x that are members of F are true for P(x).
But why do we use 3) instead of 4)?
 

Attachments

  • Clipboard01.png
    Clipboard01.png
    924 bytes · Views: 472
Physics news on Phys.org
(4) is not always a true statement. The right hand side of (4) would be true even if F were empty whereas the left hand side would not be. Notice that if x is NOT in F then "x contained in F implies P(x)" is a TRUE statement because the hypothesis is FALSE.

matt, that was pretty much what you said. Why did you delete it?
 
Last edited by a moderator:
Cos when I looked more closely I decided that I couldn't decipher the small subscript on the LHS with any certainity.
 
Thanks everyone. Sorry about the size, I attached a bigger one in this post.

So from what I understand from reading the replies and scratching my head over the AND and IMPLIE truth tables.

right side of 3) asserts :
  • there exist a x such that it's a member of F and true for P(x)

right side of 4) asserts :
  1. there exist a x such that it's a member of F and true for P(x) , or
  2. there exist a x such that it's NOT a member of F and true for P(x) , or
  3. there exist a x such that it's NOT a member of F and NOT true for P(x)

However we do not wish to state as true 2. and 3. , for it would implie that there exist a x that is NOT a member of F. As the set representing "not F" may or may not be empty.

Anyway that's the reasoning I manage to arrive at.
 

Attachments

  • Clipboard0.png
    Clipboard0.png
    3.3 KB · Views: 465
A=>B is precisely "B or not(A)".
 
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...

Similar threads

Back
Top