Explain the rules of inference used to obtain each conclusion from the premises (Rosen 8th Ed):












1












$begingroup$


I'm having a difficult time with the following - seems like a lot of work and I'm unsure if my conclusions makes sense when translated back to english.





  1. If I work, it is either sunny or partly sunny (Premise):
    $forall x (W(x) to (S(x) lor P(x))$

  2. I worked last Monday or I worked last Friday (Premise):
    $W_{Monday} lor W_{Friday}$

  3. It was not sunny on Tuesday (Premise):
    $lnot S_{Tuesday}$

  4. It was not partly sunny on Friday (Premise):
    $lnot P_{Friday}$




$5. W_{Friday} to (S_{Friday} lor P_{Friday})$ (Universal Instantiation 1.)



$6. P_{Friday} lor (lnot W_{Friday} lor S_{Friday} )$ (Logical Equivalence, Commutative & Associative Laws)



$7.lnot W_{Friday} lor S_{Friday}$ (Disjunctive Syllogism 4. & 6.)



$8.W_{Monday} lor S_{Friday}$ (Resolution 2. & 7.)



$9. W_{Monday} to (S_{Monday} lor P_{Monday})$ (Universial Instantiation 1.)



$10. lnot W_{Monday} lor (S_{Monday} lor P_{Monday})$ (Logical Equivalence)



$11.S_{Friday} lor (S_{Monday} lor P_{Monday}) equiv lnot S_{Friday} to (S_{Monday} lor P_{Monday})$ (Resolution 8. & 10.)



$12. exists x exists y(lnot S(x) to (S(y) lor P(y))$ (Existential Generalization 11. with 3.) Conclusion: There exists a day when it was not sunny, while on another day it was either sunny or partly sunny.



Seems rather inconclusive.






proof-verification logic







share|cite|improve this question











$endgroup$

















    1












    $begingroup$


    I'm having a difficult time with the following - seems like a lot of work and I'm unsure if my conclusions makes sense when translated back to english.





    1. If I work, it is either sunny or partly sunny (Premise):
      $forall x (W(x) to (S(x) lor P(x))$

    2. I worked last Monday or I worked last Friday (Premise):
      $W_{Monday} lor W_{Friday}$

    3. It was not sunny on Tuesday (Premise):
      $lnot S_{Tuesday}$

    4. It was not partly sunny on Friday (Premise):
      $lnot P_{Friday}$




    $5. W_{Friday} to (S_{Friday} lor P_{Friday})$ (Universal Instantiation 1.)



    $6. P_{Friday} lor (lnot W_{Friday} lor S_{Friday} )$ (Logical Equivalence, Commutative & Associative Laws)



    $7.lnot W_{Friday} lor S_{Friday}$ (Disjunctive Syllogism 4. & 6.)



    $8.W_{Monday} lor S_{Friday}$ (Resolution 2. & 7.)



    $9. W_{Monday} to (S_{Monday} lor P_{Monday})$ (Universial Instantiation 1.)



    $10. lnot W_{Monday} lor (S_{Monday} lor P_{Monday})$ (Logical Equivalence)



    $11.S_{Friday} lor (S_{Monday} lor P_{Monday}) equiv lnot S_{Friday} to (S_{Monday} lor P_{Monday})$ (Resolution 8. & 10.)



    $12. exists x exists y(lnot S(x) to (S(y) lor P(y))$ (Existential Generalization 11. with 3.) Conclusion: There exists a day when it was not sunny, while on another day it was either sunny or partly sunny.



    Seems rather inconclusive.






    proof-verification logic







    share|cite|improve this question











    $endgroup$















      1












      1








      1





      $begingroup$


      I'm having a difficult time with the following - seems like a lot of work and I'm unsure if my conclusions makes sense when translated back to english.





      1. If I work, it is either sunny or partly sunny (Premise):
        $forall x (W(x) to (S(x) lor P(x))$

      2. I worked last Monday or I worked last Friday (Premise):
        $W_{Monday} lor W_{Friday}$

      3. It was not sunny on Tuesday (Premise):
        $lnot S_{Tuesday}$

      4. It was not partly sunny on Friday (Premise):
        $lnot P_{Friday}$




      $5. W_{Friday} to (S_{Friday} lor P_{Friday})$ (Universal Instantiation 1.)



      $6. P_{Friday} lor (lnot W_{Friday} lor S_{Friday} )$ (Logical Equivalence, Commutative & Associative Laws)



      $7.lnot W_{Friday} lor S_{Friday}$ (Disjunctive Syllogism 4. & 6.)



      $8.W_{Monday} lor S_{Friday}$ (Resolution 2. & 7.)



      $9. W_{Monday} to (S_{Monday} lor P_{Monday})$ (Universial Instantiation 1.)



      $10. lnot W_{Monday} lor (S_{Monday} lor P_{Monday})$ (Logical Equivalence)



      $11.S_{Friday} lor (S_{Monday} lor P_{Monday}) equiv lnot S_{Friday} to (S_{Monday} lor P_{Monday})$ (Resolution 8. & 10.)



      $12. exists x exists y(lnot S(x) to (S(y) lor P(y))$ (Existential Generalization 11. with 3.) Conclusion: There exists a day when it was not sunny, while on another day it was either sunny or partly sunny.



      Seems rather inconclusive.






      proof-verification logic







      share|cite|improve this question











      $endgroup$




      I'm having a difficult time with the following - seems like a lot of work and I'm unsure if my conclusions makes sense when translated back to english.





      1. If I work, it is either sunny or partly sunny (Premise):
        $forall x (W(x) to (S(x) lor P(x))$

      2. I worked last Monday or I worked last Friday (Premise):
        $W_{Monday} lor W_{Friday}$

      3. It was not sunny on Tuesday (Premise):
        $lnot S_{Tuesday}$

      4. It was not partly sunny on Friday (Premise):
        $lnot P_{Friday}$




      $5. W_{Friday} to (S_{Friday} lor P_{Friday})$ (Universal Instantiation 1.)



      $6. P_{Friday} lor (lnot W_{Friday} lor S_{Friday} )$ (Logical Equivalence, Commutative & Associative Laws)



      $7.lnot W_{Friday} lor S_{Friday}$ (Disjunctive Syllogism 4. & 6.)



      $8.W_{Monday} lor S_{Friday}$ (Resolution 2. & 7.)



      $9. W_{Monday} to (S_{Monday} lor P_{Monday})$ (Universial Instantiation 1.)



      $10. lnot W_{Monday} lor (S_{Monday} lor P_{Monday})$ (Logical Equivalence)



      $11.S_{Friday} lor (S_{Monday} lor P_{Monday}) equiv lnot S_{Friday} to (S_{Monday} lor P_{Monday})$ (Resolution 8. & 10.)



      $12. exists x exists y(lnot S(x) to (S(y) lor P(y))$ (Existential Generalization 11. with 3.) Conclusion: There exists a day when it was not sunny, while on another day it was either sunny or partly sunny.



      Seems rather inconclusive.






      proof-verification logic




      proof-verification logic






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Jan 20 at 2:55







      Elliott

















      asked Jan 20 at 1:29









      ElliottElliott

      424




      424






















          1 Answer
          1






          active

          oldest

          votes


















          1












          $begingroup$

          Hint



          The premises refer to three days : Mon, Tue, Fri.



          Thus, it can be useful to use all of them in Universal instantiation of 1) to get :




          5) $W(F) → (S(F) ∨ P(F))$ i.e. $lnot W(F) ∨ (S(F) ∨ P(F))$



          6) $lnot W(T) ∨ (S(T) ∨ P(T))$




          and




          7) $lnot W(M) ∨ (S(M) ∨ P(M))$.




          Then, using Resolution, we get :



          8) $lnot W(T) ∨ P(T)$ --- from 3) and 6)



          9) $lnot W(F) ∨ S(F)$ --- from 4) and 5)



          10) $W(F) lor S(M) ∨ P(M)$ --- from 2) and 7)



          11) $W(M) lor S(F)$ --- from 2) and 9).



          All this is not very useful...



          8) is $W(T) to P(T)$ and from it : $exists x (W(x) to P(x))$.



          In the same way, from 9) : $exists x (W(x) to S(x))$.






          share|cite|improve this answer











          $endgroup$













          • $begingroup$
            So if translated back to english than we can conclude that it was Sunny on Friday, and Sunny on Monday, or Partly Sunny on Monday?
            $endgroup$
            – Elliott
            Jan 22 at 4:04











          Your Answer





          StackExchange.ifUsing("editor", function () {
          return StackExchange.using("mathjaxEditing", function () {
          StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
          StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
          });
          });
          }, "mathjax-editing");

          StackExchange.ready(function() {
          var channelOptions = {
          tags: "".split(" "),
          id: "69"
          };
          initTagRenderer("".split(" "), "".split(" "), channelOptions);

          StackExchange.using("externalEditor", function() {
          // Have to fire editor after snippets, if snippets enabled
          if (StackExchange.settings.snippets.snippetsEnabled) {
          StackExchange.using("snippets", function() {
          createEditor();
          });
          }
          else {
          createEditor();
          }
          });

          function createEditor() {
          StackExchange.prepareEditor({
          heartbeatType: 'answer',
          autoActivateHeartbeat: false,
          convertImagesToLinks: true,
          noModals: true,
          showLowRepImageUploadWarning: true,
          reputationToPostImages: 10,
          bindNavPrevention: true,
          postfix: "",
          imageUploader: {
          brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
          contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
          allowUrls: true
          },
          noCode: true, onDemand: true,
          discardSelector: ".discard-answer"
          ,immediatelyShowMarkdownHelp:true
          });


          }
          });














          draft saved

          draft discarded


















          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3080062%2fexplain-the-rules-of-inference-used-to-obtain-each-conclusion-from-the-premises%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown

























          1 Answer
          1






          active

          oldest

          votes








          1 Answer
          1






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes









          1












          $begingroup$

          Hint



          The premises refer to three days : Mon, Tue, Fri.



          Thus, it can be useful to use all of them in Universal instantiation of 1) to get :




          5) $W(F) → (S(F) ∨ P(F))$ i.e. $lnot W(F) ∨ (S(F) ∨ P(F))$



          6) $lnot W(T) ∨ (S(T) ∨ P(T))$




          and




          7) $lnot W(M) ∨ (S(M) ∨ P(M))$.




          Then, using Resolution, we get :



          8) $lnot W(T) ∨ P(T)$ --- from 3) and 6)



          9) $lnot W(F) ∨ S(F)$ --- from 4) and 5)



          10) $W(F) lor S(M) ∨ P(M)$ --- from 2) and 7)



          11) $W(M) lor S(F)$ --- from 2) and 9).



          All this is not very useful...



          8) is $W(T) to P(T)$ and from it : $exists x (W(x) to P(x))$.



          In the same way, from 9) : $exists x (W(x) to S(x))$.






          share|cite|improve this answer











          $endgroup$













          • $begingroup$
            So if translated back to english than we can conclude that it was Sunny on Friday, and Sunny on Monday, or Partly Sunny on Monday?
            $endgroup$
            – Elliott
            Jan 22 at 4:04
















          1












          $begingroup$

          Hint



          The premises refer to three days : Mon, Tue, Fri.



          Thus, it can be useful to use all of them in Universal instantiation of 1) to get :




          5) $W(F) → (S(F) ∨ P(F))$ i.e. $lnot W(F) ∨ (S(F) ∨ P(F))$



          6) $lnot W(T) ∨ (S(T) ∨ P(T))$




          and




          7) $lnot W(M) ∨ (S(M) ∨ P(M))$.




          Then, using Resolution, we get :



          8) $lnot W(T) ∨ P(T)$ --- from 3) and 6)



          9) $lnot W(F) ∨ S(F)$ --- from 4) and 5)



          10) $W(F) lor S(M) ∨ P(M)$ --- from 2) and 7)



          11) $W(M) lor S(F)$ --- from 2) and 9).



          All this is not very useful...



          8) is $W(T) to P(T)$ and from it : $exists x (W(x) to P(x))$.



          In the same way, from 9) : $exists x (W(x) to S(x))$.






          share|cite|improve this answer











          $endgroup$













          • $begingroup$
            So if translated back to english than we can conclude that it was Sunny on Friday, and Sunny on Monday, or Partly Sunny on Monday?
            $endgroup$
            – Elliott
            Jan 22 at 4:04














          1












          1








          1





          $begingroup$

          Hint



          The premises refer to three days : Mon, Tue, Fri.



          Thus, it can be useful to use all of them in Universal instantiation of 1) to get :




          5) $W(F) → (S(F) ∨ P(F))$ i.e. $lnot W(F) ∨ (S(F) ∨ P(F))$



          6) $lnot W(T) ∨ (S(T) ∨ P(T))$




          and




          7) $lnot W(M) ∨ (S(M) ∨ P(M))$.




          Then, using Resolution, we get :



          8) $lnot W(T) ∨ P(T)$ --- from 3) and 6)



          9) $lnot W(F) ∨ S(F)$ --- from 4) and 5)



          10) $W(F) lor S(M) ∨ P(M)$ --- from 2) and 7)



          11) $W(M) lor S(F)$ --- from 2) and 9).



          All this is not very useful...



          8) is $W(T) to P(T)$ and from it : $exists x (W(x) to P(x))$.



          In the same way, from 9) : $exists x (W(x) to S(x))$.






          share|cite|improve this answer











          $endgroup$



          Hint



          The premises refer to three days : Mon, Tue, Fri.



          Thus, it can be useful to use all of them in Universal instantiation of 1) to get :




          5) $W(F) → (S(F) ∨ P(F))$ i.e. $lnot W(F) ∨ (S(F) ∨ P(F))$



          6) $lnot W(T) ∨ (S(T) ∨ P(T))$




          and




          7) $lnot W(M) ∨ (S(M) ∨ P(M))$.




          Then, using Resolution, we get :



          8) $lnot W(T) ∨ P(T)$ --- from 3) and 6)



          9) $lnot W(F) ∨ S(F)$ --- from 4) and 5)



          10) $W(F) lor S(M) ∨ P(M)$ --- from 2) and 7)



          11) $W(M) lor S(F)$ --- from 2) and 9).



          All this is not very useful...



          8) is $W(T) to P(T)$ and from it : $exists x (W(x) to P(x))$.



          In the same way, from 9) : $exists x (W(x) to S(x))$.







          share|cite|improve this answer














          share|cite|improve this answer



          share|cite|improve this answer








          edited Jan 22 at 9:15

























          answered Jan 20 at 8:19









          Mauro ALLEGRANZAMauro ALLEGRANZA

          66.3k449115




          66.3k449115












          • $begingroup$
            So if translated back to english than we can conclude that it was Sunny on Friday, and Sunny on Monday, or Partly Sunny on Monday?
            $endgroup$
            – Elliott
            Jan 22 at 4:04


















          • $begingroup$
            So if translated back to english than we can conclude that it was Sunny on Friday, and Sunny on Monday, or Partly Sunny on Monday?
            $endgroup$
            – Elliott
            Jan 22 at 4:04
















          $begingroup$
          So if translated back to english than we can conclude that it was Sunny on Friday, and Sunny on Monday, or Partly Sunny on Monday?
          $endgroup$
          – Elliott
          Jan 22 at 4:04




          $begingroup$
          So if translated back to english than we can conclude that it was Sunny on Friday, and Sunny on Monday, or Partly Sunny on Monday?
          $endgroup$
          – Elliott
          Jan 22 at 4:04


















          draft saved

          draft discarded




















































          Thanks for contributing an answer to Mathematics Stack Exchange!


          • Please be sure to answer the question. Provide details and share your research!

          But avoid …



          • Asking for help, clarification, or responding to other answers.

          • Making statements based on opinion; back them up with references or personal experience.


          Use MathJax to format equations. MathJax reference.


          To learn more, see our tips on writing great answers.




          draft saved


          draft discarded














          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3080062%2fexplain-the-rules-of-inference-used-to-obtain-each-conclusion-from-the-premises%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown





















































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown

































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown







          -

          Popular posts from this blog

          Mario Kart Wii

          Image
          Please consider supporting The Cutting Room Floor on Patreon. Thanks for all your support! Mario Kart Wii From The Cutting Room Floor Jump to: navigation, search Mario Kart Wii Developer : Nintendo Publisher : Nintendo Platform : Wii Released in JP : April 10, 2008 Released in US : April 27, 2008 Released in EU : April 11, 2008 Released in AU : April 24, 2008 Released in KR : April 30, 2009 This game has unused animations. This game has unused areas. This game has unused code. This game has unused objects. This game has unused modes / minigames. This game has unused graphics. This game has unused models. This game has unused items. This game has unused music. This game has regional differences. This game has a notes page This game has a prerelease article Mario Kart Wii is the sixth game in the series (not counting Arcade editions), which intro...
          Read more

          The Binding of Isaac: Rebirth/Afterbirth

          Image
          Please consider supporting The Cutting Room Floor on Patreon. Thanks for all your support! The Binding of Isaac: Rebirth/Afterbirth From The Cutting Room Floor < The Binding of Isaac: Rebirth Jump to: navigation, search This is a sub-page of The Binding of Isaac: Rebirth . Afterbirth is the first expansion pack for Rebirth and features a variety of improvements. Contents 1 Unused Graphics 1.1 Old Man Keeper 1.2 Skinless Hush 1.3 Miscellaneous Unused Hush Sprites 1.4 Generosity achievement 1.5 Afterbirth+ Room Editor 1.6 Bearded Ultra Greed 1.7 Early Ultra Greed 1.8 Unused Brownie Expression 1.9 Frail's Spinning Head 1.10 Mom's Dead Hand Alt 2 Unused Audio 2.1 Unused Dead Womb Layer 2.2 Unused Hush Battle Outro 2.3 The Stain Grunt Unused Graphics Old Man Keeper Image file: gfxuimain me...
          Read more

          What does “Dominus providebit” mean?

          Image
          5 Does "Dominus providebit" mean "The Lord will provide" or "The Lord provides"? I once had a bit of an argument with a guy who studied Latin over that. It's an inscription that appears on the rim of some old Swiss coins that I have. meaning latin-to-english-translation grammar-identification share | improve this question edited Jan 18 at 15:27 V2Blast 105 4 asked Jan 17 at 22:49 Donald K. Donald K. 26 1 ...
          Read more