What does x is free for substitution for y in $varphi$, but not for z means?











up vote
0
down vote

favorite












I am studying about first order predicate logic, and I have some difficulties understanding substitution and free variables.



If x is free for substitution for y in $varphi$, but not for z, where $varphi$ is a single formula, what would this mean?



Also x,y and z are variables.



Can you give a formula $varphi$ that satisfies this condition?










share|cite|improve this question


























    up vote
    0
    down vote

    favorite












    I am studying about first order predicate logic, and I have some difficulties understanding substitution and free variables.



    If x is free for substitution for y in $varphi$, but not for z, where $varphi$ is a single formula, what would this mean?



    Also x,y and z are variables.



    Can you give a formula $varphi$ that satisfies this condition?










    share|cite|improve this question
























      up vote
      0
      down vote

      favorite









      up vote
      0
      down vote

      favorite











      I am studying about first order predicate logic, and I have some difficulties understanding substitution and free variables.



      If x is free for substitution for y in $varphi$, but not for z, where $varphi$ is a single formula, what would this mean?



      Also x,y and z are variables.



      Can you give a formula $varphi$ that satisfies this condition?










      share|cite|improve this question













      I am studying about first order predicate logic, and I have some difficulties understanding substitution and free variables.



      If x is free for substitution for y in $varphi$, but not for z, where $varphi$ is a single formula, what would this mean?



      Also x,y and z are variables.



      Can you give a formula $varphi$ that satisfies this condition?







      logic predicate-logic






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Nov 19 at 21:42









      astro_chae

      62




      62






















          1 Answer
          1






          active

          oldest

          votes

















          up vote
          1
          down vote



          accepted










          Consider the open wff with two free variables




          $Fy to forall x Gzx$




          Then substituting $x$ for $y$ gives us




          $Fx to forall x Gzx$




          Again a wff with two free variables (check you understand this claim). The two expressions can in effect be thought of as available to express the same binary relation.



          Substituting $x$ for $z$ in the first wff however gives us




          $Fy to forall x Gxx$




          a wff now with one free variable. What's happened is that, in the second case, what was a free variable gets captured by the quantifier, and so the quantificational structure of the wff is changed. We don't want merely changing the letter we use for a variable to have that sort of effect -- hence, as we say, '$x$' is here not free to be substituted for '$z$' (while preserving quantificational structure).






          share|cite|improve this answer























          • Thanks for the answer :) What I understood is if we substitute a variable (for instance y to x) and if it is not restricted by the quantifiers, then it is free. Additionally, I was wondering if there is any example of closed formula. Would there be an example?
            – astro_chae
            Nov 20 at 4:26












          • Think about $exists z(forall yFy to forall xGxz)$. Which of $y$ and $z$ could be systematically replaced by $x$, and why?
            – Peter Smith
            Nov 20 at 14:21












          • Thanks for the reply :) What I am understanding is, If I replace y by x, then y is free because it is not restricted by any quantifiers, but if we replace z by x then because of $exists$x every x in the bracket becomes restricted. I hope I understood correctly. Thank you :)
            – astro_chae
            Nov 20 at 22:44













          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',
          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%2f3005561%2fwhat-does-x-is-free-for-substitution-for-y-in-varphi-but-not-for-z-means%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








          up vote
          1
          down vote



          accepted










          Consider the open wff with two free variables




          $Fy to forall x Gzx$




          Then substituting $x$ for $y$ gives us




          $Fx to forall x Gzx$




          Again a wff with two free variables (check you understand this claim). The two expressions can in effect be thought of as available to express the same binary relation.



          Substituting $x$ for $z$ in the first wff however gives us




          $Fy to forall x Gxx$




          a wff now with one free variable. What's happened is that, in the second case, what was a free variable gets captured by the quantifier, and so the quantificational structure of the wff is changed. We don't want merely changing the letter we use for a variable to have that sort of effect -- hence, as we say, '$x$' is here not free to be substituted for '$z$' (while preserving quantificational structure).






          share|cite|improve this answer























          • Thanks for the answer :) What I understood is if we substitute a variable (for instance y to x) and if it is not restricted by the quantifiers, then it is free. Additionally, I was wondering if there is any example of closed formula. Would there be an example?
            – astro_chae
            Nov 20 at 4:26












          • Think about $exists z(forall yFy to forall xGxz)$. Which of $y$ and $z$ could be systematically replaced by $x$, and why?
            – Peter Smith
            Nov 20 at 14:21












          • Thanks for the reply :) What I am understanding is, If I replace y by x, then y is free because it is not restricted by any quantifiers, but if we replace z by x then because of $exists$x every x in the bracket becomes restricted. I hope I understood correctly. Thank you :)
            – astro_chae
            Nov 20 at 22:44

















          up vote
          1
          down vote



          accepted










          Consider the open wff with two free variables




          $Fy to forall x Gzx$




          Then substituting $x$ for $y$ gives us




          $Fx to forall x Gzx$




          Again a wff with two free variables (check you understand this claim). The two expressions can in effect be thought of as available to express the same binary relation.



          Substituting $x$ for $z$ in the first wff however gives us




          $Fy to forall x Gxx$




          a wff now with one free variable. What's happened is that, in the second case, what was a free variable gets captured by the quantifier, and so the quantificational structure of the wff is changed. We don't want merely changing the letter we use for a variable to have that sort of effect -- hence, as we say, '$x$' is here not free to be substituted for '$z$' (while preserving quantificational structure).






          share|cite|improve this answer























          • Thanks for the answer :) What I understood is if we substitute a variable (for instance y to x) and if it is not restricted by the quantifiers, then it is free. Additionally, I was wondering if there is any example of closed formula. Would there be an example?
            – astro_chae
            Nov 20 at 4:26












          • Think about $exists z(forall yFy to forall xGxz)$. Which of $y$ and $z$ could be systematically replaced by $x$, and why?
            – Peter Smith
            Nov 20 at 14:21












          • Thanks for the reply :) What I am understanding is, If I replace y by x, then y is free because it is not restricted by any quantifiers, but if we replace z by x then because of $exists$x every x in the bracket becomes restricted. I hope I understood correctly. Thank you :)
            – astro_chae
            Nov 20 at 22:44















          up vote
          1
          down vote



          accepted







          up vote
          1
          down vote



          accepted






          Consider the open wff with two free variables




          $Fy to forall x Gzx$




          Then substituting $x$ for $y$ gives us




          $Fx to forall x Gzx$




          Again a wff with two free variables (check you understand this claim). The two expressions can in effect be thought of as available to express the same binary relation.



          Substituting $x$ for $z$ in the first wff however gives us




          $Fy to forall x Gxx$




          a wff now with one free variable. What's happened is that, in the second case, what was a free variable gets captured by the quantifier, and so the quantificational structure of the wff is changed. We don't want merely changing the letter we use for a variable to have that sort of effect -- hence, as we say, '$x$' is here not free to be substituted for '$z$' (while preserving quantificational structure).






          share|cite|improve this answer














          Consider the open wff with two free variables




          $Fy to forall x Gzx$




          Then substituting $x$ for $y$ gives us




          $Fx to forall x Gzx$




          Again a wff with two free variables (check you understand this claim). The two expressions can in effect be thought of as available to express the same binary relation.



          Substituting $x$ for $z$ in the first wff however gives us




          $Fy to forall x Gxx$




          a wff now with one free variable. What's happened is that, in the second case, what was a free variable gets captured by the quantifier, and so the quantificational structure of the wff is changed. We don't want merely changing the letter we use for a variable to have that sort of effect -- hence, as we say, '$x$' is here not free to be substituted for '$z$' (while preserving quantificational structure).







          share|cite|improve this answer














          share|cite|improve this answer



          share|cite|improve this answer








          edited Nov 20 at 0:22

























          answered Nov 19 at 23:54









          Peter Smith

          40.3k339118




          40.3k339118












          • Thanks for the answer :) What I understood is if we substitute a variable (for instance y to x) and if it is not restricted by the quantifiers, then it is free. Additionally, I was wondering if there is any example of closed formula. Would there be an example?
            – astro_chae
            Nov 20 at 4:26












          • Think about $exists z(forall yFy to forall xGxz)$. Which of $y$ and $z$ could be systematically replaced by $x$, and why?
            – Peter Smith
            Nov 20 at 14:21












          • Thanks for the reply :) What I am understanding is, If I replace y by x, then y is free because it is not restricted by any quantifiers, but if we replace z by x then because of $exists$x every x in the bracket becomes restricted. I hope I understood correctly. Thank you :)
            – astro_chae
            Nov 20 at 22:44




















          • Thanks for the answer :) What I understood is if we substitute a variable (for instance y to x) and if it is not restricted by the quantifiers, then it is free. Additionally, I was wondering if there is any example of closed formula. Would there be an example?
            – astro_chae
            Nov 20 at 4:26












          • Think about $exists z(forall yFy to forall xGxz)$. Which of $y$ and $z$ could be systematically replaced by $x$, and why?
            – Peter Smith
            Nov 20 at 14:21












          • Thanks for the reply :) What I am understanding is, If I replace y by x, then y is free because it is not restricted by any quantifiers, but if we replace z by x then because of $exists$x every x in the bracket becomes restricted. I hope I understood correctly. Thank you :)
            – astro_chae
            Nov 20 at 22:44


















          Thanks for the answer :) What I understood is if we substitute a variable (for instance y to x) and if it is not restricted by the quantifiers, then it is free. Additionally, I was wondering if there is any example of closed formula. Would there be an example?
          – astro_chae
          Nov 20 at 4:26






          Thanks for the answer :) What I understood is if we substitute a variable (for instance y to x) and if it is not restricted by the quantifiers, then it is free. Additionally, I was wondering if there is any example of closed formula. Would there be an example?
          – astro_chae
          Nov 20 at 4:26














          Think about $exists z(forall yFy to forall xGxz)$. Which of $y$ and $z$ could be systematically replaced by $x$, and why?
          – Peter Smith
          Nov 20 at 14:21






          Think about $exists z(forall yFy to forall xGxz)$. Which of $y$ and $z$ could be systematically replaced by $x$, and why?
          – Peter Smith
          Nov 20 at 14:21














          Thanks for the reply :) What I am understanding is, If I replace y by x, then y is free because it is not restricted by any quantifiers, but if we replace z by x then because of $exists$x every x in the bracket becomes restricted. I hope I understood correctly. Thank you :)
          – astro_chae
          Nov 20 at 22:44






          Thanks for the reply :) What I am understanding is, If I replace y by x, then y is free because it is not restricted by any quantifiers, but if we replace z by x then because of $exists$x every x in the bracket becomes restricted. I hope I understood correctly. Thank you :)
          – astro_chae
          Nov 20 at 22:44




















          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.





          Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


          Please pay close attention to the following guidance:


          • 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.


          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%2f3005561%2fwhat-does-x-is-free-for-substitution-for-y-in-varphi-but-not-for-z-means%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

          Probability when a professor distributes a quiz and homework assignment to a class of n students.

          Aardman Animations

          Are they similar matrix