How to convert $((Alor B)land ((Bleftrightarrow A)rightarrow C))lor(Crightarrow lnot A)$ into CNF.
Clash Royale CLAN TAG#URR8PPP
up vote
1
down vote
favorite
I started off with:
$$((Alor B)land ((Bleftrightarrow A)rightarrow C))lor(Crightarrow lnot A)$$
And I've managed to get to:
$$((Alor B) land (((Bland lnot A) lor (A land lnot B)) lor C)) lor (lnot C lor lnot A)$$
How do I finish and get this into CNF?
logic propositional-calculus
 |Â
show 2 more comments
up vote
1
down vote
favorite
I started off with:
$$((Alor B)land ((Bleftrightarrow A)rightarrow C))lor(Crightarrow lnot A)$$
And I've managed to get to:
$$((Alor B) land (((Bland lnot A) lor (A land lnot B)) lor C)) lor (lnot C lor lnot A)$$
How do I finish and get this into CNF?
logic propositional-calculus
Don't you mean $Bwedgelnot A$?
â Rushabh Mehta
Aug 6 at 21:18
Typo? That should be $((Alor B) land (((Blandlnot A) lor (A land lnot B)) lor C)) lor (lnot C lor lnot A)$
â Graham Kemp
Aug 6 at 21:18
@GrahamKemp You're right, fixed the typo thanks
â random.string
Aug 6 at 21:20
*right sorry for being a grammar nazi
â Rushabh Mehta
Aug 6 at 21:21
Since there are only 3 variables, have you considered making a truth table?
â ÃÂlon Djurinsky
Aug 6 at 21:22
 |Â
show 2 more comments
up vote
1
down vote
favorite
up vote
1
down vote
favorite
I started off with:
$$((Alor B)land ((Bleftrightarrow A)rightarrow C))lor(Crightarrow lnot A)$$
And I've managed to get to:
$$((Alor B) land (((Bland lnot A) lor (A land lnot B)) lor C)) lor (lnot C lor lnot A)$$
How do I finish and get this into CNF?
logic propositional-calculus
I started off with:
$$((Alor B)land ((Bleftrightarrow A)rightarrow C))lor(Crightarrow lnot A)$$
And I've managed to get to:
$$((Alor B) land (((Bland lnot A) lor (A land lnot B)) lor C)) lor (lnot C lor lnot A)$$
How do I finish and get this into CNF?
logic propositional-calculus
edited Aug 6 at 21:54
Shaun
7,41792972
7,41792972
asked Aug 6 at 21:08
random.string
113
113
Don't you mean $Bwedgelnot A$?
â Rushabh Mehta
Aug 6 at 21:18
Typo? That should be $((Alor B) land (((Blandlnot A) lor (A land lnot B)) lor C)) lor (lnot C lor lnot A)$
â Graham Kemp
Aug 6 at 21:18
@GrahamKemp You're right, fixed the typo thanks
â random.string
Aug 6 at 21:20
*right sorry for being a grammar nazi
â Rushabh Mehta
Aug 6 at 21:21
Since there are only 3 variables, have you considered making a truth table?
â ÃÂlon Djurinsky
Aug 6 at 21:22
 |Â
show 2 more comments
Don't you mean $Bwedgelnot A$?
â Rushabh Mehta
Aug 6 at 21:18
Typo? That should be $((Alor B) land (((Blandlnot A) lor (A land lnot B)) lor C)) lor (lnot C lor lnot A)$
â Graham Kemp
Aug 6 at 21:18
@GrahamKemp You're right, fixed the typo thanks
â random.string
Aug 6 at 21:20
*right sorry for being a grammar nazi
â Rushabh Mehta
Aug 6 at 21:21
Since there are only 3 variables, have you considered making a truth table?
â ÃÂlon Djurinsky
Aug 6 at 21:22
Don't you mean $Bwedgelnot A$?
â Rushabh Mehta
Aug 6 at 21:18
Don't you mean $Bwedgelnot A$?
â Rushabh Mehta
Aug 6 at 21:18
Typo? That should be $((Alor B) land (((Blandlnot A) lor (A land lnot B)) lor C)) lor (lnot C lor lnot A)$
â Graham Kemp
Aug 6 at 21:18
Typo? That should be $((Alor B) land (((Blandlnot A) lor (A land lnot B)) lor C)) lor (lnot C lor lnot A)$
â Graham Kemp
Aug 6 at 21:18
@GrahamKemp You're right, fixed the typo thanks
â random.string
Aug 6 at 21:20
@GrahamKemp You're right, fixed the typo thanks
â random.string
Aug 6 at 21:20
*right sorry for being a grammar nazi
â Rushabh Mehta
Aug 6 at 21:21
*right sorry for being a grammar nazi
â Rushabh Mehta
Aug 6 at 21:21
Since there are only 3 variables, have you considered making a truth table?
â ÃÂlon Djurinsky
Aug 6 at 21:22
Since there are only 3 variables, have you considered making a truth table?
â ÃÂlon Djurinsky
Aug 6 at 21:22
 |Â
