Discrete mathematics - logical equivalence?












2












$begingroup$


I'm asked to find a logical expression that is equivalent to the one listed in the question below, but I'm stumped as to what steps I would take next. If someone could show me step by step how to solve them and what rules would be used, I would really appreciate it.




  1. Using only the NOT and the AND operators, find an expression that is equivalent to ¬(a ∧ ¬b)↔𝑐


The furthest I got is (¬a∨b)↔c by using De Morgan's law, but I don't know how I can simplify it further than that. Someone told me the final answer is b ↔ c but I have no idea how they got there or if it's even correct?










share|cite|improve this question











$endgroup$












  • $begingroup$
    In part A) $bleftrightarrow c$ is incorrect. What if $a$ and $b$ are flase and $c$ is true?
    $endgroup$
    – saulspatz
    Jan 26 at 21:30










  • $begingroup$
    You want to remember that the biconditional can be broken up into two conditional statements with the AND: p $leftrightarrow$ q $equiv$ (p $rightarrow$q) $land$ (q $rightarrow$ p). Then you use the implication equivalence and keep going.
    $endgroup$
    – Joel Pereira
    Jan 26 at 21:39
















2












$begingroup$


I'm asked to find a logical expression that is equivalent to the one listed in the question below, but I'm stumped as to what steps I would take next. If someone could show me step by step how to solve them and what rules would be used, I would really appreciate it.




  1. Using only the NOT and the AND operators, find an expression that is equivalent to ¬(a ∧ ¬b)↔𝑐


The furthest I got is (¬a∨b)↔c by using De Morgan's law, but I don't know how I can simplify it further than that. Someone told me the final answer is b ↔ c but I have no idea how they got there or if it's even correct?










share|cite|improve this question











$endgroup$












  • $begingroup$
    In part A) $bleftrightarrow c$ is incorrect. What if $a$ and $b$ are flase and $c$ is true?
    $endgroup$
    – saulspatz
    Jan 26 at 21:30










  • $begingroup$
    You want to remember that the biconditional can be broken up into two conditional statements with the AND: p $leftrightarrow$ q $equiv$ (p $rightarrow$q) $land$ (q $rightarrow$ p). Then you use the implication equivalence and keep going.
    $endgroup$
    – Joel Pereira
    Jan 26 at 21:39














2












2








2





$begingroup$


I'm asked to find a logical expression that is equivalent to the one listed in the question below, but I'm stumped as to what steps I would take next. If someone could show me step by step how to solve them and what rules would be used, I would really appreciate it.




  1. Using only the NOT and the AND operators, find an expression that is equivalent to ¬(a ∧ ¬b)↔𝑐


The furthest I got is (¬a∨b)↔c by using De Morgan's law, but I don't know how I can simplify it further than that. Someone told me the final answer is b ↔ c but I have no idea how they got there or if it's even correct?










share|cite|improve this question











$endgroup$




I'm asked to find a logical expression that is equivalent to the one listed in the question below, but I'm stumped as to what steps I would take next. If someone could show me step by step how to solve them and what rules would be used, I would really appreciate it.




  1. Using only the NOT and the AND operators, find an expression that is equivalent to ¬(a ∧ ¬b)↔𝑐


The furthest I got is (¬a∨b)↔c by using De Morgan's law, but I don't know how I can simplify it further than that. Someone told me the final answer is b ↔ c but I have no idea how they got there or if it's even correct?







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 27 at 6:11









Misha Lavrov

47.8k657107




47.8k657107










asked Jan 26 at 20:33









BlackthornBlackthorn

316




316












  • $begingroup$
    In part A) $bleftrightarrow c$ is incorrect. What if $a$ and $b$ are flase and $c$ is true?
    $endgroup$
    – saulspatz
    Jan 26 at 21:30










  • $begingroup$
    You want to remember that the biconditional can be broken up into two conditional statements with the AND: p $leftrightarrow$ q $equiv$ (p $rightarrow$q) $land$ (q $rightarrow$ p). Then you use the implication equivalence and keep going.
    $endgroup$
    – Joel Pereira
    Jan 26 at 21:39


















  • $begingroup$
    In part A) $bleftrightarrow c$ is incorrect. What if $a$ and $b$ are flase and $c$ is true?
    $endgroup$
    – saulspatz
    Jan 26 at 21:30










  • $begingroup$
    You want to remember that the biconditional can be broken up into two conditional statements with the AND: p $leftrightarrow$ q $equiv$ (p $rightarrow$q) $land$ (q $rightarrow$ p). Then you use the implication equivalence and keep going.
    $endgroup$
    – Joel Pereira
    Jan 26 at 21:39
















$begingroup$
In part A) $bleftrightarrow c$ is incorrect. What if $a$ and $b$ are flase and $c$ is true?
$endgroup$
– saulspatz
Jan 26 at 21:30




$begingroup$
In part A) $bleftrightarrow c$ is incorrect. What if $a$ and $b$ are flase and $c$ is true?
$endgroup$
– saulspatz
Jan 26 at 21:30












$begingroup$
You want to remember that the biconditional can be broken up into two conditional statements with the AND: p $leftrightarrow$ q $equiv$ (p $rightarrow$q) $land$ (q $rightarrow$ p). Then you use the implication equivalence and keep going.
$endgroup$
– Joel Pereira
Jan 26 at 21:39




