Tutors Answer Your Questions about Proofs (FREE)
Question 1104291: Translate and solve the proof:
If God believes on Monday that I'll tell a lie on Tuesday, then either I have the power to make one of God's past beliefs false, or I cannot refrain from lying on Tuesday. I do not have the power to make one of God's past beliefs false if either God is infallible or the past is unalterable. The past is unalterable. It follows that if God believes on Monday that I'll tell a lie on Tuesday, then I cannot refrain from lying on Tuesday. (B,F,R,I,P)
Click here to see answer by Alan3354(69443)  |
Question 1104538: . I had pancakes for breakfast today. I had pancakes for breakfast today and God infallibly foreknows the future, only if God believed a million years ago that I would have pancakes for breakfast today. If God believed a million years ago that I would have pancakes for breakfast today, then, if I could have chosen to have something else, either I could have brought it about that God did not believe a million years ago that I would have pancakes for breakfast today or I could have brought it about that God had a false belief. However, if God believed a million years ago that I would have pancakes for breakfast today, then, if I could have brought it about that God did not believe a million years ago that I would have pancakes for breakfast today, I could have changed the past. But I could not have changed the past. Also, its false that, if God infallibly foreknows the future, I could have brought it about that God had a false belief. Therefore, if God infallibly knows the future, I could not have chosen to have something else. (P: I had pancakes today; I: God infallibly foreknows the future; B: God believed a million years ago that I would have pancakes today; C: I could have chosen to have something else; Y: I could have brought it about that God did not believe a million years ago that I would have pancakes today; F: I could have brought it about that God had a false belief; H: I could have changed the past.
I have spent hours on this. You have to translate it then solve it by assuming the conditional proof or buy assuming RAA. I can't figure out the proper translation for it. Any help is very much appreciated I have a final exam in 1 hour.
Click here to see answer by Alan3354(69443)  |
Question 1112710: Indirect proof
9.
1) R
2) (~ C v ~ D) v S
3) ~ (C ⋅ D) ⊃ ~R / ∴ S
10.
1) (A ⋅ B)⋅ ~ (S v T)
2) ~E
3) (S v T) v ~ (~E ⋅ ~F)
4) (~E v F)⊃(A ⋅ B) / ∴ E v F
12.
1) A v B
2) B ⊃ (A v D)
3) ~ D / ∴ A
Conditional proof
11.
1) A ⊃ B / ∴ A ⊃ [ C ⊃ ~ (B ⊃ ~A) ]
Help me please!
Click here to see answer by solver91311(24713)  |
Question 1113758: I need help on this problem. I don't understand how to do proofs and I need all the help I can get. In the directions, it says, " Construct proofs to show the following symbolic arguments are valid. The comma marks the break between premises. " Here is the problem, that I need help on.
8. C-> (T->L), ~L, ~E->C, L v ~E :.~T
This the work I put on so far: 1. C -> (T ->L)
2. ~L
3. ~E->C
4. L v ~E
Click here to see answer by Edwin McCravy(20054)  |
Question 1113762: I need help on constructing the proof to make the argument valid. The Commas are the breaks. Also, I don't know if I am doing this right
9.~~A, B-> ~A, A :. ~B
My work:
1.~~A
2. B->~A
3. A
4. :. ~B
ADD Step 1, 2
MT Steps 3, 4
Am I correct? I don't know if I am doing this right?
Click here to see answer by math_helper(2461)  |
Question 1116996: Construct a regular proof to derive the conclusion of the following argument:
1. X >Y
2. (Y v ~X) > (Y > Z) / ~Z > ~X
I have attempted to use Addition to get X > (Y V ~X) from line 1 and no proof checkers that I have attempted will accept it.
Click here to see answer by math_helper(2461)  |
Question 1116905:
Give reasons for the steps, given premises 1, 2 and 3:
1. X ⊃ (Y ⊃ Z)
2. X ⊃ (A ⊃ B)
3. X (Y ∨ A) ∴ ∼B ⊃ X
4. X
5. A ⊃ B
6. Y ⊃ Z
7. (Y ∨ A) X
8. Y ∨ A
9. ∼(∼Y) ∨ A
10. ∼Y ⊃ A
11. ∼Y ⊃ B
12. ∼B ⊃ ∼(∼Y)
13. ∼B ⊃ Y
14. X ∨ ∼Y
15. ∼Y ∨ X
16. Y ⊃ X
17. ∼B ⊃ X
Click here to see answer by Edwin McCravy(20054)  |
|
Older solutions: 1..45, 46..90, 91..135, 136..180, 181..225, 226..270, 271..315, 316..360, 361..405, 406..450, 451..495, 496..540, 541..585, 586..630, 631..675, 676..720, 721..765, 766..810, 811..855, 856..900, 901..945, 946..990, 991..1035, 1036..1080, 1081..1125, 1126..1170, 1171..1215, 1216..1260, 1261..1305, 1306..1350, 1351..1395, 1396..1440, 1441..1485
|