Can the CNF be the negation of the DNF? The Next CEO of Stack OverflowGetting the CNF and DNF (Logic)Giving this formula in DNF and CNF propositional logicTurning CNF into DNFConverting DNF to CNF and vice versaNegation in Disjunctive Normal FormProve that any truth function $f$ can be represented by a formula $φ$ in cnf by negating a formula in dnfIs this the disjunctive and conjunctive nromal form for my porpositional formula F?Are my DNF and CNF for $A land (A lor C) implies (C lor B)$ correct?CNF quantifier eliminationIs it possible to get the CNF out of the DNF of this expression

Make solar eclipses exceedingly rare, but still have new moons

Is wanting to ask what to write an indication that you need to change your story?

Why is the US ranked as #45 in Press Freedom ratings, despite its extremely permissive free speech laws?

How to edit “Name” property in GCI output?

What connection does MS Office have to Netscape Navigator?

Why isn't acceleration always zero whenever velocity is zero, such as the moment a ball bounces off a wall?

How to avoid supervisors with prejudiced views?

Can a Bladesinger Wizard use Bladesong with a Hand Crossbow?

INSERT to a table from a database to other (same SQL Server) using Dynamic SQL

Chain wire methods together in Lightning Web Components

Solving system of ODEs with extra parameter

What flight has the highest ratio of time difference to flight time?

Is it professional to write unrelated content in an almost-empty email?

Why does standard notation not preserve intervals (visually)

Is there a way to save my career from absolute disaster?

Why is my new battery behaving weirdly?

"misplaced omit" error when >centering columns

Proper way to express "He disappeared them"

If Nick Fury and Coulson already knew about aliens (Kree and Skrull) why did they wait until Thor's appearance to start making weapons?

Can we say or write : "No, it'sn't"?

Why is quantifier elimination desirable for a given theory?

Is a distribution that is normal, but highly skewed considered Gaussian?

I want to delete every two lines after 3rd lines in file contain very large number of lines :

Method for adding error messages to a dictionary given a key



Can the CNF be the negation of the DNF?



The Next CEO of Stack OverflowGetting the CNF and DNF (Logic)Giving this formula in DNF and CNF propositional logicTurning CNF into DNFConverting DNF to CNF and vice versaNegation in Disjunctive Normal FormProve that any truth function $f$ can be represented by a formula $φ$ in cnf by negating a formula in dnfIs this the disjunctive and conjunctive nromal form for my porpositional formula F?Are my DNF and CNF for $A land (A lor C) implies (C lor B)$ correct?CNF quantifier eliminationIs it possible to get the CNF out of the DNF of this expression










1












$begingroup$


I've got the following question: Asking for the CNF of the following formula:
$$(lnot X lor Y)to bigl( Zlandlnot(lnot Yland X) bigr)$$
So the process should be like that:
$$lnot (lnot X lor Y)lor bigl( Zland (Ylor lnot X)bigr)$$
$$(Xland lnot Y)lor bigl((Zland Y)lor (Zland lnot X)bigr) $$
$$ (Xland lnot Y)lor (Zland Y)lor (Zland lnot X) $$
As we can see, It's nothing other than the DNF of the above formula, Can i say that the CNF is just the negation of this DNF?



The negation of this DNF looks like the following:
$$ (lnot Xlor Y)land (lnot Zlor lnot Y)land (lnot Zlor X) $$
Is it correct to say that this is the CNF of the above formula?



Thanks!!!










share|cite|improve this question









$endgroup$











  • $begingroup$
    What you've found is a CNF, but not that of the above formula. It is a CNF of the negation.
    $endgroup$
    – user376343
    Mar 27 at 20:25










  • $begingroup$
    if you can use Karnaugh maps, do as follows: from K.map of the given formula you get easily the map of the negation, and also the DNF of the negation. Then you can use your trick to obtain the CNF it the given formula.
    $endgroup$
    – user376343
    Mar 27 at 20:35















1












$begingroup$


I've got the following question: Asking for the CNF of the following formula:
$$(lnot X lor Y)to bigl( Zlandlnot(lnot Yland X) bigr)$$
So the process should be like that:
$$lnot (lnot X lor Y)lor bigl( Zland (Ylor lnot X)bigr)$$
$$(Xland lnot Y)lor bigl((Zland Y)lor (Zland lnot X)bigr) $$
$$ (Xland lnot Y)lor (Zland Y)lor (Zland lnot X) $$
As we can see, It's nothing other than the DNF of the above formula, Can i say that the CNF is just the negation of this DNF?