$begingroup$
You want to remember that the biconditional can be broken up into two conditional statements with the AND: p $leftrightarrow$ q $equiv$ (p $rightarrow$q) $land$ (q $rightarrow$ p). Then you use the implication equivalence and keep going.
$endgroup$
– Joel Pereira
Jan 26 at 21:39










1 Answer
1






active

oldest

votes


















1












$begingroup$

Since $A leftrightarrow B$ is logically equivalent to $(lnot A lor B) land (lnot B lor A)$, we have:
begin{align}
lnot (a land lnot b) leftrightarrow c &equiv ( lnot lnot (a land lnot b) lor c) land (lnot c lor lnot (a land lnot b)) \
&equiv ((a land lnot b) lor c) land (lnot c lor lnot (a land lnot b)) \
&equiv ((a land lnot b) lor c) land lnot (c land a land lnot b) \
&equiv ((a lor c) land (lnot b lor c)) land lnot (c land a land lnot b) \
&equiv (lnot (lnot a land lnot c) land lnot (lnot lnot b land lnot c)) land lnot (c land a land lnot b) \
&equiv (lnot (lnot a land lnot c) land lnot (b land lnot c)) land lnot (c land a land lnot b) \
end{align}






share|cite|improve this answer









$endgroup$













    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%2f3088727%2fdiscrete-mathematics-logical-equivalence%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$

    Since $A leftrightarrow B$ is logically equivalent to $(lnot A lor B) land (lnot B lor A)$, we have:
    begin{align}
    lnot (a land lnot b) leftrightarrow c &equiv ( lnot lnot (a land lnot b) lor c) land (lnot c lor lnot (a land lnot b)) \
    &equiv ((a land lnot b) lor c) land (lnot c lor lnot (a land lnot b)) \
    &equiv ((a land lnot b) lor c) land lnot (c land a land lnot b) \
    &equiv ((a lor c) land (lnot b lor c)) land lnot (c land a land lnot b) \
    &equiv (lnot (lnot a land lnot c) land lnot (lnot lnot b land lnot c)) land lnot (c land a land lnot b) \
    &equiv (lnot (lnot a land lnot c) land lnot (b land lnot c)) land lnot (c land a land lnot b) \
    end{align}






    share|cite|improve this answer









    $endgroup$


















      1












      $begingroup$

      Since $A leftrightarrow B$ is logically equivalent to $(lnot A lor B) land (lnot B lor A)$, we have:
      begin{align}
      lnot (a land lnot b) leftrightarrow c &equiv ( lnot lnot (a land lnot b) lor c) land (lnot c lor lnot (a land lnot b)) \
      &equiv ((a land lnot b) lor c) land (lnot c lor lnot (a land lnot b)) \
      &equiv ((a land lnot b) lor c) land lnot (c land a land lnot b) \
      &equiv ((a lor c) land (lnot b lor c)) land lnot (c land a land lnot b) \
      &equiv (lnot (lnot a land lnot c) land lnot (lnot lnot b land lnot c)) land lnot (c land a land lnot b) \
      &equiv (lnot (lnot a land lnot c) land lnot (b land lnot c)) land lnot (c land a land lnot b) \
      end{align}






      share|cite|improve this answer









      $endgroup$
















        1












        1








        1





        $begingroup$

        Since $A leftrightarrow B$ is logically equivalent to $(lnot A lor B) land (lnot B lor A)$, we have:
        begin{align}
        lnot (a land lnot b) leftrightarrow c &equiv ( lnot lnot (a land lnot b) lor c) land (lnot c lor lnot (a land lnot b)) \
        &equiv ((a land lnot b) lor c) land (lnot c lor lnot (a land lnot b)) \
        &equiv ((a land lnot b) lor c) land lnot (c land a land lnot b) \
        &equiv ((a lor c) land (lnot b lor c)) land lnot (c land a land lnot b) \
        &equiv (lnot (lnot a land lnot c) land lnot (lnot lnot b land lnot c)) land lnot (c land a land lnot b) \
        &equiv (lnot (lnot a land lnot c) land lnot (b land lnot c)) land lnot (c land a land lnot b) \
        end{align}






        share|cite|improve this answer









        $endgroup$



        Since $A leftrightarrow B$ is logically equivalent to $(lnot A lor B) land (lnot B lor A)$, we have:
        begin{align}
        lnot (a land lnot b) leftrightarrow c &equiv ( lnot lnot (a land lnot b) lor c) land (lnot c lor lnot (a land lnot b)) \
        &equiv ((a land lnot b) lor c) land (lnot c lor lnot (a land lnot b)) \
        &equiv ((a land lnot b) lor c) land lnot (c land a land lnot b) \
        &equiv ((a lor c) land (lnot b lor c)) land lnot (c land a land lnot b) \
        &equiv (lnot (lnot a land lnot c) land lnot (lnot lnot b land lnot c)) land lnot (c land a land lnot b) \
        &equiv (lnot (lnot a land lnot c) land lnot (b land lnot c)) land lnot (c land a land lnot b) \
        end{align}







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Jan 26 at 23:12









        Ruggiero RilieviRuggiero Rilievi

        179112




        179112






























            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%2f3088727%2fdiscrete-mathematics-logical-equivalence%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

            MongoDB - Not Authorized To Execute Command

            How to fix TextFormField cause rebuild widget in Flutter

            in spring boot 2.1 many test slices are not allowed anymore due to multiple @BootstrapWith