Question
use MP, MT, DS, and HS to prove that the followinf arguments are valid. solve #7, #9.
(6) 1. ~ M 2. NG 3. Ny M/:. G (7) 1. ~ DE 2. DF 3. ~ F/:. E (8) 1. GvH 2. ΗνΙ 3. ~ I/:. G (9) 1. ~ G (A v B) 2. B 3. AD 4. -
0 0
Add a comment Improve this question Transcribed image text
Answer #1

Assumption Reason. 1) Premise. DF 2) Premise. NF 3) By Modus Tollens ofO2. DE Premise. 5) E By. Modus Poners at , . Given Arg

Add a comment
Know the answer?
Add Answer to:
use MP, MT, DS, and HS to prove that the followinf arguments are valid. solve #7,...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Use MP, MT, DS, and HS to prove that the following arguments are valid. Am I doing this correctly...

    Use MP, MT, DS, and HS to prove that the following arguments are valid. Am I doing this correctly and what step am i missing? 1. A ---> (B ---> C) 2. ~ C 3. ~ D ---> A 4. C ∨ ~D PROVE: /∴ ~ B 5. ~D       (2,4) Disjunctive Syllogism 6. A        (3,5) Modus Ponens 7. B --->C      (1,6) Modus Ponens 8.~ B

  • Please do the first 3 problems for symbolic logic first four implication rules only MP MT DS HS

    please do the first 3 problems for symbolic logic first four implication rules only MP MT DS HS s Use the fi ollowing symbolized arguments. The number of lines provided below the arguments may be a tew more than you need to complete the proof,it just makes it easier for me to read st four implication rules andy (that is, MP, MT, DS, and HS) to derive the condlusions of the 3 point proofs: #2· 1.pvQ 3. R S 4,...

  • The only 9 rules of inference allowed are: 1. Modus Ponens (MP) 2. Modus Tollens (MT)...

    The only 9 rules of inference allowed are: 1. Modus Ponens (MP) 2. Modus Tollens (MT) 3. Hypothetical Syllogism (HS) 4. Disjunctive Syllogism (DS) 5. Constructive Dilemma (CD) 6. Simplification (Simp) 7. Conjunction (Conj) 8. Addition (Add) 9 absorption SECTION ONE: Formal proofs of validity using natural deductions Prove the following argument valid using the nine rules of inference. Copy-and-paste key of symbols: • v - = i Argument Two (1) A5B (2) ( A B ) > C (3)...

  • Options ifJ then H if not W then (not H and not F) Rules MP DS SIMP HS DN MT ADD CONJ CD DEM IMPL...

    Options ifJ then H if not W then (not H and not F) Rules MP DS SIMP HS DN MT ADD CONJ CD DEM IMPL TRANS EQUIV COM DIST EXP ASSOC ABS TAUT VW Instantiate TOTALS Level 1: 018 Level 2: 0/7 Level 3: 0/10 CURRENT 3-10 Hint Options ifJ then H if not W then (not H and not F) Rules MP DS SIMP HS DN MT ADD CONJ CD DEM IMPL TRANS EQUIV COM DIST EXP ASSOC ABS...

  • Options Y iff P if not Y then not C not P iff not C Rules MP DS SIMP HS DN MT ADD CONJ CD DEM IMP...

    Options Y iff P if not Y then not C not P iff not C Rules MP DS SIMP HS DN MT ADD CONJ CD DEM IMPL TRANS EQUIV COM ASSOC DIST EXP ABS TAUT İTY then C Instantiate TOTALS Level 1: 018 Level 2: 0/7 Level 3: 0/10 CURRENT 3-8 Hint Options Y iff P if not Y then not C not P iff not C Rules MP DS SIMP HS DN MT ADD CONJ CD DEM IMPL TRANS...

  • Use the first ENGHT implication rules (IMP, MT, HS, DS, Simp, Conl. the following symboilized agu...

    please do 15 15 and 16 if your not doing all 3 don't answer use the first ENGHT implication rules (IMP, MT, HS, DS, Simp, Conl. the following symboilized aguments. 15 points eachl nclusions c 3.p#5 // :. 5.L bS 2) 2) 15. 1. (P.Q_R use the first ENGHT implication rules (IMP, MT, HS, DS, Simp, Conl. the following symboilized aguments. 15 points eachl nclusions c 3.p#5 // :. 5.L bS 2) 2) 15. 1. (P.Q_R

  • Use propositional logic to prove that the following arguments are valid. Do not use truth tables....

    Use propositional logic to prove that the following arguments are valid. Do not use truth tables. 1. ( A C)^(C --B) AB: A 2. (P→ (QAR)) AP: (PA) 3. Z. (ZAZ) 4. A: (AV B)^(AVC) 5. (I → H) A (FV-H) AI: F

  • Python3 command line arguments; there are unknown number of arguments, 'only number // number and the...

    Python3 command line arguments; there are unknown number of arguments, 'only number // number and the length of the argument is three' is a valid argument,for example,2//5,3//5 are valid arguments,a//2,b//4,7//0,b//k are not valid arguments, calculate each valid argument and the number of valid arguments, and then print hint: split is very useful restrictions: [1:], for loop, slicing, lambda function, 'in' keyword,isdigit(), isalpha() cannot be used. Exception handling must be used, it is recommended to use while loop to solve this...

  • Translate the following argument into symbolic form, and test for validity using a full or indirect...

    Translate the following argument into symbolic form, and test for validity using a full or indirect truth table. (4 points) You can get partial credit for an incorrect translation if the truth table is correct for your translation. 3. If your car's headlights malfunction, then if you're driving at night you have to pull over. Your car's headlights don't malfunction. So you don't have to pull over. Prove the following arguments 4 (Only requires any of the first four implication...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT