I know that the negation of $p\to q$ is ~p V q but I can’t seem to figure out the effect $\sim q$ will have on the negation. Also is their a way to check if something is the negation of a statement?
2026-04-01 14:03:02.1775052182
What is the negation of $p\to \sim q$?
2.1k Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in PROPOSITIONAL-CALCULUS
- Help with Propositional Logic Proof
- Can we use the principle of Explosion to justify the definition of implication being True when the antecedent is False?
- Simplify $(P \wedge Q \wedge R)\vee(\neg P\wedge Q\wedge\neg R)\vee(\neg P\wedge\neg Q\wedge R)\vee(\neg P \wedge\neg Q\wedge\neg R)$
- Alternative theories regarding the differences between the material conditional and the indicative conditionals used in natural language?
- Translations into logical notation
- Is the negation of $(a\wedge\neg b) \to c = a \wedge\neg b \wedge\neg c$?
- I am kind of lost in what do I do from here in Propositional Logic Identities. Please help
- Boolean Functional completeness of 5 operator set in propositional logic
- Variables, Quantifiers, and Logic
- Comparison Propositional Logic
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
The definition of implication in propositional logic can be expressed with
\begin{equation}\tag{1} p\rightarrow q~:=~(\sim p)\lor q \end{equation}
By this definition, the negation of $p\rightarrow q$ is $p\land(\sim q)$. This means that the statement $p$ implies $q$, is false only when the antecedent or premise of the statement is true, and its consequent false.
Using the same definition, negation of the statement $p\rightarrow (\sim q)$ is
\begin{align} \sim(p\rightarrow (\sim q))~~~&Start\\ \sim((\sim p)\lor (\sim q))~~~&Substitute~(1)\\ p\land q~~~&De~Morgan's~law \end{align}
To check if any two statements in propositional logic are the negation of one another, it is sufficient to substitute all instances of implication with the first definition, then negate one, and apply De Morgan's law successively to it until one reduces to the other. If this is the case, then they are negations of one-another.