Is it possible to calculate the logical expression A ^ B v C?












0












$begingroup$


In my theory notes, logical AND $land$ and logical OR $lor$ are equivalent in precedence. So then is the expression $A land B lor C$ valid, i.e. can I compute it, without parenthesis?










share|cite|improve this question











$endgroup$












  • $begingroup$
    The two ways of parsing it are certainly not equivalent. You should note that a more common convention is that it's $(Aland B)lor C$.
    $endgroup$
    – David C. Ullrich
    Jan 26 at 17:45










  • $begingroup$
    In our situation its explicitly not the convention.
    $endgroup$
    – TMOTTM
    Jan 30 at 10:48
















0












$begingroup$


In my theory notes, logical AND $land$ and logical OR $lor$ are equivalent in precedence. So then is the expression $A land B lor C$ valid, i.e. can I compute it, without parenthesis?










share|cite|improve this question











$endgroup$












  • $begingroup$
    The two ways of parsing it are certainly not equivalent. You should note that a more common convention is that it's $(Aland B)lor C$.
    $endgroup$
    – David C. Ullrich
    Jan 26 at 17:45










  • $begingroup$
    In our situation its explicitly not the convention.
    $endgroup$
    – TMOTTM
    Jan 30 at 10:48














0












0








0





$begingroup$


In my theory notes, logical AND $land$ and logical OR $lor$ are equivalent in precedence. So then is the expression $A land B lor C$ valid, i.e. can I compute it, without parenthesis?










share|cite|improve this question











$endgroup$




In my theory notes, logical AND $land$ and logical OR $lor$ are equivalent in precedence. So then is the expression $A land B lor C$ valid, i.e. can I compute it, without parenthesis?







logic






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 26 at 16:22









Mauro ALLEGRANZA

67.4k449115




67.4k449115










asked Jan 26 at 16:07









TMOTTMTMOTTM

1254




1254












  • $begingroup$
    The two ways of parsing it are certainly not equivalent. You should note that a more common convention is that it's $(Aland B)lor C$.
    $endgroup$
    – David C. Ullrich
    Jan 26 at 17:45










  • $begingroup$
    In our situation its explicitly not the convention.
    $endgroup$
    – TMOTTM
    Jan 30 at 10:48


















  • $begingroup$
    The two ways of parsing it are certainly not equivalent. You should note that a more common convention is that it's $(Aland B)lor C$.
    $endgroup$
    – David C. Ullrich
    Jan 26 at 17:45










  • $begingroup$
    In our situation its explicitly not the convention.
    $endgroup$
    – TMOTTM
    Jan 30 at 10:48
















$begingroup$
The two ways of parsing it are certainly not equivalent. You should note that a more common convention is that it's $(Aland B)lor C$.
$endgroup$
– David C. Ullrich
Jan 26 at 17:45




$begingroup$
The two ways of parsing it are certainly not equivalent. You should note that a more common convention is that it's $(Aland B)lor C$.
$endgroup$
– David C. Ullrich
Jan 26 at 17:45












$begingroup$
In our situation its explicitly not the convention.
$endgroup$
– TMOTTM
Jan 30 at 10:48




$begingroup$
In our situation its explicitly not the convention.
$endgroup$
– TMOTTM
Jan 30 at 10:48










2 Answers
2






active

oldest

votes


















1












$begingroup$

No, its not. Consider $A$ false and $B,C$ true. Then $fwedge (tvee t) = f$ and $(fwedge t)vee t = t$.






share|cite|improve this answer