The negation of this DNF looks like the following:
$$ (lnot Xlor Y)land (lnot Zlor lnot Y)land (lnot Zlor X) $$
Is it correct to say that this is the CNF of the above formula?



Thanks!!!










share|cite|improve this question









$endgroup$











  • $begingroup$
    What you've found is a CNF, but not that of the above formula. It is a CNF of the negation.
    $endgroup$
    – user376343
    Mar 27 at 20:25










  • $begingroup$
    if you can use Karnaugh maps, do as follows: from K.map of the given formula you get easily the map of the negation, and also the DNF of the negation. Then you can use your trick to obtain the CNF it the given formula.
    $endgroup$
    – user376343
    Mar 27 at 20:35













1












1








1





$begingroup$


I've got the following question: Asking for the CNF of the following formula:
$$(lnot X lor Y)to bigl( Zlandlnot(lnot Yland X) bigr)$$
So the process should be like that:
$$lnot (lnot X lor Y)lor bigl( Zland (Ylor lnot X)bigr)$$
$$(Xland lnot Y)lor bigl((Zland Y)lor (Zland lnot X)bigr) $$
$$ (Xland lnot Y)lor (Zland Y)lor (Zland lnot X) $$
As we can see, It's nothing other than the DNF of the above formula, Can i say that the CNF is just the negation of this DNF?



The negation of this DNF looks like the following:
$$ (lnot Xlor Y)land (lnot Zlor lnot Y)land (lnot Zlor X) $$
Is it correct to say that this is the CNF of the above formula?



Thanks!!!










share|cite|improve this question









$endgroup$




I've got the following question: Asking for the CNF of the following formula:
$$(lnot X lor Y)to bigl( Zlandlnot(lnot Yland X) bigr)$$
So the process should be like that:
$$lnot (lnot X lor Y)lor bigl( Zland (Ylor lnot X)bigr)$$
$$(Xland lnot Y)lor bigl((Zland Y)lor (Zland lnot X)bigr) $$
$$ (Xland lnot Y)lor (Zland Y)lor (Zland lnot X) $$
As we can see, It's nothing other than the DNF of the above formula, Can i say that the CNF is just the negation of this DNF?



The negation of this DNF looks like the following:
$$ (lnot Xlor Y)land (lnot Zlor lnot Y)land (lnot Zlor X) $$
Is it correct to say that this is the CNF of the above formula?



Thanks!!!







logic






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Mar 27 at 19:48









D.RotnemerD.Rotnemer

13316




13316











  • $begingroup$
    What you've found is a CNF, but not that of the above formula. It is a CNF of the negation.
    $endgroup$
    – user376343
    Mar 27 at 20:25










  • $begingroup$
    if you can use Karnaugh maps, do as follows: from K.map of the given formula you get easily the map of the negation, and also the DNF of the negation. Then you can use your trick to obtain the CNF it the given formula.
    $endgroup$
    – user376343
    Mar 27 at 20:35
















  • $begingroup$
    What you've found is a CNF, but not that of the above formula. It is a CNF of the negation.
    $endgroup$
    – user376343
    Mar 27 at 20:25










  • $begingroup$
    if you can use Karnaugh maps, do as follows: from K.map of the given formula you get easily the map of the negation, and also the DNF of the negation. Then you can use your trick to obtain the CNF it the given formula.
    $endgroup$
    – user376343
    Mar 27 at 20:35















$begingroup$
What you've found is a CNF, but not that of the above formula. It is a CNF of the negation.
$endgroup$
– user376343
Mar 27 at 20:25




$begingroup$
What you've found is a CNF, but not that of the above formula. It is a CNF of the negation.
$endgroup$
– user376343
Mar 27 at 20:25












$begingroup$
if you can use Karnaugh maps, do as follows: from K.map of the given formula you get easily the map of the negation, and also the DNF of the negation. Then you can use your trick to obtain the CNF it the given formula.
$endgroup$
– user376343
Mar 27 at 20:35




$begingroup$
if you can use Karnaugh maps, do as follows: from K.map of the given formula you get easily the map of the negation, and also the DNF of the negation. Then you can use your trick to obtain the CNF it the given formula.
$endgroup$
– user376343
Mar 27 at 20:35










1 Answer
1






active

oldest

votes


















2












$begingroup$

No, you cannot say that a CNF is the negation of the DNF, because it certainly is not so.



The normal forms of a statement are equivalent to that statement, and hence to each other.