show 2 more comments
2 Answers
2
active
oldest
votes
up vote
1
down vote
Note that if $lnot (Awedge C)$, this expression is true, so we don't need to consider the other expression. Hence, we only need to consider the larger clause for the case that $(Awedge C)$ is true.
Hence, $(Avee B)$ is always true, so a true statement conjuncted with another statement is logically equivalent to that other statement.
So, so far we have
$$((Bland lnot A) lor (A land lnot B)) lor C) lor (lnot C lor lnot A)$$
Next, note that under our assumption that $C$ is true, we know that the inner expression is a clause disjuncted into $C$, which means it is always true.
Hence, this expression can never be not true. The simplest CNF that could be made for this expression is $(Cveelnot C)$.
add a comment |Â
up vote
0
down vote
Hint: $neg(Aleftrightarrow B)$ $equiv (Awedgeneg B)vee(neg Awedge B)\ equiv (Avee B)wedge(neg Aveeneg B) $
add a comment |Â
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
1
down vote
Note that if $lnot (Awedge C)$, this expression is true, so we don't need to consider the other expression. Hence, we only need to consider the larger clause for the case that $(Awedge C)$ is true.
Hence, $(Avee B)$ is always true, so a true statement conjuncted with another statement is logically equivalent to that other statement.
So, so far we have
$$((Bland lnot A) lor (A land lnot B)) lor C) lor (lnot C lor lnot A)$$
Next, note that under our assumption that $C$ is true, we know that the inner expression is a clause disjuncted into $C$, which means it is always true.
Hence, this expression can never be not true. The simplest CNF that could be made for this expression is $(Cveelnot C)$.
add a comment |Â
up vote
1
down vote
Note that if $lnot (Awedge C)$, this expression is true, so we don't need to consider the other expression. Hence, we only need to consider the larger clause for the case that $(Awedge C)$ is true.
Hence, $(Avee B)$ is always true, so a true statement conjuncted with another statement is logically equivalent to that other statement.
So, so far we have
$$((Bland lnot A) lor (A land lnot B)) lor C) lor (lnot C lor lnot A)$$
Next, note that under our assumption that $C$ is true, we know that the inner expression is a clause disjuncted into $C$, which means it is always true.
Hence, this expression can never be not true. The simplest CNF that could be made for this expression is $(Cveelnot C)$.
add a comment |Â
up vote
1
down vote
up vote
1
down vote
Note that if $lnot (Awedge C)$, this expression is true, so we don't need to consider the other expression. Hence, we only need to consider the larger clause for the case that $(Awedge C)$ is true.
Hence, $(Avee B)$ is always true, so a true statement conjuncted with another statement is logically equivalent to that other statement.
So, so far we have
$$((Bland lnot A) lor (A land lnot B)) lor C) lor (lnot C lor lnot A)$$
Next, note that under our assumption that $C$ is true, we know that the inner expression is a clause disjuncted into $C$, which means it is always true.
Hence, this expression can never be not true. The simplest CNF that could be made for this expression is $(Cveelnot C)$.
Note that if $lnot (Awedge C)$, this expression is true, so we don't need to consider the other expression. Hence, we only need to consider the larger clause for the case that $(Awedge C)$ is true.
Hence, $(Avee B)$ is always true, so a true statement conjuncted with another statement is logically equivalent to that other statement.
So, so far we have
$$((Bland lnot A) lor (A land lnot B)) lor C) lor (lnot C lor lnot A)$$
Next, note that under our assumption that $C$ is true, we know that the inner expression is a clause disjuncted into $C$, which means it is always true.
Hence, this expression can never be not true. The simplest CNF that could be made for this expression is $(Cveelnot C)$.
edited Aug 6 at 21:29
answered Aug 6 at 21:24
Rushabh Mehta
1,060114
1,060114
add a comment |Â
add a comment |Â
up vote
0
down vote
Hint: $neg(Aleftrightarrow B)$ $equiv (Awedgeneg B)vee(neg Awedge B)\ equiv (Avee B)wedge(neg Aveeneg B) $
add a comment |Â
up vote
0
down vote
Hint: $neg(Aleftrightarrow B)$ $equiv (Awedgeneg B)vee(neg Awedge B)\ equiv (Avee B)wedge(neg Aveeneg B) $
add a comment |Â
up vote
0
down vote
up vote
0
down vote
Hint: $neg(Aleftrightarrow B)$ $equiv (Awedgeneg B)vee(neg Awedge B)\ equiv (Avee B)wedge(neg Aveeneg B) $
Hint: $neg(Aleftrightarrow B)$ $equiv (Awedgeneg B)vee(neg Awedge B)\ equiv (Avee B)wedge(neg Aveeneg B) $
answered Aug 6 at 21:23
Graham Kemp
80.1k43275
80.1k43275
add a comment |Â
add a comment |Â
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
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2874316%2fhow-to-convert-a-lor-b-land-b-leftrightarrow-a-rightarrow-c-lorc-right%23new-answer', 'question_page');
);
Post as a guest
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
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
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
Don't you mean $Bwedgelnot A$?
â Rushabh Mehta
Aug 6 at 21:18
Typo? That should be $((Alor B) land (((Blandlnot A) lor (A land lnot B)) lor C)) lor (lnot C lor lnot A)$
â Graham Kemp
Aug 6 at 21:18
@GrahamKemp You're right, fixed the typo thanks
â random.string
Aug 6 at 21:20
*right sorry for being a grammar nazi
â Rushabh Mehta
Aug 6 at 21:21
Since there are only 3 variables, have you considered making a truth table?
â ÃÂlon Djurinsky
Aug 6 at 21:22