Translating Nested Quantifiers to English sentences












3












$begingroup$


For this entire question, please use the following propositional function:
$P(x,y)$: $x$ has sent a postcard to $y$.
Translate the following quantified propositions to English sentences. Try to use sentences
as natural as possible.



(a) $forall xexists y lnot P(x, y)$



(b) $exists xforall y lnot P(x, y)$



(c) $forall xexists y lnot P(y, x)$



(d) $exists xforall y lnot P(y, x)$



(a) Every $x$ has some $y$ to whom he has not sent a postcard.



(b) Some $x$ has not sent a postcard to every $y$.



(c) Every $x$ has some $y$ from whom he has not received a postcard.



(d) Some $x$ has not received a postcard from every $y$.



Do you think my answers are correct?










share|cite|improve this question











$endgroup$












  • $begingroup$
    I think part of 'as natural as possible' is removing the variables from the natural language. For instance, b) could be translated as: Someone has never sent a postcard. - This is true, by the way, either due to still birth or because I have never sent a post card.
    $endgroup$
    – Git Gud
    Apr 21 '14 at 19:10












  • $begingroup$
    These sentences are not very natural. That is, they're not things a person would typically say out loud. Here's a suggestion for a): No matter who you are, there is always someone you've never sent a postcard to. And your answer to b) is not quite right. b) means there is someone who has never sent a postcard to anyone at all.
    $endgroup$
    – Steve Kass
    Apr 21 '14 at 19:14










  • $begingroup$
    For (c),(d) if $x$ didn't receive a postcard from $y$, does it mean $y$ hasn't sent it? What if the postcard was lost, or is caught up in the mailing system? :)
    $endgroup$
    – snulty
    Apr 21 '14 at 19:23


















3












$begingroup$


For this entire question, please use the following propositional function:
$P(x,y)$: $x$ has sent a postcard to $y$.
Translate the following quantified propositions to English sentences. Try to use sentences
as natural as possible.



(a) $forall xexists y lnot P(x, y)$



(b) $exists xforall y lnot P(x, y)$



(c) $forall xexists y lnot P(y, x)$



(d) $exists xforall y lnot P(y, x)$



(a) Every $x$ has some $y$ to whom he has not sent a postcard.



(b) Some $x$ has not sent a postcard to every $y$.



(c) Every $x$ has some $y$ from whom he has not received a postcard.



(d) Some $x$ has not received a postcard from every $y$.



Do you think my answers are correct?










share|cite|improve this question











$endgroup$












  • $begingroup$
    I think part of 'as natural as possible' is removing the variables from the natural language. For instance, b) could be translated as: Someone has never sent a postcard. - This is true, by the way, either due to still birth or because I have never sent a post card.
    $endgroup$
    – Git Gud
    Apr 21 '14 at 19:10












  • $begingroup$
    These sentences are not very natural. That is, they're not things a person would typically say out loud. Here's a suggestion for a): No matter who you are, there is always someone you've never sent a postcard to. And your answer to b) is not quite right. b) means there is someone who has never sent a postcard to anyone at all.
    $endgroup$
    – Steve Kass
    Apr 21 '14 at 19:14










  • $begingroup$
    For (c),(d) if $x$ didn't receive a postcard from $y$, does it mean $y$ hasn't sent it? What if the postcard was lost, or is caught up in the mailing system? :)
    $endgroup$
    – snulty
    Apr 21 '14 at 19:23
















3












3








3





$begingroup$


For this entire question, please use the following propositional function:
$P(x,y)$: $x$ has sent a postcard to $y$.
Translate the following quantified propositions to English sentences. Try to use sentences
as natural as possible.



(a) $forall xexists y lnot P(x, y)$



(b) $exists xforall y lnot P(x, y)$



(c) $forall xexists y lnot P(y, x)$



(d) $exists xforall y lnot P(y, x)$



(a) Every $x$ has some $y$ to whom he has not sent a postcard.



(b) Some $x$ has not sent a postcard to every $y$.



(c) Every $x$ has some $y$ from whom he has not received a postcard.



(d) Some $x$ has not received a postcard from every $y$.



Do you think my answers are correct?










share|cite|improve this question











$endgroup$




For this entire question, please use the following propositional function:
$P(x,y)$: $x$ has sent a postcard to $y$.
Translate the following quantified propositions to English sentences. Try to use sentences
as natural as possible.



