Can the CNF be the negation of the DNF? Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern)Getting 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
Is there hard evidence that the grant peer review system performs significantly better than random?
Converted a Scalar function to a TVF function for parallel execution-Still running in Serial mode
How many serial ports are on the Pi 3?
Putting class ranking in CV, but against dept guidelines
What order were files/directories outputted in dir?
Did Mueller's report provide an evidentiary basis for the claim of Russian govt election interference via social media?
How to make a Field only accept Numbers in Magento 2
Can anything be seen from the center of the Boötes void? How dark would it be?
Has negative voting ever been officially implemented in elections, or seriously proposed, or even studied?
"Lost his faith in humanity in the trenches of Verdun" — last line of an SF story
How come Sam didn't become Lord of Horn Hill?
QGIS virtual layer functionality does not seem to support memory layers
Take 2! Is this homebrew Lady of Pain warlock patron balanced?
Most bit efficient text communication method?
Using audio cues to encourage good posture
Crossing US/Canada Border for less than 24 hours
Why do we bend a book to keep it straight?
Did any compiler fully use 80-bit floating point?
What does Turing mean by this statement?
If Windows 7 doesn't support WSL, then what does Linux subsystem option mean?
What was the first language to use conditional keywords?
How do living politicians protect their readily obtainable signatures from misuse?
Project Euler #1 in C++
Why is Nikon 1.4g better when Nikon 1.8g is sharper?
Can the CNF be the negation of the DNF?
Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern)Getting 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
$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!!!
logic
$endgroup$
add a comment |
$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!!!
logic
$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
add a comment |
$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!!!
logic
$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
logic
asked Mar 27 at 19:48
D.RotnemerD.Rotnemer
14016
14016
$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
add a comment |
$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
add a comment |
1 Answer
1
active
oldest
votes
$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)$
$endgroup$
add a comment |
Your Answer
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
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
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
$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)$
$endgroup$
add a comment |
$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)$
$endgroup$
add a comment |
$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)$
$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)$
answered Mar 27 at 22:40
Graham KempGraham Kemp
88.1k43579
88.1k43579
add a comment |
add a comment |
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.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
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
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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
$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