$endgroup$





















    0












    $begingroup$

    No, without parentheses or a convention about which connective is the stronger connective, the expression is ambiguous, since $(A wedge B) vee C$ and $A wedge (B vee C)$ are not equivalent.






    share|cite|improve this answer









    $endgroup$













    • $begingroup$
      As I was thinking. In fact our convention is that they are of same connectivity.
      $endgroup$
      – TMOTTM
      Jan 26 at 16:10










    • $begingroup$
      Right, there convention is that they are equally strong: proofwiki.org/wiki/Definition:Binding_Priority.
      $endgroup$
      – kccu
      Jan 26 at 16:14











    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%2f3088420%2fis-it-possible-to-calculate-the-logical-expression-a-b-v-c%23new-answer', 'question_page');
    }
    );

    Post as a guest















    Required, but never shown

























    2 Answers
    2






    active

    oldest

    votes








    2 Answers
    2






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    1












    $begingroup$

    No, its not. Consider $A$ false and $B,C$ true. Then $fwedge (tvee t) = f$ and $(fwedge t)vee t = t$.






    share|cite|improve this answer









    $endgroup$


















      1












      $begingroup$

      No, its not. Consider $A$ false and $B,C$ true. Then $fwedge (tvee t) = f$ and $(fwedge t)vee t = t$.






      share|cite|improve this answer









      $endgroup$
















        1












        1








        1





        $begingroup$

        No, its not. Consider $A$ false and $B,C$ true. Then $fwedge (tvee t) = f$ and $(fwedge t)vee t = t$.






        share|cite|improve this answer









        $endgroup$



        No, its not. Consider $A$ false and $B,C$ true. Then $fwedge (tvee t) = f$ and $(fwedge t)vee t = t$.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Jan 26 at 16:11









        WuestenfuxWuestenfux

        5,2931513




        5,2931513























            0












            $begingroup$

            No, without parentheses or a convention about which connective is the stronger connective, the expression is ambiguous, since $(A wedge B) vee C$ and $A wedge (B vee C)$ are not equivalent.






            share|cite|improve this answer









            $endgroup$













            • $begingroup$
              As I was thinking. In fact our convention is that they are of same connectivity.
              $endgroup$
              – TMOTTM
              Jan 26 at 16:10










            • $begingroup$
              Right, there convention is that they are equally strong: proofwiki.org/wiki/Definition:Binding_Priority.
              $endgroup$
              – kccu
              Jan 26 at 16:14
















            0












            $begingroup$

            No, without parentheses or a convention about which connective is the stronger connective, the expression is ambiguous, since $(A wedge B) vee C$ and $A wedge (B vee C)$ are not equivalent.






            share|cite|improve this answer









            $endgroup$













            • $begingroup$
              As I was thinking. In fact our convention is that they are of same connectivity.
              $endgroup$
              – TMOTTM
              Jan 26 at 16:10










            • $begingroup$
              Right, there convention is that they are equally strong: proofwiki.org/wiki/Definition:Binding_Priority.
              $endgroup$
              – kccu
              Jan 26 at 16:14














            0












            0








            0





            $begingroup$

            No, without parentheses or a convention about which connective is the stronger connective, the expression is ambiguous, since $(A wedge B) vee C$ and $A wedge (B vee C)$ are not equivalent.






            share|cite|improve this answer









            $endgroup$



            No, without parentheses or a convention about which connective is the stronger connective, the expression is ambiguous, since $(A wedge B) vee C$ and $A wedge (B vee C)$ are not equivalent.







            share|cite|improve this answer












            share|cite|improve this answer



            share|cite|improve this answer










            answered Jan 26 at 16:08









            kccukccu

            10.6k11229




            10.6k11229












            • $begingroup$
              As I was thinking. In fact our convention is that they are of same connectivity.
              $endgroup$
              – TMOTTM
              Jan 26 at 16:10










            • $begingroup$
              Right, there convention is that they are equally strong: proofwiki.org/wiki/Definition:Binding_Priority.
              $endgroup$
              – kccu
              Jan 26 at 16:14


















            • $begingroup$
              As I was thinking. In fact our convention is that they are of same connectivity.
              $endgroup$
              – TMOTTM
              Jan 26 at 16:10










            • $begingroup$
              Right, there convention is that they are equally strong: proofwiki.org/wiki/Definition:Binding_Priority.
              $endgroup$
              – kccu
              Jan 26 at 16:14
















            $begingroup$
            As I was thinking. In fact our convention is that they are of same connectivity.
            $endgroup$
            – TMOTTM
            Jan 26 at 16:10




            $begingroup$
            As I was thinking. In fact our convention is that they are of same connectivity.
            $endgroup$
            – TMOTTM
            Jan 26 at 16:10












            $begingroup$
            Right, there convention is that they are equally strong: proofwiki.org/wiki/Definition:Binding_Priority.
            $endgroup$
            – kccu
            Jan 26 at 16:14




            $begingroup$
            Right, there convention is that they are equally strong: proofwiki.org/wiki/Definition:Binding_Priority.
            $endgroup$
            – kccu
            Jan 26 at 16:14


















            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%2f3088420%2fis-it-possible-to-calculate-the-logical-expression-a-b-v-c%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

            Can a sorcerer learn a 5th-level spell early by creating spell slots using the Font of Magic feature?

            ts Property 'filter' does not exist on type '{}'

            mat-slide-toggle shouldn't change it's state when I click cancel in confirmation window