Can This Logic Proof for ~(~E > A) Be Resolved?

In summary, the author is trying to figure out how to solve a logic proof, but is having difficulty. They explain the rules of replacement and implication, and then show that because ~E > A is false, ~E > A cannot be true. They go on to prove that A is not true using the same logic. Finally, they show that because ~E > A cannot be unpacked, it is a horseshoe.
  • #1
NileQueen
105
1
1. ~(A v B) It is neither A nor B.
2. ~(C v D) It is neither C nor D.
3. E > (C v B) If E, then C or B
Therefore, ~(~E > A)
--------------------------------------------
This is a logic proof I cannot seem to resolve.

I've tried working backwards from the conclusion.

http://www.hu.mtu.edu/~tlockha/h2701n10.s02.doc
Here are rules of replacement and rules of implication.

I know that ~ (~E > A) is a true statement.
I know that because I know ~E > A is false
Because ~E > ~ A (proved below) is true so ~E > A cannot be true.
A is not true because ~A is true. ~E is also true.

~(~E > A) cannot be unpacked because it is a horseshoe.
I can introduce (~E > A) as an addition (trying to work backwards):

1. ~A v (~E > A) add on ~A
2. A > (~E > A) 1, impl
We don't have a rule that says not P therefore not Q

3 (~E > A) v ~A 1 comm
4. ~ (~E >A) > ~A 3 impl

We don't have a rule that says Q therefore P


The proof as far as I can get it
> 1. ~(A v B)
> 2. ~(C v D)
> 3. E > (C v B)
> Therefore ~( ~E > A)
> 4. ~A and ~B ....1, DeMorgan
> 5. ~C and ~D ...2. DeMorgan
> 6. ~C...... 5. simplification
> 7. ~B......4. simplification
> 8. ~C and ~B...6,7 conjunction
> 9. ~(C v B)...8, DeMorgan
> 10. ~E.....3,9, Modus Tolens
11. ~A......4 simpl




Additional attempts:
> 12. ~A v ~A....11 tautology
> 13. A > ~A.....12. implication
> 14 ~A v E...11 addition
> 15. A> E.....14. impl
> 16. ~E > ~A....15. contraposition

17 ~A v ~E....11, add
18 A > ~E......17 impl
19 E > ~A......18, contra
 
Last edited by a moderator:
Physics news on Phys.org
  • #2
In your first attempt, you get ~E (line 10) and ~A (line 11). This gives
12. ~E & ~A (conjunction introduction, 10, 11)
13. ~(~(~E & ~A)) (double negation, 12)
14. ~(~E > A) (implication, 13)
 
  • #3
I agree with 12.

According to Demorgan
~E*~A :: ~(E v A)

Implication
(P>Q) :: (~P v Q)
no conjunctions are involved.
 
  • #4
I think you have skipped at least one step.
Also, can you really operate on things within a parentheses with a negation outside?
~(E v A ) becomes ~ (~E >A) with DN and impl
I don't see that in the rules anywhere.
Thanks for your help.
 

FAQ: Can This Logic Proof for ~(~E > A) Be Resolved?

What is an unresolved logic proof?

An unresolved logic proof is a statement or argument in the form of a logical formula that has not yet been proven to be true or false. It requires further analysis and reasoning to determine its validity.

What does the "~" symbol mean in the statement "~(~E > A)"?

The "~" symbol in this statement is the logical operator for negation. It means "not" or "opposite of". In this context, it indicates that the statement following it is being negated.

What is the significance of "(~E > A)" in this statement?

The "(~E > A)" portion of the statement is a logical implication, where "~E" is the antecedent and "A" is the consequent. This can be read as "if not E, then A".

How can we solve or prove an unresolved logic proof?

To solve or prove an unresolved logic proof, we need to use logical reasoning and tools such as truth tables, logical equivalences, and deductive reasoning. By breaking down the statement and analyzing its components, we can determine its validity.

What is the possible outcome of resolving the logic proof "~(~E > A)"?

The possible outcome of resolving this logic proof is a definitive answer as to whether the statement is true or false. It could also lead to further insights and understanding of the logical relationships between the components of the statement.

Back
Top