Help with logical equivalence/proving not a contradiction












1












$begingroup$


The question is this:



Demonstrate using logical equivalences that $(p → q) ∧ (p → ¬q)$ is not
a contradiction. Identify all logical equivalences by name.



So far, I have



$(p → q) land (p → ¬q)$



a. $(¬plor q) land (¬plor¬q)$



b. $¬(¬plor q) lor(¬(¬plor¬q)$



c. $( pland¬q) lor (p lor q)$



I can't figure out where to go from here. Any help would be appreciated.






discrete-mathematics logic propositional-calculus







share|cite|improve this question











$endgroup$

















    1












    $begingroup$


    The question is this:



    Demonstrate using logical equivalences that $(p → q) ∧ (p → ¬q)$ is not
    a contradiction. Identify all logical equivalences by name.



    So far, I have



    $(p → q) land (p → ¬q)$



    a. $(¬plor q) land (¬plor¬q)$



    b. $¬(¬plor q) lor(¬(¬plor¬q)$



    c. $( pland¬q) lor (p lor q)$



    I can't figure out where to go from here. Any help would be appreciated.






    discrete-mathematics logic propositional-calculus







    share|cite|improve this question











    $endgroup$















      1












      1








      1


      1



      $begingroup$


      The question is this:



      Demonstrate using logical equivalences that $(p → q) ∧ (p → ¬q)$ is not
      a contradiction. Identify all logical equivalences by name.



      So far, I have



      $(p → q) land (p → ¬q)$



      a. $(¬plor q) land (¬plor¬q)$



      b. $¬(¬plor q) lor(¬(¬plor¬q)$



      c. $( pland¬q) lor (p lor q)$



      I can't figure out where to go from here. Any help would be appreciated.






      discrete-mathematics logic propositional-calculus







      share|cite|improve this question











      $endgroup$




      The question is this:



      Demonstrate using logical equivalences that $(p → q) ∧ (p → ¬q)$ is not
      a contradiction. Identify all logical equivalences by name.



      So far, I have



      $(p → q) land (p → ¬q)$



      a. $(¬plor q) land (¬plor¬q)$



      b. $¬(¬plor q) lor(¬(¬plor¬q)$



      c. $( pland¬q) lor (p lor q)$



      I can't figure out where to go from here. Any help would be appreciated.






      discrete-mathematics logic propositional-calculus




      discrete-mathematics logic propositional-calculus






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Jan 14 at 9:58









      Mostafa Ayaz

      18.1k31040




      18.1k31040










      asked Jan 14 at 1:05









      Keith ReynoldsKeith Reynolds

      62




      62






















          4 Answers
          4






          active

          oldest

          votes


















          1












          $begingroup$

          It is not a contradiction becauss it is true when p is false.

          Truth tables show this quickly.

          a. perhaps is the best for showing that.

          a. is equivalent to: (not p) or (q and not q);

          which in turn is equivalent to; not p.

          So there's the answer - to show the orginal statement is

          equivalent to: not p.



          Little surprise, as the orginal statement is basically

          proof by contradiction.






          share|cite|improve this answer









          $endgroup$





















            1












            $begingroup$

            From :



            a) $(¬p lor q) land (¬p lor ¬q)$



            we have to apply the Distributive law to get :



            b) $lnot p lor (q land lnot q)$.



            Now we use the equivalence (often called : Negation law) : $(alpha land lnot alpha) equiv text F$ to get :



            c) $lnot p lor text F$.



            Finally, we use the equivalence (often called : Identity law) : $alpha lor text F equiv alpha$ to conclude with :




            d) $lnot p$




            that is not a contradiction.






            share|cite|improve this answer











            $endgroup$





















              1












              $begingroup$

              An easy way to say that is: since $p$ concludes $q$ and $lnot q$, if it holds true then two controversy statements hold true which is a contradiction, but if $lnot p$ is true, the contradiction is removed.



              In a more formal way $$(pto q)land (pto lnot q)iff pto (qland lnot q)iff pto 0iff lnot pto 1$$which means that $lnot p$ is true.






              share|cite|improve this answer











              $endgroup$













              • $begingroup$
                Are you missing a $p$ here?
                $endgroup$
                – Max Herrmann
                Jan 14 at 11:19










              • $begingroup$
                Where do you mean I'm missing?
                $endgroup$
                – Mostafa Ayaz
                Jan 14 at 14:35










              • $begingroup$
                (...), but if $neg$ is true, (...)
                $endgroup$
                – Max Herrmann
                Jan 14 at 15:37










              • $begingroup$
                Thank you. Nice look through my answer :)
                $endgroup$
                – Mostafa Ayaz
                Jan 14 at 15:40



















              0












              $begingroup$

              Just an add-on to William Elliot's answer:



              $$
              begin{array}{c|c|c|c|c}
              p & q & p rightarrow q & p rightarrow neg q & (p rightarrow q) wedge (p rightarrow neg q) \ hline
              0 & 0 & 1 & 1 & 1 \
              0 & 1 & 1 & 1 & 1 \
              1 & 0 & 0 & 1 & 0 \
              1 & 1 & 1 & 0 & 0
              end{array}
              $$






              share|cite|improve this answer









              $endgroup$














                Your Answer








                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%2f3072740%2fhelp-with-logical-equivalence-proving-not-a-contradiction%23new-answer', 'question_page');
                }
                );

                Post as a guest















                Required, but never shown

























                4 Answers
                4






                active

                oldest

                votes








                4 Answers
                4






                active

                oldest

                votes









                active

                oldest

                votes






                active

                oldest

                votes









                1












                $begingroup$

                It is not a contradiction becauss it is true when p is false.

                Truth tables show this quickly.

                a. perhaps is the best for showing that.

                a. is equivalent to: (not p) or (q and not q);

                which in turn is equivalent to; not p.

                So there's the answer - to show the orginal statement is

                equivalent to: not p.



                Little surprise, as the orginal statement is basically

                proof by contradiction.






                share|cite|improve this answer









                $endgroup$


















                  1












                  $begingroup$

                  It is not a contradiction becauss it is true when p is false.

                  Truth tables show this quickly.

                  a. perhaps is the best for showing that.

                  a. is equivalent to: (not p) or (q and not q);

                  which in turn is equivalent to; not p.

                  So there's the answer - to show the orginal statement is

                  equivalent to: not p.



                  Little surprise, as the orginal statement is basically

                  proof by contradiction.






                  share|cite|improve this answer









                  $endgroup$
















                    1












                    1








                    1





                    $begingroup$

                    It is not a contradiction becauss it is true when p is false.

                    Truth tables show this quickly.

                    a. perhaps is the best for showing that.

                    a. is equivalent to: (not p) or (q and not q);

                    which in turn is equivalent to; not p.

                    So there's the answer - to show the orginal statement is

                    equivalent to: not p.



                    Little surprise, as the orginal statement is basically

                    proof by contradiction.






                    share|cite|improve this answer









                    $endgroup$



                    It is not a contradiction becauss it is true when p is false.

                    Truth tables show this quickly.

                    a. perhaps is the best for showing that.

                    a. is equivalent to: (not p) or (q and not q);

                    which in turn is equivalent to; not p.

                    So there's the answer - to show the orginal statement is

                    equivalent to: not p.



                    Little surprise, as the orginal statement is basically

                    proof by contradiction.







                    share|cite|improve this answer












                    share|cite|improve this answer



                    share|cite|improve this answer










                    answered Jan 14 at 3:14









                    William ElliotWilliam Elliot

                    9,2142820




                    9,2142820























                        1












                        $begingroup$

                        From :



                        a) $(¬p lor q) land (¬p lor ¬q)$



                        we have to apply the Distributive law to get :



                        b) $lnot p lor (q land lnot q)$.



                        Now we use the equivalence (often called : Negation law) : $(alpha land lnot alpha) equiv text F$ to get :



                        c) $lnot p lor text F$.



                        Finally, we use the equivalence (often called : Identity law) : $alpha lor text F equiv alpha$ to conclude with :




                        d) $lnot p$




                        that is not a contradiction.






                        share|cite|improve this answer











                        $endgroup$


















                          1












                          $begingroup$

                          From :



                          a) $(¬p lor q) land (¬p lor ¬q)$



                          we have to apply the Distributive law to get :



                          b) $lnot p lor (q land lnot q)$.



                          Now we use the equivalence (often called : Negation law) : $(alpha land lnot alpha) equiv text F$ to get :



                          c) $lnot p lor text F$.



                          Finally, we use the equivalence (often called : Identity law) : $alpha lor text F equiv alpha$ to conclude with :




                          d) $lnot p$




                          that is not a contradiction.






                          share|cite|improve this answer











                          $endgroup$
















                            1












                            1








                            1





                            $begingroup$

                            From :



                            a) $(¬p lor q) land (¬p lor ¬q)$



                            we have to apply the Distributive law to get :



                            b) $lnot p lor (q land lnot q)$.



                            Now we use the equivalence (often called : Negation law) : $(alpha land lnot alpha) equiv text F$ to get :



                            c) $lnot p lor text F$.



                            Finally, we use the equivalence (often called : Identity law) : $alpha lor text F equiv alpha$ to conclude with :




                            d) $lnot p$




                            that is not a contradiction.






                            share|cite|improve this answer











                            $endgroup$



                            From :



                            a) $(¬p lor q) land (¬p lor ¬q)$



                            we have to apply the Distributive law to get :



                            b) $lnot p lor (q land lnot q)$.



                            Now we use the equivalence (often called : Negation law) : $(alpha land lnot alpha) equiv text F$ to get :



                            c) $lnot p lor text F$.



                            Finally, we use the equivalence (often called : Identity law) : $alpha lor text F equiv alpha$ to conclude with :




                            d) $lnot p$




                            that is not a contradiction.







                            share|cite|improve this answer














                            share|cite|improve this answer



                            share|cite|improve this answer








                            edited Jan 14 at 8:51

























                            answered Jan 14 at 7:10









                            Mauro ALLEGRANZAMauro ALLEGRANZA

                            68.3k449117




                            68.3k449117























                                1












                                $begingroup$

                                An easy way to say that is: since $p$ concludes $q$ and $lnot q$, if it holds true then two controversy statements hold true which is a contradiction, but if $lnot p$ is true, the contradiction is removed.



                                In a more formal way $$(pto q)land (pto lnot q)iff pto (qland lnot q)iff pto 0iff lnot pto 1$$which means that $lnot p$ is true.






                                share|cite|improve this answer











                                $endgroup$













                                • $begingroup$
                                  Are you missing a $p$ here?
                                  $endgroup$
                                  – Max Herrmann
                                  Jan 14 at 11:19










                                • $begingroup$
                                  Where do you mean I'm missing?
                                  $endgroup$
                                  – Mostafa Ayaz
                                  Jan 14 at 14:35










                                • $begingroup$
                                  (...), but if $neg$ is true, (...)
                                  $endgroup$
                                  – Max Herrmann
                                  Jan 14 at 15:37










                                • $begingroup$
                                  Thank you. Nice look through my answer :)
                                  $endgroup$
                                  – Mostafa Ayaz
                                  Jan 14 at 15:40
















                                1












                                $begingroup$

                                An easy way to say that is: since $p$ concludes $q$ and $lnot q$, if it holds true then two controversy statements hold true which is a contradiction, but if $lnot p$ is true, the contradiction is removed.



                                In a more formal way $$(pto q)land (pto lnot q)iff pto (qland lnot q)iff pto 0iff lnot pto 1$$which means that $lnot p$ is true.






                                share|cite|improve this answer











                                $endgroup$













                                • $begingroup$
                                  Are you missing a $p$ here?
                                  $endgroup$
                                  – Max Herrmann
                                  Jan 14 at 11:19










                                • $begingroup$
                                  Where do you mean I'm missing?
                                  $endgroup$
                                  – Mostafa Ayaz
                                  Jan 14 at 14:35










                                • $begingroup$
                                  (...), but if $neg$ is true, (...)
                                  $endgroup$
                                  – Max Herrmann
                                  Jan 14 at 15:37










                                • $begingroup$
                                  Thank you. Nice look through my answer :)
                                  $endgroup$
                                  – Mostafa Ayaz
                                  Jan 14 at 15:40














                                1












                                1








                                1





                                $begingroup$

                                An easy way to say that is: since $p$ concludes $q$ and $lnot q$, if it holds true then two controversy statements hold true which is a contradiction, but if $lnot p$ is true, the contradiction is removed.



                                In a more formal way $$(pto q)land (pto lnot q)iff pto (qland lnot q)iff pto 0iff lnot pto 1$$which means that $lnot p$ is true.






                                share|cite|improve this answer











                                $endgroup$



                                An easy way to say that is: since $p$ concludes $q$ and $lnot q$, if it holds true then two controversy statements hold true which is a contradiction, but if $lnot p$ is true, the contradiction is removed.



                                In a more formal way $$(pto q)land (pto lnot q)iff pto (qland lnot q)iff pto 0iff lnot pto 1$$which means that $lnot p$ is true.







                                share|cite|improve this answer














                                share|cite|improve this answer



                                share|cite|improve this answer








                                edited Jan 14 at 15:39

























                                answered Jan 14 at 10:03









                                Mostafa AyazMostafa Ayaz

                                18.1k31040




                                18.1k31040












                                • $begingroup$
                                  Are you missing a $p$ here?
                                  $endgroup$
                                  – Max Herrmann
                                  Jan 14 at 11:19










                                • $begingroup$
                                  Where do you mean I'm missing?
                                  $endgroup$
                                  – Mostafa Ayaz
                                  Jan 14 at 14:35










                                • $begingroup$
                                  (...), but if $neg$ is true, (...)
                                  $endgroup$
                                  – Max Herrmann
                                  Jan 14 at 15:37










                                • $begingroup$
                                  Thank you. Nice look through my answer :)
                                  $endgroup$
                                  – Mostafa Ayaz
                                  Jan 14 at 15:40


















                                • $begingroup$
                                  Are you missing a $p$ here?
                                  $endgroup$
                                  – Max Herrmann
                                  Jan 14 at 11:19










                                • $begingroup$
                                  Where do you mean I'm missing?
                                  $endgroup$
                                  – Mostafa Ayaz
                                  Jan 14 at 14:35










                                • $begingroup$
                                  (...), but if $neg$ is true, (...)
                                  $endgroup$
                                  – Max Herrmann
                                  Jan 14 at 15:37










                                • $begingroup$
                                  Thank you. Nice look through my answer :)
                                  $endgroup$
                                  – Mostafa Ayaz
                                  Jan 14 at 15:40
















                                $begingroup$
                                Are you missing a $p$ here?
                                $endgroup$
                                – Max Herrmann
                                Jan 14 at 11:19




                                $begingroup$
                                Are you missing a $p$ here?
                                $endgroup$
                                – Max Herrmann
                                Jan 14 at 11:19












                                $begingroup$
                                Where do you mean I'm missing?
                                $endgroup$
                                – Mostafa Ayaz
                                Jan 14 at 14:35




                                $begingroup$
                                Where do you mean I'm missing?
                                $endgroup$
                                – Mostafa Ayaz
                                Jan 14 at 14:35












                                $begingroup$
                                (...), but if $neg$ is true, (...)
                                $endgroup$
                                – Max Herrmann
                                Jan 14 at 15:37




                                $begingroup$
                                (...), but if $neg$ is true, (...)
                                $endgroup$
                                – Max Herrmann
                                Jan 14 at 15:37












                                $begingroup$
                                Thank you. Nice look through my answer :)
                                $endgroup$
                                – Mostafa Ayaz
                                Jan 14 at 15:40




                                $begingroup$
                                Thank you. Nice look through my answer :)
                                $endgroup$
                                – Mostafa Ayaz
                                Jan 14 at 15:40











                                0












                                $begingroup$

                                Just an add-on to William Elliot's answer:



                                $$
                                begin{array}{c|c|c|c|c}
                                p & q & p rightarrow q & p rightarrow neg q & (p rightarrow q) wedge (p rightarrow neg q) \ hline
                                0 & 0 & 1 & 1 & 1 \
                                0 & 1 & 1 & 1 & 1 \
                                1 & 0 & 0 & 1 & 0 \
                                1 & 1 & 1 & 0 & 0
                                end{array}
                                $$






                                share|cite|improve this answer









                                $endgroup$


















                                  0












                                  $begingroup$

                                  Just an add-on to William Elliot's answer:



                                  $$
                                  begin{array}{c|c|c|c|c}
                                  p & q & p rightarrow q & p rightarrow neg q & (p rightarrow q) wedge (p rightarrow neg q) \ hline
                                  0 & 0 & 1 & 1 & 1 \
                                  0 & 1 & 1 & 1 & 1 \
                                  1 & 0 & 0 & 1 & 0 \
                                  1 & 1 & 1 & 0 & 0
                                  end{array}
                                  $$






                                  share|cite|improve this answer









                                  $endgroup$
















                                    0












                                    0








                                    0





                                    $begingroup$

                                    Just an add-on to William Elliot's answer:



                                    $$
                                    begin{array}{c|c|c|c|c}
                                    p & q & p rightarrow q & p rightarrow neg q & (p rightarrow q) wedge (p rightarrow neg q) \ hline
                                    0 & 0 & 1 & 1 & 1 \
                                    0 & 1 & 1 & 1 & 1 \
                                    1 & 0 & 0 & 1 & 0 \
                                    1 & 1 & 1 & 0 & 0
                                    end{array}
                                    $$






                                    share|cite|improve this answer









                                    $endgroup$



                                    Just an add-on to William Elliot's answer:



                                    $$
                                    begin{array}{c|c|c|c|c}
                                    p & q & p rightarrow q & p rightarrow neg q & (p rightarrow q) wedge (p rightarrow neg q) \ hline
                                    0 & 0 & 1 & 1 & 1 \
                                    0 & 1 & 1 & 1 & 1 \
                                    1 & 0 & 0 & 1 & 0 \
                                    1 & 1 & 1 & 0 & 0
                                    end{array}
                                    $$







                                    share|cite|improve this answer












                                    share|cite|improve this answer



                                    share|cite|improve this answer










                                    answered Jan 14 at 7:30









                                    Max HerrmannMax Herrmann

                                    724419




                                    724419






























                                        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%2f3072740%2fhelp-with-logical-equivalence-proving-not-a-contradiction%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

                                        Bressuire

                                        Image
                                        .mw-parser-output .infobox{border:1px solid #aaa;background-color:#f9f9f9;color:black;margin:.5em 0 .5em 1em;padding:.2em;float:right;clear:right;width:22em;text-align:left;font-size:88%;line-height:1.6em}.mw-parser-output .infobox td,.mw-parser-output .infobox th{vertical-align:top;padding:0 .2em}.mw-parser-output .infobox caption{font-size:larger}.mw-parser-output .infobox.bordered{border-collapse:collapse}.mw-parser-output .infobox.bordered td,.mw-parser-output .infobox.bordered th{border:1px solid #aaa}.mw-parser-output .infobox.bordered .borderless td,.mw-parser-output .infobox.bordered .borderless th{border:0}.mw-parser-output .infobox-showbutton .mw-collapsible-text{color:inherit}.mw-parser-output .infobox.bordered .mergedtoprow td,.mw-parser-output .infobox.bordered .mergedtoprow th{border:0;border-top:1px solid #aaa;border-right:1px solid #aaa}.mw-parser-output .infobox.bordered .mergedrow td,.mw-parser-output .infobox.bordered .mergedrow th{border:0;border-right:1px solid
                                        Read more

                                        Cabo Verde

                                        Image
                                          Nota: Cabo-verdiano redireciona para este artigo. Para a língua falada em Cabo Verde, veja crioulo cabo-verdiano. Para outros significados, veja Cabo Verde (desambiguação). Coordenadas: 14° 55' N 23° 31' O Cabo Verde República de Cabo Verde Bandeira Brasão de Armas Lema: Unidade, Trabalho, Progresso Hino nacional: Cântico da Liberdade Gentílico: cabo-verdiano [ 1 ] Capital Praia 14° 55' N 23° 31' O Cidade mais populosa Praia Língua oficial Português Governo República unitária semipresidencialista [ 2 ]  - Presidente Jorge Carlos Fonseca  - Primeiro-ministro Ulisses Correia e Silva História    - Descoberta 1460   - Independência 00 • de Portugal 5 de Julho de 1975   - Multipartidarismo 13 de Janeiro de 1990  Área    - Total 4 033 km² (146.º)  - Água (%) 0,08 População    - Estimativa para 2017 560 899 [ 3 ] hab. (173.º)
                                        Read more

                                        Gyllenstierna

                                        Image
                                        .mw-parser-output .infobox{border:1px solid #aaa;background-color:#f9f9f9;color:black;margin:.5em 0 .5em 1em;padding:.2em;float:right;clear:right;width:22em;text-align:left;font-size:88%;line-height:1.6em}.mw-parser-output .infobox td,.mw-parser-output .infobox th{vertical-align:top;padding:0 .2em}.mw-parser-output .infobox caption{font-size:larger}.mw-parser-output .infobox.bordered{border-collapse:collapse}.mw-parser-output .infobox.bordered td,.mw-parser-output .infobox.bordered th{border:1px solid #aaa}.mw-parser-output .infobox.bordered .borderless td,.mw-parser-output .infobox.bordered .borderless th{border:0}.mw-parser-output .infobox-showbutton .mw-collapsible-text{color:inherit}.mw-parser-output .infobox.bordered .mergedtoprow td,.mw-parser-output .infobox.bordered .mergedtoprow th{border:0;border-top:1px solid #aaa;border-right:1px solid #aaa}.mw-parser-output .infobox.bordered .mergedrow td,.mw-parser-output .infobox.bordered .mergedrow th{border:0;border-right:1px solid
                                        Read more