Given, p: Ravi races, q: Ravi wins
∴ The statement of given proposition ∼(p∨(∼q)) is
"It is not true that Ravi races or that Ravi does not win."
Negation of a statement in mathematical reasoning
The denial of a statement p is called its negation, written as ~ p~ p. Negation of any statement p is formed by writing "It is not the case that ..... "or " It is false that......." before p or, if possible by inserting in p the word "not".
Negation is called a connective although it does not combine two or more statements. In fact, it only modifies a statement.
Negation of compound statements:
We have learnt about negation of a simple statement. Writing the negation of compound statements having conjunction, disjunctions, implication, equivalence, etc, is not very simple. So, let us discuss the negation of compound statement.
(i) Negation of conjunction:If p and q are two statements, then ∼ (p∧q )≡(∼p∨∼q)∼ p∧q ≡(∼p∨∼q)
(ii) Negation of disjunction:If p and q are two statements, then ∼ (p∨q )≡(∼p∧ ∼q)∼ p∨q ≡(∼p∧ ∼q)
(iii) Negation of implication:If p and q are two statements, then ∼(p⇒q)≡∼p⇒q≡∼(∼p∨q)≡∼(∼p∨q)≡(p ∧ ∼q)p ∧ ∼q
(iv) Negation of biconditional statement:If p and q are two statements, then∼(p ⇔q)≡(p ∧ ∼q) ∨(q ∧ ∼p) ≡ ∼p⇔q≡p⇔∼q