How to Negate Complex Logical Assertions in Mathematics?

  • Thread starter Thread starter Pythagorean12
  • Start date Start date
AI Thread Summary
The discussion focuses on negating complex logical assertions in mathematics, specifically two statements involving natural numbers. The first assertion's negation is debated, with the correct form being that if Coke is not worse than Pepsi, then everything Mandelson says can be trusted. The second assertion involves quantifiers and is negated to state that there exists an m such that for all n, there exists a and b where n is less than m or both a and b are not equal to 1 and their product equals n. Participants emphasize that the negation of an "if-then" statement is not another "if-then" statement. The accuracy of the answers provided is questioned due to the lack of definitions for the variables involved.
Pythagorean12
Messages
5
Reaction score
0

Homework Statement



Write down the negations of the following assertions (where m, n, a, b are natural numbers):

a) if Coke is not worse than Pepsi then nothing Mandelson says can be trusted.
b) \forall m \exists n\forall a\forall b (n >= m) /\ [(a=1) \/(b=1) \/ (ab \ne n)]

Answers:
a) if Coke is not worse than Pepsi then everything Mandelson says can be trusted.
b) \exists m\forall n \exists a\exists b (n < m) \/[(a \ne 1) /\ (b \ne 1) /\ (ab =n)]

Could anyone check whenever or not these answers are correct?
 
Physics news on Phys.org
Since you have not said what "a", "b", "m", or "n" mean, it is impossible to tell.

I will say this- the negation of an "if- then" implication is NOT an "if-then" implication.
 
Back
Top