Logic problem about set of disjunction forms(Fixed)












0












$begingroup$


I will call the disjunction of literals a disjunction form. Let $Sigma$ be a set of disjunction forms, and $alpha$ is a well-formed formula satisfying $Sigma vDash alpha$. For all propositional variable $p$, assume that $p$ and $neg p$ do not occur in element of $Sigma$ at the same time.



Prove that $exists sigma in Sigma$ such that $sigma vDash alpha$. And the above proposition is true if we change all disjunctions to conjunctions.



Can you help me?










share|cite|improve this question











$endgroup$

















    0












    $begingroup$


    I will call the disjunction of literals a disjunction form. Let $Sigma$ be a set of disjunction forms, and $alpha$ is a well-formed formula satisfying $Sigma vDash alpha$. For all propositional variable $p$, assume that $p$ and $neg p$ do not occur in element of $Sigma$ at the same time.



    Prove that $exists sigma in Sigma$ such that $sigma vDash alpha$. And the above proposition is true if we change all disjunctions to conjunctions.



    Can you help me?










    share|cite|improve this question











    $endgroup$















      0












      0








      0





      $begingroup$


      I will call the disjunction of literals a disjunction form. Let $Sigma$ be a set of disjunction forms, and $alpha$ is a well-formed formula satisfying $Sigma vDash alpha$. For all propositional variable $p$, assume that $p$ and $neg p$ do not occur in element of $Sigma$ at the same time.



      Prove that $exists sigma in Sigma$ such that $sigma vDash alpha$. And the above proposition is true if we change all disjunctions to conjunctions.



      Can you help me?










      share|cite|improve this question











      $endgroup$




      I will call the disjunction of literals a disjunction form. Let $Sigma$ be a set of disjunction forms, and $alpha$ is a well-formed formula satisfying $Sigma vDash alpha$. For all propositional variable $p$, assume that $p$ and $neg p$ do not occur in element of $Sigma$ at the same time.



      Prove that $exists sigma in Sigma$ such that $sigma vDash alpha$. And the above proposition is true if we change all disjunctions to conjunctions.



      Can you help me?







      logic propositional-calculus model-theory






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Dec 4 '18 at 11:33







      amoogae

















      asked Dec 3 '18 at 11:35









      amoogaeamoogae

      125




      125






















          2 Answers
          2






          active

          oldest

          votes


















          1












          $begingroup$

          Neither statement is true.



          Let $Sigma = {P_1lor P_2, Q_1lor Q_2}$, and $alpha = (P_1lor P_2) land (Q_1lor Q_2)$.



          Then $Sigmamodels alpha$, but there is no $sigmain Sigma$ such that $sigmamodels alpha$.



          Similarly, for "conjunction forms" instead of "disjunction forms", let $Sigma = {P_1land P_2, Q_1land Q_2}$, and $alpha = (P_1land P_2) land (Q_1land Q_2)$.





          Edit: In response to the comments, I'll prove the following.



          Suppose $Sigma$ is a nonempty set of disjunctions of literals, such that for every propositional variable $p$, at most one of the literals $p$ and $lnot p$ occurs in $Sigma$. And suppose $alpha$ is a disjunction of literals. If $Sigmamodels alpha$, then there is some $sigmain Sigma$ such that $sigmamodels alpha$.



          Case 1: There is some propositional variable $p$ such that both of the literals $p$ and $lnot p$ occur in $alpha$. Then $alpha$ is a tautology, so $sigmamodels alpha$ for any $sigmain Sigma$.



          Case 2: There is some $sigmain Sigma$ such that every literal occuring in $sigma$ occurs in $alpha$. Then we are done, since $sigmamodels alpha$.



          We will show that if we assume we are not in Case 1 or Case 2, we have a contradiction. Since we are not in Case 2, for every $sigmain Sigma$, we can pick some literal $l_sigma$ which appears in $sigma$ but not in $alpha$.



          Let $M$ be a model/interpretation such that the literals ${l_sigmamid sigmain Sigma}$ are all true, and the literals appearing in $alpha$ are all false. We can do this, because:




          1. We have arranged that no literal $l_sigma$ appears in $alpha$.

          2. Since we are not in Case 1, no literal and its negation both appear in $alpha$.

          3. By hypothesis, no literal and its negation both appear in ${l_sigmamid sigmain Sigma}$, since all these literals appear in $Sigma$.


          But then for each $sigmain Sigma$, we have $Mmodels l_sigma$, so $Mmodels sigma$, and hence $Mmodels Sigma$. But $Mnotmodels alpha$. So $Sigmanotmodels alpha$, contradiction.






          share|cite|improve this answer











          $endgroup$













          • $begingroup$
            Sorry. It seems to require more conditions. I will fix my question. Please read it again. Thanks to your answers.
            $endgroup$
            – amoogae
            Dec 4 '18 at 11:36










          • $begingroup$
            I've edited my answer in response to your edited question. Why do you think something like this should be true?
            $endgroup$
            – Alex Kruckman
            Dec 4 '18 at 14:45










          • $begingroup$
            Thank you. I am trying to prove enderton's exercise 1.2.10 (c) using the conjunctive normal form. Perhaps I misunderstood something. Finally, if $alpha$ is also a disjunction form, then the above proposition is true?
            $endgroup$
            – amoogae
            Dec 5 '18 at 11:09












          • $begingroup$
            Yes, I think it's true if $alpha$ is also a disjunction form.
            $endgroup$
            – Alex Kruckman
            Dec 5 '18 at 14:05










          • $begingroup$
            How can I prove if $alpha$ is also a disjunction form. Please help me.
            $endgroup$
            – amoogae
            Dec 5 '18 at 16:56



















          -1












          $begingroup$

          Hint: For every propositional formula $phi$ there is an equivalent formula $psi$ in conjunctive normal form, that is,



          $$ psi = bigwedge^{m}_{i=1} (bigvee^{m_i}_{j=1} ell_{ij}) $$



          where the $ell_{ij}$'s are literals. And there is a similar result for disjunctive normal forms.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            This is true, but I don't see how it serves as a hint for the question...
            $endgroup$
            – Alex Kruckman
            Dec 4 '18 at 1:09











          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%2f3023933%2flogic-problem-about-set-of-disjunction-formsfixed%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$

          Neither statement is true.



          Let $Sigma = {P_1lor P_2, Q_1lor Q_2}$, and $alpha = (P_1lor P_2) land (Q_1lor Q_2)$.



          Then $Sigmamodels alpha$, but there is no $sigmain Sigma$ such that $sigmamodels alpha$.



          Similarly, for "conjunction forms" instead of "disjunction forms", let $Sigma = {P_1land P_2, Q_1land Q_2}$, and $alpha = (P_1land P_2) land (Q_1land Q_2)$.





          Edit: In response to the comments, I'll prove the following.



          Suppose $Sigma$ is a nonempty set of disjunctions of literals, such that for every propositional variable $p$, at most one of the literals $p$ and $lnot p$ occurs in $Sigma$. And suppose $alpha$ is a disjunction of literals. If $Sigmamodels alpha$, then there is some $sigmain Sigma$ such that $sigmamodels alpha$.



          Case 1: There is some propositional variable $p$ such that both of the literals $p$ and $lnot p$ occur in $alpha$. Then $alpha$ is a tautology, so $sigmamodels alpha$ for any $sigmain Sigma$.



          Case 2: There is some $sigmain Sigma$ such that every literal occuring in $sigma$ occurs in $alpha$. Then we are done, since $sigmamodels alpha$.



          We will show that if we assume we are not in Case 1 or Case 2, we have a contradiction. Since we are not in Case 2, for every $sigmain Sigma$, we can pick some literal $l_sigma$ which appears in $sigma$ but not in $alpha$.



          Let $M$ be a model/interpretation such that the literals ${l_sigmamid sigmain Sigma}$ are all true, and the literals appearing in $alpha$ are all false. We can do this, because:




          1. We have arranged that no literal $l_sigma$ appears in $alpha$.

          2. Since we are not in Case 1, no literal and its negation both appear in $alpha$.

          3. By hypothesis, no literal and its negation both appear in ${l_sigmamid sigmain Sigma}$, since all these literals appear in $Sigma$.


          But then for each $sigmain Sigma$, we have $Mmodels l_sigma$, so $Mmodels sigma$, and hence $Mmodels Sigma$. But $Mnotmodels alpha$. So $Sigmanotmodels alpha$, contradiction.






          share|cite|improve this answer











          $endgroup$













          • $begingroup$
            Sorry. It seems to require more conditions. I will fix my question. Please read it again. Thanks to your answers.
            $endgroup$
            – amoogae
            Dec 4 '18 at 11:36










          • $begingroup$
            I've edited my answer in response to your edited question. Why do you think something like this should be true?
            $endgroup$
            – Alex Kruckman
            Dec 4 '18 at 14:45










          • $begingroup$
            Thank you. I am trying to prove enderton's exercise 1.2.10 (c) using the conjunctive normal form. Perhaps I misunderstood something. Finally, if $alpha$ is also a disjunction form, then the above proposition is true?
            $endgroup$
            – amoogae
            Dec 5 '18 at 11:09












          • $begingroup$
            Yes, I think it's true if $alpha$ is also a disjunction form.
            $endgroup$
            – Alex Kruckman
            Dec 5 '18 at 14:05










          • $begingroup$
            How can I prove if $alpha$ is also a disjunction form. Please help me.
            $endgroup$
            – amoogae
            Dec 5 '18 at 16:56
















          1












          $begingroup$

          Neither statement is true.



          Let $Sigma = {P_1lor P_2, Q_1lor Q_2}$, and $alpha = (P_1lor P_2) land (Q_1lor Q_2)$.



          Then $Sigmamodels alpha$, but there is no $sigmain Sigma$ such that $sigmamodels alpha$.



          Similarly, for "conjunction forms" instead of "disjunction forms", let $Sigma = {P_1land P_2, Q_1land Q_2}$, and $alpha = (P_1land P_2) land (Q_1land Q_2)$.





          Edit: In response to the comments, I'll prove the following.



          Suppose $Sigma$ is a nonempty set of disjunctions of literals, such that for every propositional variable $p$, at most one of the literals $p$ and $lnot p$ occurs in $Sigma$. And suppose $alpha$ is a disjunction of literals. If $Sigmamodels alpha$, then there is some $sigmain Sigma$ such that $sigmamodels alpha$.



          Case 1: There is some propositional variable $p$ such that both of the literals $p$ and $lnot p$ occur in $alpha$. Then $alpha$ is a tautology, so $sigmamodels alpha$ for any $sigmain Sigma$.



          Case 2: There is some $sigmain Sigma$ such that every literal occuring in $sigma$ occurs in $alpha$. Then we are done, since $sigmamodels alpha$.



          We will show that if we assume we are not in Case 1 or Case 2, we have a contradiction. Since we are not in Case 2, for every $sigmain Sigma$, we can pick some literal $l_sigma$ which appears in $sigma$ but not in $alpha$.



          Let $M$ be a model/interpretation such that the literals ${l_sigmamid sigmain Sigma}$ are all true, and the literals appearing in $alpha$ are all false. We can do this, because:




          1. We have arranged that no literal $l_sigma$ appears in $alpha$.

          2. Since we are not in Case 1, no literal and its negation both appear in $alpha$.

          3. By hypothesis, no literal and its negation both appear in ${l_sigmamid sigmain Sigma}$, since all these literals appear in $Sigma$.


          But then for each $sigmain Sigma$, we have $Mmodels l_sigma$, so $Mmodels sigma$, and hence $Mmodels Sigma$. But $Mnotmodels alpha$. So $Sigmanotmodels alpha$, contradiction.






          share|cite|improve this answer











          $endgroup$













          • $begingroup$
            Sorry. It seems to require more conditions. I will fix my question. Please read it again. Thanks to your answers.
            $endgroup$
            – amoogae
            Dec 4 '18 at 11:36










          • $begingroup$
            I've edited my answer in response to your edited question. Why do you think something like this should be true?
            $endgroup$
            – Alex Kruckman
            Dec 4 '18 at 14:45










          • $begingroup$
            Thank you. I am trying to prove enderton's exercise 1.2.10 (c) using the conjunctive normal form. Perhaps I misunderstood something. Finally, if $alpha$ is also a disjunction form, then the above proposition is true?
            $endgroup$
            – amoogae
            Dec 5 '18 at 11:09












          • $begingroup$
            Yes, I think it's true if $alpha$ is also a disjunction form.
            $endgroup$
            – Alex Kruckman
            Dec 5 '18 at 14:05










          • $begingroup$
            How can I prove if $alpha$ is also a disjunction form. Please help me.
            $endgroup$
            – amoogae
            Dec 5 '18 at 16:56














          1












          1








          1





          $begingroup$

          Neither statement is true.



          Let $Sigma = {P_1lor P_2, Q_1lor Q_2}$, and $alpha = (P_1lor P_2) land (Q_1lor Q_2)$.



          Then $Sigmamodels alpha$, but there is no $sigmain Sigma$ such that $sigmamodels alpha$.



          Similarly, for "conjunction forms" instead of "disjunction forms", let $Sigma = {P_1land P_2, Q_1land Q_2}$, and $alpha = (P_1land P_2) land (Q_1land Q_2)$.





          Edit: In response to the comments, I'll prove the following.



          Suppose $Sigma$ is a nonempty set of disjunctions of literals, such that for every propositional variable $p$, at most one of the literals $p$ and $lnot p$ occurs in $Sigma$. And suppose $alpha$ is a disjunction of literals. If $Sigmamodels alpha$, then there is some $sigmain Sigma$ such that $sigmamodels alpha$.



          Case 1: There is some propositional variable $p$ such that both of the literals $p$ and $lnot p$ occur in $alpha$. Then $alpha$ is a tautology, so $sigmamodels alpha$ for any $sigmain Sigma$.



          Case 2: There is some $sigmain Sigma$ such that every literal occuring in $sigma$ occurs in $alpha$. Then we are done, since $sigmamodels alpha$.



          We will show that if we assume we are not in Case 1 or Case 2, we have a contradiction. Since we are not in Case 2, for every $sigmain Sigma$, we can pick some literal $l_sigma$ which appears in $sigma$ but not in $alpha$.



          Let $M$ be a model/interpretation such that the literals ${l_sigmamid sigmain Sigma}$ are all true, and the literals appearing in $alpha$ are all false. We can do this, because:




          1. We have arranged that no literal $l_sigma$ appears in $alpha$.

          2. Since we are not in Case 1, no literal and its negation both appear in $alpha$.

          3. By hypothesis, no literal and its negation both appear in ${l_sigmamid sigmain Sigma}$, since all these literals appear in $Sigma$.


          But then for each $sigmain Sigma$, we have $Mmodels l_sigma$, so $Mmodels sigma$, and hence $Mmodels Sigma$. But $Mnotmodels alpha$. So $Sigmanotmodels alpha$, contradiction.






          share|cite|improve this answer











          $endgroup$



          Neither statement is true.



          Let $Sigma = {P_1lor P_2, Q_1lor Q_2}$, and $alpha = (P_1lor P_2) land (Q_1lor Q_2)$.



          Then $Sigmamodels alpha$, but there is no $sigmain Sigma$ such that $sigmamodels alpha$.



          Similarly, for "conjunction forms" instead of "disjunction forms", let $Sigma = {P_1land P_2, Q_1land Q_2}$, and $alpha = (P_1land P_2) land (Q_1land Q_2)$.





          Edit: In response to the comments, I'll prove the following.



          Suppose $Sigma$ is a nonempty set of disjunctions of literals, such that for every propositional variable $p$, at most one of the literals $p$ and $lnot p$ occurs in $Sigma$. And suppose $alpha$ is a disjunction of literals. If $Sigmamodels alpha$, then there is some $sigmain Sigma$ such that $sigmamodels alpha$.



          Case 1: There is some propositional variable $p$ such that both of the literals $p$ and $lnot p$ occur in $alpha$. Then $alpha$ is a tautology, so $sigmamodels alpha$ for any $sigmain Sigma$.



          Case 2: There is some $sigmain Sigma$ such that every literal occuring in $sigma$ occurs in $alpha$. Then we are done, since $sigmamodels alpha$.



          We will show that if we assume we are not in Case 1 or Case 2, we have a contradiction. Since we are not in Case 2, for every $sigmain Sigma$, we can pick some literal $l_sigma$ which appears in $sigma$ but not in $alpha$.



          Let $M$ be a model/interpretation such that the literals ${l_sigmamid sigmain Sigma}$ are all true, and the literals appearing in $alpha$ are all false. We can do this, because:




          1. We have arranged that no literal $l_sigma$ appears in $alpha$.

          2. Since we are not in Case 1, no literal and its negation both appear in $alpha$.

          3. By hypothesis, no literal and its negation both appear in ${l_sigmamid sigmain Sigma}$, since all these literals appear in $Sigma$.


          But then for each $sigmain Sigma$, we have $Mmodels l_sigma$, so $Mmodels sigma$, and hence $Mmodels Sigma$. But $Mnotmodels alpha$. So $Sigmanotmodels alpha$, contradiction.







          share|cite|improve this answer














          share|cite|improve this answer



          share|cite|improve this answer








          edited Dec 5 '18 at 17:30

























          answered Dec 4 '18 at 1:08









          Alex KruckmanAlex Kruckman

          26.9k22556




          26.9k22556












          • $begingroup$
            Sorry. It seems to require more conditions. I will fix my question. Please read it again. Thanks to your answers.
            $endgroup$
            – amoogae
            Dec 4 '18 at 11:36










          • $begingroup$
            I've edited my answer in response to your edited question. Why do you think something like this should be true?
            $endgroup$
            – Alex Kruckman
            Dec 4 '18 at 14:45










          • $begingroup$
            Thank you. I am trying to prove enderton's exercise 1.2.10 (c) using the conjunctive normal form. Perhaps I misunderstood something. Finally, if $alpha$ is also a disjunction form, then the above proposition is true?
            $endgroup$
            – amoogae
            Dec 5 '18 at 11:09












          • $begingroup$
            Yes, I think it's true if $alpha$ is also a disjunction form.
            $endgroup$
            – Alex Kruckman
            Dec 5 '18 at 14:05










          • $begingroup$
            How can I prove if $alpha$ is also a disjunction form. Please help me.
            $endgroup$
            – amoogae
            Dec 5 '18 at 16:56


















          • $begingroup$
            Sorry. It seems to require more conditions. I will fix my question. Please read it again. Thanks to your answers.
            $endgroup$
            – amoogae
            Dec 4 '18 at 11:36










          • $begingroup$
            I've edited my answer in response to your edited question. Why do you think something like this should be true?
            $endgroup$
            – Alex Kruckman
            Dec 4 '18 at 14:45










          • $begingroup$
            Thank you. I am trying to prove enderton's exercise 1.2.10 (c) using the conjunctive normal form. Perhaps I misunderstood something. Finally, if $alpha$ is also a disjunction form, then the above proposition is true?
            $endgroup$
            – amoogae
            Dec 5 '18 at 11:09












          • $begingroup$
            Yes, I think it's true if $alpha$ is also a disjunction form.
            $endgroup$
            – Alex Kruckman
            Dec 5 '18 at 14:05










          • $begingroup$
            How can I prove if $alpha$ is also a disjunction form. Please help me.
            $endgroup$
            – amoogae
            Dec 5 '18 at 16:56
















          $begingroup$
          Sorry. It seems to require more conditions. I will fix my question. Please read it again. Thanks to your answers.
          $endgroup$
          – amoogae
          Dec 4 '18 at 11:36




          $begingroup$
          Sorry. It seems to require more conditions. I will fix my question. Please read it again. Thanks to your answers.
          $endgroup$
          – amoogae
          Dec 4 '18 at 11:36












          $begingroup$
          I've edited my answer in response to your edited question. Why do you think something like this should be true?
          $endgroup$
          – Alex Kruckman
          Dec 4 '18 at 14:45




          $begingroup$
          I've edited my answer in response to your edited question. Why do you think something like this should be true?
          $endgroup$
          – Alex Kruckman
          Dec 4 '18 at 14:45












          $begingroup$
          Thank you. I am trying to prove enderton's exercise 1.2.10 (c) using the conjunctive normal form. Perhaps I misunderstood something. Finally, if $alpha$ is also a disjunction form, then the above proposition is true?
          $endgroup$
          – amoogae
          Dec 5 '18 at 11:09






          $begingroup$
          Thank you. I am trying to prove enderton's exercise 1.2.10 (c) using the conjunctive normal form. Perhaps I misunderstood something. Finally, if $alpha$ is also a disjunction form, then the above proposition is true?
          $endgroup$
          – amoogae
          Dec 5 '18 at 11:09














          $begingroup$
          Yes, I think it's true if $alpha$ is also a disjunction form.
          $endgroup$
          – Alex Kruckman
          Dec 5 '18 at 14:05




          $begingroup$
          Yes, I think it's true if $alpha$ is also a disjunction form.
          $endgroup$
          – Alex Kruckman
          Dec 5 '18 at 14:05












          $begingroup$
          How can I prove if $alpha$ is also a disjunction form. Please help me.
          $endgroup$
          – amoogae
          Dec 5 '18 at 16:56




          $begingroup$
          How can I prove if $alpha$ is also a disjunction form. Please help me.
          $endgroup$
          – amoogae
          Dec 5 '18 at 16:56











          -1












          $begingroup$

          Hint: For every propositional formula $phi$ there is an equivalent formula $psi$ in conjunctive normal form, that is,



          $$ psi = bigwedge^{m}_{i=1} (bigvee^{m_i}_{j=1} ell_{ij}) $$



          where the $ell_{ij}$'s are literals. And there is a similar result for disjunctive normal forms.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            This is true, but I don't see how it serves as a hint for the question...
            $endgroup$
            – Alex Kruckman
            Dec 4 '18 at 1:09
















          -1












          $begingroup$

          Hint: For every propositional formula $phi$ there is an equivalent formula $psi$ in conjunctive normal form, that is,



          $$ psi = bigwedge^{m}_{i=1} (bigvee^{m_i}_{j=1} ell_{ij}) $$



          where the $ell_{ij}$'s are literals. And there is a similar result for disjunctive normal forms.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            This is true, but I don't see how it serves as a hint for the question...
            $endgroup$
            – Alex Kruckman
            Dec 4 '18 at 1:09














          -1












          -1








          -1





          $begingroup$

          Hint: For every propositional formula $phi$ there is an equivalent formula $psi$ in conjunctive normal form, that is,



          $$ psi = bigwedge^{m}_{i=1} (bigvee^{m_i}_{j=1} ell_{ij}) $$



          where the $ell_{ij}$'s are literals. And there is a similar result for disjunctive normal forms.






          share|cite|improve this answer









          $endgroup$



          Hint: For every propositional formula $phi$ there is an equivalent formula $psi$ in conjunctive normal form, that is,



          $$ psi = bigwedge^{m}_{i=1} (bigvee^{m_i}_{j=1} ell_{ij}) $$



          where the $ell_{ij}$'s are literals. And there is a similar result for disjunctive normal forms.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Dec 3 '18 at 11:58









          Hans HüttelHans Hüttel

          3,1972921




          3,1972921












          • $begingroup$
            This is true, but I don't see how it serves as a hint for the question...
            $endgroup$
            – Alex Kruckman
            Dec 4 '18 at 1:09


















          • $begingroup$
            This is true, but I don't see how it serves as a hint for the question...
            $endgroup$
            – Alex Kruckman
            Dec 4 '18 at 1:09
















          $begingroup$
          This is true, but I don't see how it serves as a hint for the question...
          $endgroup$
          – Alex Kruckman
          Dec 4 '18 at 1:09




          $begingroup$
          This is true, but I don't see how it serves as a hint for the question...
          $endgroup$
          – Alex Kruckman
          Dec 4 '18 at 1:09


















          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%2f3023933%2flogic-problem-about-set-of-disjunction-formsfixed%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