What is the difference between validity and satisfiability?

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
2
down vote

favorite












As the title says, What is the difference between validity and satisfiability?

Suppose I have a sentence If the sun is made of blue cheese, then cats fly.

How do I tell if its valid or satisfiable?










share|cite|improve this question

























    up vote
    2
    down vote

    favorite












    As the title says, What is the difference between validity and satisfiability?

    Suppose I have a sentence If the sun is made of blue cheese, then cats fly.

    How do I tell if its valid or satisfiable?










    share|cite|improve this question























      up vote
      2
      down vote

      favorite









      up vote
      2
      down vote

      favorite











      As the title says, What is the difference between validity and satisfiability?

      Suppose I have a sentence If the sun is made of blue cheese, then cats fly.

      How do I tell if its valid or satisfiable?










      share|cite|improve this question













      As the title says, What is the difference between validity and satisfiability?

      Suppose I have a sentence If the sun is made of blue cheese, then cats fly.

      How do I tell if its valid or satisfiable?







      logic






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Sep 9 at 6:53









      Helosy

      183




      183




















          1 Answer
          1






          active

          oldest

          votes

















          up vote
          2
          down vote



          accepted










          In mathematical logic, satisfiability and validity are elementary concepts of semantics.




          A formula is satisfiable if it is possible to find an interpretation (model) that makes the formula true.



          A formula is valid if all interpretations make the formula true.




          A formula $varphi$ is valid iff its negation : $lnot varphi$ is unsatisfiable.



          Examples from propositional logic :




          $lnot p lor p$ is valid;



          $p lor q$ and $p to q$ are examples of satisfiable formulas (but not valid);



          $p land lnot p$ is unsatisfiable.





          The above concepts appy to formulas; a single statement of natural language is either true or false.



          Specifically, the statement :




          "If the sun is made of blue cheese, then cats fly",




          if we read the connective "if..., then ..." in the truth-functional way (i.e. as the material conditiona), is true, because the antecedent : "the sun is made of blue cheese" is false.



          The sentence is an instance of the formula $p to q$, that is satisfiable (but not valid).






          share|cite|improve this answer






















          • I think the line "The above concepts appy to formulas; a single statement of natural language is either true or false." is misleading, since it's easy to read the emphasis as being on formulas vs. sentences (and of course a sentence is not true or false in the absence of an interpretation either); in fact, even the reference to natural language is misleading, since the real point is the role of "the world" as an intended interpretation.
            – Noah Schweber
            Sep 9 at 15:56











          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: false,
          showLowRepImageUploadWarning: true,
          reputationToPostImages: 10,
          bindNavPrevention: true,
          postfix: "",
          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%2f2910483%2fwhat-is-the-difference-between-validity-and-satisfiability%23new-answer', 'question_page');

          );

          Post as a guest






























          1 Answer
          1






          active

          oldest

          votes








          1 Answer
          1






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes








          up vote
          2
          down vote



          accepted










          In mathematical logic, satisfiability and validity are elementary concepts of semantics.




          A formula is satisfiable if it is possible to find an interpretation (model) that makes the formula true.



          A formula is valid if all interpretations make the formula true.




          A formula $varphi$ is valid iff its negation : $lnot varphi$ is unsatisfiable.



          Examples from propositional logic :




          $lnot p lor p$ is valid;



          $p lor q$ and $p to q$ are examples of satisfiable formulas (but not valid);



          $p land lnot p$ is unsatisfiable.





          The above concepts appy to formulas; a single statement of natural language is either true or false.



          Specifically, the statement :




          "If the sun is made of blue cheese, then cats fly",




          if we read the connective "if..., then ..." in the truth-functional way (i.e. as the material conditiona), is true, because the antecedent : "the sun is made of blue cheese" is false.



          The sentence is an instance of the formula $p to q$, that is satisfiable (but not valid).






          share|cite|improve this answer






















          • I think the line "The above concepts appy to formulas; a single statement of natural language is either true or false." is misleading, since it's easy to read the emphasis as being on formulas vs. sentences (and of course a sentence is not true or false in the absence of an interpretation either); in fact, even the reference to natural language is misleading, since the real point is the role of "the world" as an intended interpretation.
            – Noah Schweber
            Sep 9 at 15:56















          up vote
          2
          down vote



          accepted










          In mathematical logic, satisfiability and validity are elementary concepts of semantics.




          A formula is satisfiable if it is possible to find an interpretation (model) that makes the formula true.



          A formula is valid if all interpretations make the formula true.




          A formula $varphi$ is valid iff its negation : $lnot varphi$ is unsatisfiable.



          Examples from propositional logic :




          $lnot p lor p$ is valid;



          $p lor q$ and $p to q$ are examples of satisfiable formulas (but not valid);



          $p land lnot p$ is unsatisfiable.





          The above concepts appy to formulas; a single statement of natural language is either true or false.



          Specifically, the statement :




          "If the sun is made of blue cheese, then cats fly",




          if we read the connective "if..., then ..." in the truth-functional way (i.e. as the material conditiona), is true, because the antecedent : "the sun is made of blue cheese" is false.



          The sentence is an instance of the formula $p to q$, that is satisfiable (but not valid).






          share|cite|improve this answer






















          • I think the line "The above concepts appy to formulas; a single statement of natural language is either true or false." is misleading, since it's easy to read the emphasis as being on formulas vs. sentences (and of course a sentence is not true or false in the absence of an interpretation either); in fact, even the reference to natural language is misleading, since the real point is the role of "the world" as an intended interpretation.
            – Noah Schweber
            Sep 9 at 15:56













          up vote
          2
          down vote



          accepted







          up vote
          2
          down vote



          accepted






          In mathematical logic, satisfiability and validity are elementary concepts of semantics.




          A formula is satisfiable if it is possible to find an interpretation (model) that makes the formula true.



          A formula is valid if all interpretations make the formula true.




          A formula $varphi$ is valid iff its negation : $lnot varphi$ is unsatisfiable.



          Examples from propositional logic :




          $lnot p lor p$ is valid;



          $p lor q$ and $p to q$ are examples of satisfiable formulas (but not valid);



          $p land lnot p$ is unsatisfiable.





          The above concepts appy to formulas; a single statement of natural language is either true or false.



          Specifically, the statement :




          "If the sun is made of blue cheese, then cats fly",




          if we read the connective "if..., then ..." in the truth-functional way (i.e. as the material conditiona), is true, because the antecedent : "the sun is made of blue cheese" is false.



          The sentence is an instance of the formula $p to q$, that is satisfiable (but not valid).






          share|cite|improve this answer














          In mathematical logic, satisfiability and validity are elementary concepts of semantics.




          A formula is satisfiable if it is possible to find an interpretation (model) that makes the formula true.



          A formula is valid if all interpretations make the formula true.




          A formula $varphi$ is valid iff its negation : $lnot varphi$ is unsatisfiable.



          Examples from propositional logic :




          $lnot p lor p$ is valid;



          $p lor q$ and $p to q$ are examples of satisfiable formulas (but not valid);



          $p land lnot p$ is unsatisfiable.





          The above concepts appy to formulas; a single statement of natural language is either true or false.



          Specifically, the statement :




          "If the sun is made of blue cheese, then cats fly",




          if we read the connective "if..., then ..." in the truth-functional way (i.e. as the material conditiona), is true, because the antecedent : "the sun is made of blue cheese" is false.



          The sentence is an instance of the formula $p to q$, that is satisfiable (but not valid).







          share|cite|improve this answer














          share|cite|improve this answer



          share|cite|improve this answer








          edited Sep 12 at 8:13

























          answered Sep 9 at 7:56









          Mauro ALLEGRANZA

          61.5k446105




          61.5k446105











          • I think the line "The above concepts appy to formulas; a single statement of natural language is either true or false." is misleading, since it's easy to read the emphasis as being on formulas vs. sentences (and of course a sentence is not true or false in the absence of an interpretation either); in fact, even the reference to natural language is misleading, since the real point is the role of "the world" as an intended interpretation.
            – Noah Schweber
            Sep 9 at 15:56

















          • I think the line "The above concepts appy to formulas; a single statement of natural language is either true or false." is misleading, since it's easy to read the emphasis as being on formulas vs. sentences (and of course a sentence is not true or false in the absence of an interpretation either); in fact, even the reference to natural language is misleading, since the real point is the role of "the world" as an intended interpretation.
            – Noah Schweber
            Sep 9 at 15:56
















          I think the line "The above concepts appy to formulas; a single statement of natural language is either true or false." is misleading, since it's easy to read the emphasis as being on formulas vs. sentences (and of course a sentence is not true or false in the absence of an interpretation either); in fact, even the reference to natural language is misleading, since the real point is the role of "the world" as an intended interpretation.
          – Noah Schweber
          Sep 9 at 15:56





          I think the line "The above concepts appy to formulas; a single statement of natural language is either true or false." is misleading, since it's easy to read the emphasis as being on formulas vs. sentences (and of course a sentence is not true or false in the absence of an interpretation either); in fact, even the reference to natural language is misleading, since the real point is the role of "the world" as an intended interpretation.
          – Noah Schweber
          Sep 9 at 15:56


















           

          draft saved


          draft discarded















































           


          draft saved


          draft discarded














          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2910483%2fwhat-is-the-difference-between-validity-and-satisfiability%23new-answer', 'question_page');

          );

          Post as a guest













































































          這個網誌中的熱門文章

          tkz-euclide: tkzDrawCircle[R] not working

          How to combine Bézier curves to a surface?

          1st Magritte Awards