(a) $forall xexists y lnot P(x, y)$



(b) $exists xforall y lnot P(x, y)$



(c) $forall xexists y lnot P(y, x)$



(d) $exists xforall y lnot P(y, x)$



(a) Every $x$ has some $y$ to whom he has not sent a postcard.



(b) Some $x$ has not sent a postcard to every $y$.



(c) Every $x$ has some $y$ from whom he has not received a postcard.



(d) Some $x$ has not received a postcard from every $y$.



Do you think my answers are correct?







predicate-logic






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Sep 13 '17 at 19:58









Shaun

9,226113684




9,226113684










asked Apr 21 '14 at 19:06









harsefhfharsefhf

161




161












  • $begingroup$
    I think part of 'as natural as possible' is removing the variables from the natural language. For instance, b) could be translated as: Someone has never sent a postcard. - This is true, by the way, either due to still birth or because I have never sent a post card.
    $endgroup$
    – Git Gud
    Apr 21 '14 at 19:10












  • $begingroup$
    These sentences are not very natural. That is, they're not things a person would typically say out loud. Here's a suggestion for a): No matter who you are, there is always someone you've never sent a postcard to. And your answer to b) is not quite right. b) means there is someone who has never sent a postcard to anyone at all.
    $endgroup$
    – Steve Kass
    Apr 21 '14 at 19:14










  • $begingroup$
    For (c),(d) if $x$ didn't receive a postcard from $y$, does it mean $y$ hasn't sent it? What if the postcard was lost, or is caught up in the mailing system? :)
    $endgroup$
    – snulty
    Apr 21 '14 at 19:23




















  • $begingroup$
    I think part of 'as natural as possible' is removing the variables from the natural language. For instance, b) could be translated as: Someone has never sent a postcard. - This is true, by the way, either due to still birth or because I have never sent a post card.
    $endgroup$
    – Git Gud
    Apr 21 '14 at 19:10












  • $begingroup$
    These sentences are not very natural. That is, they're not things a person would typically say out loud. Here's a suggestion for a): No matter who you are, there is always someone you've never sent a postcard to. And your answer to b) is not quite right. b) means there is someone who has never sent a postcard to anyone at all.
    $endgroup$
    – Steve Kass
    Apr 21 '14 at 19:14










  • $begingroup$
    For (c),(d) if $x$ didn't receive a postcard from $y$, does it mean $y$ hasn't sent it? What if the postcard was lost, or is caught up in the mailing system? :)
    $endgroup$
    – snulty
    Apr 21 '14 at 19:23


















$begingroup$
I think part of 'as natural as possible' is removing the variables from the natural language. For instance, b) could be translated as: Someone has never sent a postcard. - This is true, by the way, either due to still birth or because I have never sent a post card.
$endgroup$
– Git Gud
Apr 21 '14 at 19:10






$begingroup$
I think part of 'as natural as possible' is removing the variables from the natural language. For instance, b) could be translated as: Someone has never sent a postcard. - This is true, by the way, either due to still birth or because I have never sent a post card.
$endgroup$
– Git Gud
Apr 21 '14 at 19:10














$begingroup$
These sentences are not very natural. That is, they're not things a person would typically say out loud. Here's a suggestion for a): No matter who you are, there is always someone you've never sent a postcard to. And your answer to b) is not quite right. b) means there is someone who has never sent a postcard to anyone at all.
$endgroup$
– Steve Kass
Apr 21 '14 at 19:14




$begingroup$
These sentences are not very natural. That is, they're not things a person would typically say out loud. Here's a suggestion for a): No matter who you are, there is always someone you've never sent a postcard to. And your answer to b) is not quite right. b) means there is someone who has never sent a postcard to anyone at all.
$endgroup$
– Steve Kass
Apr 21 '14 at 19:14












$begingroup$
For (c),(d) if $x$ didn't receive a postcard from $y$, does it mean $y$ hasn't sent it? What if the postcard was lost, or is caught up in the mailing system? :)
$endgroup$
– snulty
Apr 21 '14 at 19:23






$begingroup$
For (c),(d) if $x$ didn't receive a postcard from $y$, does it mean $y$ hasn't sent it? What if the postcard was lost, or is caught up in the mailing system? :)
$endgroup$
– snulty
Apr 21 '14 at 19:23












