0
   

I rly need help on a [simple] modal logic proof :(

 
 
Reply Thu 7 Jun, 2012 10:38 pm
I'm really stuck on a modal logic proof Sad
Propositional Modal Logic

Give proof or counterexample:
1) (p => q) > (~diamond q > ~diamond p), where > is " horseshoe "

How to proof this one?
  • Topic Stats
  • Top Replies
  • Link to this Topic
Type: Question • Score: 0 • Views: 2,392 • Replies: 4
No top replies

 
fresco
 
  1  
Reply Fri 8 Jun, 2012 12:43 am
@amazingsugar13,
Refer to the Truth Table for ">".
If the consequent q is false, then the premise p must be false.
0 Replies
 
Ding an Sich
 
  1  
Reply Sun 10 Jun, 2012 06:05 am
@amazingsugar13,
amazingsugar13 wrote:

I'm really stuck on a modal logic proof Sad
Propositional Modal Logic

Give proof or counterexample:
1) (p => q) > (~diamond q > ~diamond p), where > is " horseshoe "

How to proof this one?


There are two ways to go about proving this: 1) the informal route or 2) the formal route with deduction rules. I will do both

Prove theorem: (p > q) > (~diamond q > ~diamond q)
Proof: Since any truth also entails that it is possibly true, if p, then q entails that possibly if p, then q. According to an axiom in modal logic (I forget which one), possibly if p, then q entails that if possibly p, then possibly q. Now take the contrapositive of the consequent, which is if not possibly q, then not possibly p. Since we assumed the antecedent in our theorem, it entails the consequent, and we have thereby demonstrated that the consequent follows from the antecedent. Q.E.D

Now here's the formal route by means of deduction rules.
Prove theorem: (p > q) > (~diamond q > ~diamond q)
Proof:
Begin Subproof (1)
1. p > q assumption for conditional proof
Begin Subproof (2)
2. ~(~diamond q > ~diamond p) assumption for reductio
3. ~(~~diamond q v ~diamond p) 2, material implication
4. ~~~dimaond q & ~~diamond p) 3, demorgans
5. ~~~diamond q 4, conjunction elimination
6. ~~diamond p 4, conjunction elimination
7. ~diamond q 5, double negation
8. diamond p 6, double negation
9. box~ q 7, modal transformation
Begin Subproof (3) (I use the box subproof here)
10. ~q 9, box out
11. ~p 1, 10, modus tollens
End Subproof (3)
12. box ~p 10-11 box subproof
13. ~diamond p 12, modal transformation
14. diamond p & ~diamond p 8, 13, conjunction introduction
End Subroof (2)
15. ~diamond q > ~diamond p 2-14, reductio ad absurdum
End Subproof (1)
16. Theorem which we needed to prove

Hope this helps. If you need any more help on modal logic, ask me.
0 Replies
 
fresco
 
  1  
Reply Sun 10 Jun, 2012 10:49 am
@amazingsugar13,
ding's proofs seem rather complicated.

The only truth values which make the consequent false are q=0 and p=1
Placing those values in the premises bracket gives 0, hence the statement has been proved valid ( by method of "Backward Fell Swoop")
Ding an Sich
 
  1  
Reply Sun 10 Jun, 2012 10:38 pm
@fresco,
fresco wrote:

ding's proofs seem rather complicated.

The only truth values which make the consequent false are q=0 and p=1
Placing those values in the premises bracket gives 0, hence the statement has been proved valid ( by method of "Backward Fell Swoop")


Nah, they're not all that complicated. The formal one looks very messy though. A2K wouldn't let me space out everything like I wanted.

I could see backward fell swoop and references to the conditional truth table being useful. Let's hope that that is what our poster needs. It certainly is simpler.
0 Replies
 
 

Related Topics

A2K challenge! - Discussion by HexHammer
Logic Proof Help - Question by crimhaze
THE TEN COMMANDMENTS OF LOGIC - Discussion by Ragman
Derivations vs. symbolisation? - Question by collegestudent123
Logic word problem - Question by johnr
Cause of death..... - Discussion by gungasnake
Need help in defining - Question by ichishti
Predicate Logic Help - Question by splenax
 
  1. Forums
  2. » I rly need help on a [simple] modal logic proof :(
Copyright © 2024 MadLab, LLC :: Terms of Service :: Privacy Policy :: Page generated in 0.03 seconds on 05/18/2024 at 10:40:36