How to write “There is at least 2 Cars are not the same Colour” in logic












0












$begingroup$


I would like to know how to write “At least 2 Cars are not the same Colour” in logic.



I know that "at least two cars" can be defined as ∃x(C(x)∧∃y(C(x)∧y≠x)). is that right? What's next then



Also, how to write "himself/herself" in logic? For example "nobody is better than himself/herself".



Appreciate for any help.










share|cite|improve this question











$endgroup$

















    0












    $begingroup$


    I would like to know how to write “At least 2 Cars are not the same Colour” in logic.



    I know that "at least two cars" can be defined as ∃x(C(x)∧∃y(C(x)∧y≠x)). is that right? What's next then



    Also, how to write "himself/herself" in logic? For example "nobody is better than himself/herself".



    Appreciate for any help.










    share|cite|improve this question











    $endgroup$















      0












      0








      0





      $begingroup$


      I would like to know how to write “At least 2 Cars are not the same Colour” in logic.



      I know that "at least two cars" can be defined as ∃x(C(x)∧∃y(C(x)∧y≠x)). is that right? What's next then



      Also, how to write "himself/herself" in logic? For example "nobody is better than himself/herself".



      Appreciate for any help.










      share|cite|improve this question











      $endgroup$




      I would like to know how to write “At least 2 Cars are not the same Colour” in logic.



      I know that "at least two cars" can be defined as ∃x(C(x)∧∃y(C(x)∧y≠x)). is that right? What's next then



      Also, how to write "himself/herself" in logic? For example "nobody is better than himself/herself".



      Appreciate for any help.







      logic predicate-logic logic-translation






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Dec 10 '18 at 18:18









      Bram28

      61.6k44793




      61.6k44793










      asked Dec 10 '18 at 11:02









      BaivarasBaivaras

      6




      6






















          1 Answer
          1






          active

          oldest

          votes


















          2












          $begingroup$

          Suppose $C(x)$ denotes the colour $C$ of a car $x$. To translate "At least 2 cars are not the same colour" we could say "there are cars $x$ and $y$ that are not identical such that $C(x) ne C(y)$". In formal logic notation this is:



          $exists space x,y space left( (space x ne y) land (space C(x) ne C(y)) right)$



          or, without using $ne$, as follows:



          $exists space x,y space left( lnot (space x = y) land lnot(space C(x) = C(y)) right)$



          In fact, the qualification $x ne y$ is redundant, since $C(x) ne C(y) Rightarrow x ne y$. So we can simplify this to:



          $exists space x,y space left(lnot(C(x) = C(y)) right)$



          For the second part, if $B(x,y)$ denotes "$x$ is better than $y$" then "nobody is better than himself/herself" can be expressed as "there is no person $x$ such that $B(x,x)$". In formal logic notation this is:



          $nexists space x space B(x,x)$



          or



          $forall space x space lnot B(x,x)$






          share|cite|improve this answer











          $endgroup$













          • $begingroup$
            The answer is a bit misleading since you do not use boolean constants, but use colon and comma. This is at most just a suggestion how to write a correct formula, or an abbreviation of such. Yet not a formal logic notation.
            $endgroup$
            – Mad Hatter
            Dec 10 '18 at 12:18






          • 1




            $begingroup$
            @MadHatter I have changed the notation.
            $endgroup$
            – gandalf61
            Dec 10 '18 at 13:50











          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%2f3033776%2fhow-to-write-there-is-at-least-2-cars-are-not-the-same-colour-in-logic%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









          2












          $begingroup$

          Suppose $C(x)$ denotes the colour $C$ of a car $x$. To translate "At least 2 cars are not the same colour" we could say "there are cars $x$ and $y$ that are not identical such that $C(x) ne C(y)$". In formal logic notation this is:



          $exists space x,y space left( (space x ne y) land (space C(x) ne C(y)) right)$



          or, without using $ne$, as follows:



          $exists space x,y space left( lnot (space x = y) land lnot(space C(x) = C(y)) right)$



          In fact, the qualification $x ne y$ is redundant, since $C(x) ne C(y) Rightarrow x ne y$. So we can simplify this to:



          $exists space x,y space left(lnot(C(x) = C(y)) right)$



          For the second part, if $B(x,y)$ denotes "$x$ is better than $y$" then "nobody is better than himself/herself" can be expressed as "there is no person $x$ such that $B(x,x)$". In formal logic notation this is:



          $nexists space x space B(x,x)$



          or



          $forall space x space lnot B(x,x)$






          share|cite|improve this answer











          $endgroup$













          • $begingroup$
            The answer is a bit misleading since you do not use boolean constants, but use colon and comma. This is at most just a suggestion how to write a correct formula, or an abbreviation of such. Yet not a formal logic notation.
            $endgroup$
            – Mad Hatter
            Dec 10 '18 at 12:18






          • 1




            $begingroup$
            @MadHatter I have changed the notation.
            $endgroup$
            – gandalf61
            Dec 10 '18 at 13:50
















          2












          $begingroup$

          Suppose $C(x)$ denotes the colour $C$ of a car $x$. To translate "At least 2 cars are not the same colour" we could say "there are cars $x$ and $y$ that are not identical such that $C(x) ne C(y)$". In formal logic notation this is:



          $exists space x,y space left( (space x ne y) land (space C(x) ne C(y)) right)$



          or, without using $ne$, as follows:



          $exists space x,y space left( lnot (space x = y) land lnot(space C(x) = C(y)) right)$



          In fact, the qualification $x ne y$ is redundant, since $C(x) ne C(y) Rightarrow x ne y$. So we can simplify this to:



          $exists space x,y space left(lnot(C(x) = C(y)) right)$



          For the second part, if $B(x,y)$ denotes "$x$ is better than $y$" then "nobody is better than himself/herself" can be expressed as "there is no person $x$ such that $B(x,x)$". In formal logic notation this is:



          $nexists space x space B(x,x)$



          or



          $forall space x space lnot B(x,x)$






          share|cite|improve this answer











          $endgroup$













          • $begingroup$
            The answer is a bit misleading since you do not use boolean constants, but use colon and comma. This is at most just a suggestion how to write a correct formula, or an abbreviation of such. Yet not a formal logic notation.
            $endgroup$
            – Mad Hatter
            Dec 10 '18 at 12:18






          • 1




            $begingroup$
            @MadHatter I have changed the notation.
            $endgroup$
            – gandalf61
            Dec 10 '18 at 13:50














          2












          2








          2





          $begingroup$

          Suppose $C(x)$ denotes the colour $C$ of a car $x$. To translate "At least 2 cars are not the same colour" we could say "there are cars $x$ and $y$ that are not identical such that $C(x) ne C(y)$". In formal logic notation this is:



          $exists space x,y space left( (space x ne y) land (space C(x) ne C(y)) right)$



          or, without using $ne$, as follows:



          $exists space x,y space left( lnot (space x = y) land lnot(space C(x) = C(y)) right)$



          In fact, the qualification $x ne y$ is redundant, since $C(x) ne C(y) Rightarrow x ne y$. So we can simplify this to:



          $exists space x,y space left(lnot(C(x) = C(y)) right)$



          For the second part, if $B(x,y)$ denotes "$x$ is better than $y$" then "nobody is better than himself/herself" can be expressed as "there is no person $x$ such that $B(x,x)$". In formal logic notation this is:



          $nexists space x space B(x,x)$



          or



          $forall space x space lnot B(x,x)$






          share|cite|improve this answer











          $endgroup$



          Suppose $C(x)$ denotes the colour $C$ of a car $x$. To translate "At least 2 cars are not the same colour" we could say "there are cars $x$ and $y$ that are not identical such that $C(x) ne C(y)$". In formal logic notation this is:



          $exists space x,y space left( (space x ne y) land (space C(x) ne C(y)) right)$



          or, without using $ne$, as follows:



          $exists space x,y space left( lnot (space x = y) land lnot(space C(x) = C(y)) right)$



          In fact, the qualification $x ne y$ is redundant, since $C(x) ne C(y) Rightarrow x ne y$. So we can simplify this to:



          $exists space x,y space left(lnot(C(x) = C(y)) right)$



          For the second part, if $B(x,y)$ denotes "$x$ is better than $y$" then "nobody is better than himself/herself" can be expressed as "there is no person $x$ such that $B(x,x)$". In formal logic notation this is:



          $nexists space x space B(x,x)$



          or



          $forall space x space lnot B(x,x)$







          share|cite|improve this answer














          share|cite|improve this answer



          share|cite|improve this answer








          edited Dec 10 '18 at 13:50

























          answered Dec 10 '18 at 11:51









          gandalf61gandalf61

          8,481725




          8,481725












          • $begingroup$
            The answer is a bit misleading since you do not use boolean constants, but use colon and comma. This is at most just a suggestion how to write a correct formula, or an abbreviation of such. Yet not a formal logic notation.
            $endgroup$
            – Mad Hatter
            Dec 10 '18 at 12:18






          • 1




            $begingroup$
            @MadHatter I have changed the notation.
            $endgroup$
            – gandalf61
            Dec 10 '18 at 13:50


















          • $begingroup$
            The answer is a bit misleading since you do not use boolean constants, but use colon and comma. This is at most just a suggestion how to write a correct formula, or an abbreviation of such. Yet not a formal logic notation.
            $endgroup$
            – Mad Hatter
            Dec 10 '18 at 12:18






          • 1




            $begingroup$
            @MadHatter I have changed the notation.
            $endgroup$
            – gandalf61
            Dec 10 '18 at 13:50
















          $begingroup$
          The answer is a bit misleading since you do not use boolean constants, but use colon and comma. This is at most just a suggestion how to write a correct formula, or an abbreviation of such. Yet not a formal logic notation.
          $endgroup$
          – Mad Hatter
          Dec 10 '18 at 12:18




          $begingroup$
          The answer is a bit misleading since you do not use boolean constants, but use colon and comma. This is at most just a suggestion how to write a correct formula, or an abbreviation of such. Yet not a formal logic notation.
          $endgroup$
          – Mad Hatter
          Dec 10 '18 at 12:18




          1




          1




          $begingroup$
          @MadHatter I have changed the notation.
          $endgroup$
          – gandalf61
          Dec 10 '18 at 13:50




          $begingroup$
          @MadHatter I have changed the notation.
          $endgroup$
          – gandalf61
          Dec 10 '18 at 13:50


















          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%2f3033776%2fhow-to-write-there-is-at-least-2-cars-are-not-the-same-colour-in-logic%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

          Ellipse (mathématiques)

          Quarter-circle Tiles

          Mont Emei