2 Answers
2






active

oldest

votes


















0












$begingroup$

What language does the expression




For every $x$ there is some $y$ such that $x$ has not sent a postcard to $y$.




belong to? If anything, it belongs to that logic-English mix which some call Loglish. Using Loglish is a very useful step on the way towards producing a translation into natural language (see my Introduction to Formal Logic, §24.1 for lots of examples of Loglish being used this way). So I'm all for using Loglish. But you can't stop there. For Loglish certainly isn't English. Just try saying the displayed expression to any native speaker outside the logic classroom and see what reaction you get!



You are being asked to translate into natural English, and that means go on to drop the $x$s and $y$s -- which, at a first step, typically involves replacing them by natural-language pronouns. You make a rather fumbled first step when you write




Every $x$ has some $y$ to whom he has not sent a postcard.




where you've replaced the second '$x$' with 'he', and the 'to $y$' with 'to whom'. But you shouldn't do this piecemeal, ditching some of the $x$s say and not the others: it won't even be good LogLish! You need to lose all the related $x$s in one go. And then all the $y$s. That way you will end up, as you are asked to do, with natural English, without any $x$s and $y$s.






share|cite|improve this answer











$endgroup$





















    0












    $begingroup$

    Try the equivalent formulas in (1) and (3)



    1) $negexists x forall y P(x,y)$:
    There is no one that has sent a postcard to every person.



    2) There is a person that has not sent a postcard to anyone.



    3) $negexists x forall y P(y,x)$: There is no one that has received a postcard from every person.



    4) There is a person that has not received a postcard from anyone.






    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%2f763478%2ftranslating-nested-quantifiers-to-english-sentences%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









      0












      $begingroup$

      What language does the expression




      For every $x$ there is some $y$ such that $x$ has not sent a postcard to $y$.




      belong to? If anything, it belongs to that logic-English mix which some call Loglish. Using Loglish is a very useful step on the way towards producing a translation into natural language (see my Introduction to Formal Logic, §24.1 for lots of examples of Loglish being used this way). So I'm all for using Loglish. But you can't stop there. For Loglish certainly isn't English. Just try saying the displayed expression to any native speaker outside the logic classroom and see what reaction you get!



      You are being asked to translate into natural English, and that means go on to drop the $x$s and $y$s -- which, at a first step, typically involves replacing them by natural-language pronouns. You make a rather fumbled first step when you write




      Every $x$ has some $y$ to whom he has not sent a postcard.




      where you've replaced the second '$x$' with 'he', and the 'to $y$' with 'to whom'. But you shouldn't do this piecemeal, ditching some of the $x$s say and not the others: it won't even be good LogLish! You need to lose all the related $x$s in one go. And then all the $y$s. That way you will end up, as you are asked to do, with natural English, without any $x$s and $y$s.






      share|cite|improve this answer











      $endgroup$


















        0












        $begingroup$

        What language does the expression




        For every $x$ there is some $y$ such that $x$ has not sent a postcard to $y$.




        belong to? If anything, it belongs to that logic-English mix which some call Loglish. Using Loglish is a very useful step on the way towards producing a translation into natural language (see my Introduction to Formal Logic, §24.1 for lots of examples of Loglish being used this way). So I'm all for using Loglish. But you can't stop there. For Loglish certainly isn't English. Just try saying the displayed expression to any native speaker outside the logic classroom and see what reaction you get!



        You are being asked to translate into natural English, and that means go on to drop the $x$s and $y$s -- which, at a first step, typically involves replacing them by natural-language pronouns. You make a rather fumbled first step when you write




        Every $x$ has some $y$ to whom he has not sent a postcard.




        where you've replaced the second '$x$' with 'he', and the 'to $y$' with 'to whom'. But you shouldn't do this piecemeal, ditching some of the $x$s say and not the others: it won't even be good LogLish! You need to lose all the related $x$s in one go. And then all the $y$s. That way you will end up, as you are asked to do, with natural English, without any $x$s and $y$s.






        share|cite|improve this answer











        $endgroup$
















          0












          0








          0





          $begingroup$

          What language does the expression




          For every $x$ there is some $y$ such that $x$ has not sent a postcard to $y$.




          belong to? If anything, it belongs to that logic-English mix which some call Loglish. Using Loglish is a very useful step on the way towards producing a translation into natural language (see my Introduction to Formal Logic, §24.1 for lots of examples of Loglish being used this way). So I'm all for using Loglish. But you can't stop there. For Loglish certainly isn't English. Just try saying the displayed expression to any native speaker outside the logic classroom and see what reaction you get!



          You are being asked to translate into natural English, and that means go on to drop the $x$s and $y$s -- which, at a first step, typically involves replacing them by natural-language pronouns. You make a rather fumbled first step when you write




          Every $x$ has some $y$ to whom he has not sent a postcard.




          where you've replaced the second '$x$' with 'he', and the 'to $y$' with 'to whom'. But you shouldn't do this piecemeal, ditching some of the $x$s say and not the others: it won't even be good LogLish! You need to lose all the related $x$s in one go. And then all the $y$s. That way you will end up, as you are asked to do, with natural English, without any $x$s and $y$s.






          share|cite|improve this answer











          $endgroup$



          What language does the expression




          For every $x$ there is some $y$ such that $x$ has not sent a postcard to $y$.




          belong to? If anything, it belongs to that logic-English mix which some call Loglish. Using Loglish is a very useful step on the way towards producing a translation into natural language (see my Introduction to Formal Logic, §24.1 for lots of examples of Loglish being used this way). So I'm all for using Loglish. But you can't stop there. For Loglish certainly isn't English. Just try saying the displayed expression to any native speaker outside the logic classroom and see what reaction you get!



          You are being asked to translate into natural English, and that means go on to drop the $x$s and $y$s -- which, at a first step, typically involves replacing them by natural-language pronouns. You make a rather fumbled first step when you write




          Every $x$ has some $y$ to whom he has not sent a postcard.




          where you've replaced the second '$x$' with 'he', and the 'to $y$' with 'to whom'. But you shouldn't do this piecemeal, ditching some of the $x$s say and not the others: it won't even be good LogLish! You need to lose all the related $x$s in one go. And then all the $y$s. That way you will end up, as you are asked to do, with natural English, without any $x$s and $y$s.







          share|cite|improve this answer














          share|cite|improve this answer



          share|cite|improve this answer








          edited Apr 21 '14 at 19:33

























          answered Apr 21 '14 at 19:20









          Peter SmithPeter Smith

          40.8k340120




          40.8k340120























              0












              $begingroup$

              Try the equivalent formulas in (1) and (3)



              1) $negexists x forall y P(x,y)$:
              There is no one that has sent a postcard to every person.



              2) There is a person that has not sent a postcard to anyone.



              3) $negexists x forall y P(y,x)$: There is no one that has received a postcard from every person.



              4) There is a person that has not received a postcard from anyone.






              share|cite|improve this answer









              $endgroup$


















                0












                $begingroup$

                Try the equivalent formulas in (1) and (3)



                1) $negexists x forall y P(x,y)$:
                There is no one that has sent a postcard to every person.



                2) There is a person that has not sent a postcard to anyone.



                3) $negexists x forall y P(y,x)$: There is no one that has received a postcard from every person.



                4) There is a person that has not received a postcard from anyone.






                share|cite|improve this answer









                $endgroup$
















                  0












                  0








                  0





                  $begingroup$

                  Try the equivalent formulas in (1) and (3)



                  1) $negexists x forall y P(x,y)$:
                  There is no one that has sent a postcard to every person.



                  2) There is a person that has not sent a postcard to anyone.



                  3) $negexists x forall y P(y,x)$: There is no one that has received a postcard from every person.



                  4) There is a person that has not received a postcard from anyone.






                  share|cite|improve this answer









                  $endgroup$



                  Try the equivalent formulas in (1) and (3)



                  1) $negexists x forall y P(x,y)$:
                  There is no one that has sent a postcard to every person.



                  2) There is a person that has not sent a postcard to anyone.



                  3) $negexists x forall y P(y,x)$: There is no one that has received a postcard from every person.



                  4) There is a person that has not received a postcard from anyone.







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Sep 13 '17 at 22:38









                  LoMaPhLoMaPh

                  8111916




                  8111916






























                      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%2f763478%2ftranslating-nested-quantifiers-to-english-sentences%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

                      Understanding the size os this class of aleatory events

                      Partial Derivative Guidance.