$(Xlandlnot Y)lor (Zland Y)lor (Zlandlnot X)$ is a DNF for the statement, as is the simpler $(Xlandlnot Y)lor Z$.   (Use distribution, commutation, de Morgan's, and absorption.)



Thus a CNF for that statement would be $(Xlor Z)land(lnot Ylor Z)$






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%2f3165033%2fcan-the-cnf-be-the-negation-of-the-dnf%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$

    No, you cannot say that a CNF is the negation of the DNF, because it certainly is not so.



    The normal forms of a statement are equivalent to that statement, and hence to each other.



    $(Xlandlnot Y)lor (Zland Y)lor (Zlandlnot X)$ is a DNF for the statement, as is the simpler $(Xlandlnot Y)lor Z$.   (Use distribution, commutation, de Morgan's, and absorption.)



    Thus a CNF for that statement would be $(Xlor Z)land(lnot Ylor Z)$






    share|cite|improve this answer









    $endgroup$

















      2












      $begingroup$

      No, you cannot say that a CNF is the negation of the DNF, because it certainly is not so.



      The normal forms of a statement are equivalent to that statement, and hence to each other.



      $(Xlandlnot Y)lor (Zland Y)lor (Zlandlnot X)$ is a DNF for the statement, as is the simpler $(Xlandlnot Y)lor Z$.   (Use distribution, commutation, de Morgan's, and absorption.)



      Thus a CNF for that statement would be $(Xlor Z)land(lnot Ylor Z)$






      share|cite|improve this answer









      $endgroup$















        2












        2








        2





        $begingroup$

        No, you cannot say that a CNF is the negation of the DNF, because it certainly is not so.



        The normal forms of a statement are equivalent to that statement, and hence to each other.



        $(Xlandlnot Y)lor (Zland Y)lor (Zlandlnot X)$ is a DNF for the statement, as is the simpler $(Xlandlnot Y)lor Z$.   (Use distribution, commutation, de Morgan's, and absorption.)



        Thus a CNF for that statement would be $(Xlor Z)land(lnot Ylor Z)$






        share|cite|improve this answer









        $endgroup$



        No, you cannot say that a CNF is the negation of the DNF, because it certainly is not so.



        The normal forms of a statement are equivalent to that statement, and hence to each other.



        $(Xlandlnot Y)lor (Zland Y)lor (Zlandlnot X)$ is a DNF for the statement, as is the simpler $(Xlandlnot Y)lor Z$.   (Use distribution, commutation, de Morgan's, and absorption.)



        Thus a CNF for that statement would be $(Xlor Z)land(lnot Ylor Z)$







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Mar 27 at 22:40









        Graham KempGraham Kemp

        87.6k43578




        87.6k43578



























            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%2f3165033%2fcan-the-cnf-be-the-negation-of-the-dnf%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

            Triangular numbers and gcdProving sum of a set is $0 pmod n$ if $n$ is odd, or $fracn2 pmod n$ if $n$ is even?Is greatest common divisor of two numbers really their smallest linear combination?GCD, LCM RelationshipProve a set of nonnegative integers with greatest common divisor 1 and closed under addition has all but finite many nonnegative integers.all pairs of a and b in an equation containing gcdTriangular Numbers Modulo $k$ - Hit All Values?Understanding the Existence and Uniqueness of the GCDGCD and LCM with logical symbolsThe greatest common divisor of two positive integers less than 100 is equal to 3. Their least common multiple is twelve times one of the integers.Suppose that for all integers $x$, $x|a$ and $x|b$ if and only if $x|c$. Then $c = gcd(a,b)$Which is the gcd of 2 numbers which are multiplied and the result is 600000?

            Ingelân Ynhâld Etymology | Geografy | Skiednis | Polityk en bestjoer | Ekonomy | Demografy | Kultuer | Klimaat | Sjoch ek | Keppelings om utens | Boarnen, noaten en referinsjes Navigaasjemenuwww.gov.ukOffisjele webside fan it regear fan it Feriene KeninkrykOffisjele webside fan it Britske FerkearsburoNederlânsktalige ynformaasje fan it Britske FerkearsburoOffisjele webside fan English Heritage, de organisaasje dy't him ynset foar it behâld fan it Ingelske kultuergoedYnwennertallen fan alle Britske stêden út 'e folkstelling fan 2011Notes en References, op dizze sideEngland

            Հադիս Բովանդակություն Անվանում և նշանակություն | Դասակարգում | Աղբյուրներ | Նավարկման ցանկ