Why Did My Logical Equivalence Proof Fail?

  • Thread starter Thread starter cashflow
  • Start date Start date
  • Tags Tags
    Equivalence
cashflow
Messages
36
Reaction score
1
I took a quiz that I was very confident in and just got the scores back today -- I did terribly (50%). Anyway, I am trying to understand where my mistake is below. I went over this three times and I cannot figure out why it's wrong (it looks right to me).

To Prove: ~(p ∧ r) ∨ ~(q ∨ r) ≡ p ∧ r → ~r ∧ ~q

First, we know that a ≡ b is the same as b ≡ a. So, in my case, I started with b and worked to prove a.

Proof:
Starting with:
p ∧ r → ~r ∧ ~q
≡ ~(p ∧ r) ∨ (~r ∧ ~q) by the '∨' def. of '→'
≡ ~(p ∧ r) ∨ ~(r ∨ q) by De Morgan's Law
≡ ~(p ∧ r) ∨ ~(q ∨ r) by Commutative Law

I asked the professor where, and he said "It doesn't matter where. I looked at it and saw this lacked quality." I don't understand. I proved that the two sides are the logically equivalent in 3 steps. Help please? Thank you!
 
Mathematics news on Phys.org
cashflow said:
I asked the professor where, and he said "It doesn't matter where. I looked at it and saw this lacked quality."
His reponse is very vague and unhelpful. I don't see anything wrong with your work. I would advise going to see your professor during office hours and asking him what he means by "lacking quality" and where, specifically, he considers your proof to be incorrect. I

If you don't get a good explanation from him, you could make an appointment with the department head.
 
cashflow said:
I took a quiz that I was very confident in and just got the scores back today -- I did terribly (50%). Anyway, I am trying to understand where my mistake is below. I went over this three times and I cannot figure out why it's wrong (it looks right to me).

To Prove: ~(p ∧ r) ∨ ~(q ∨ r) ≡ p ∧ r → ~r ∧ ~q

First, we know that a ≡ b is the same as b ≡ a. So, in my case, I started with b and worked to prove a.

Proof:
Starting with:
p ∧ r → ~r ∧ ~q
≡ ~(p ∧ r) ∨ (~r ∧ ~q) by the '∨' def. of '→'
≡ ~(p ∧ r) ∨ ~(r ∨ q) by De Morgan's Law
≡ ~(p ∧ r) ∨ ~(q ∨ r) by Commutative Law

I asked the professor where, and he said "It doesn't matter where. I looked at it and saw this lacked quality." I don't understand. I proved that the two sides are the logically equivalent in 3 steps. Help please? Thank you!
Could you perhaps prove it using a truth table?
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top