mdthr

symbolic contingency

Feb 7th, 2023 (edited)
107
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.48 KB | None | 0 0
  1. □∃q→∃u :
  2. 1. ∀p∃(q→p).
  3.  
  4. 2. ∄u , ∄u→∃u.
  5.  
  6. c.
  7. ∃u→∃(q→u).
  8. ∃(∁u→u) ⇔ ∃(∁(∃⊻∄)→u) ⇔ q.
  9. ∁u⇔¬∄q.
  10. □∃q→∃u.
  11.  
  12.  
  13. ∀p∃(q→p) ⇔ ( ∀p∃(q→p) ∧ ¬(p□∃) ) :
  14. 1. ∀p∃(q→p)
  15.  
  16. 2. p□∃ ⇔ ( ¬∃(q→p) → q∧¬q ).
  17.  
  18. c.
  19. ∃(q→p) → ¬(p□∃).
  20. ∀p∃(q→p) ⇔ ( ∀p∃(q→p) ∧ ¬(p□∃) )
  21.  
  22.  
  23.  
  24.  
  25. ~~~~~
  26.  
  27.  
  28.  
  29. 1. "∀p∃(q→p). " [The Principle of Sufficient Reason & Causal Principle]
  30. 2. "∄u , ∄u→∃u" [the set of emergent existents began to exist]
  31. c. "∃u→∃(q→u). [1, 2, Modus Ponens.]
  32. ∃(∁u→u) ⇔ ∃(∁(∃⊻∄)→u) ⇔ q. [Extrinsic specifier (q), outside of the set of emergent existents, caused the emergence of the set of emergent existents.]
  33. ∁u⇔¬∄q. [The extrinsic specifier exists, not in the set of existents that accepts negation of their existence.]
  34. □∃q. [The extrinsic specifier always exists; it exists necessarily.]"
  35.  
  36.  
  37. Let me clarify the corrected steps:
  38.  
  39. 1. The Principle of Sufficient Reason & Causal Principle: "∀p∃(q→p)."
  40. 2. The set of emergent existents began to exist: "∄u , ∄u→∃u."
  41. 3. Using Modus Ponens on steps 1 and 2: "∃u→∃(q→u)."
  42. 4. The extrinsic specifier (q), outside of the set of emergent existents, caused the emergence of the set of emergent existents: "∃(∁u→u) ⇔ ∃(∁(∃⊻∄)→u) ⇔ q."
  43. 5. The extrinsic specifier exists, not in the set of existents that accepts negation of their existence: "∁u⇔¬∄q."
  44. 6. The extrinsic specifier always exists; it exists necessarily: "□∃q."
  45.  
  46.  
  47.  
  48. 1. ∀p∃(q→p)
  49. This is the given premise. It states that for every proposition p, there exists a proposition q such that q implies p.
  50. 2. p□∃ ⇔ ( ¬∃(q→p) → q∧¬q ).
  51. This is the contrapositive form of the law of excluded middle, which states that for any proposition p, either p or ¬p is true, and cannot both be false. If p always exists (p □∃), then for any proposition q, we have both q and ¬q, because p can be either true or false.
  52. 3. ∃(q→p) → ¬(p□∃).
  53. This follows from the contrapositive of 2, since if there exists a q such that q implies p, then it must not be the case that p always exists.
  54. 4. Therefore,
  55. ∀p∃(q→p) ⇔ ( ∀p∃(q→p) ∧ ¬(p□∃) )
  56. This follows from 1 and 3, since if for every p, there exists a q such that q implies p (1), then it must not be the case that p always exists (3), which is equivalent to the right-hand side of the equivalence.
Advertisement
Add Comment
Please, Sign In to add comment