- #1
gabaygu
- 2
- 0
using de' morgan Lows.
thanks!
thanks!
luddite said:Say you have something like (AB)+(CD). If you apply De Morgan's, you get something like ((A'+B')(C'+D'))', no? But now you've got this negation around the whole thing, so it's not in CNF.
CNF stands for Conjunctive Normal Form and DNF stands for Disjunctive Normal Form. These are two forms of propositional logic that are used to represent logical statements in a more standardized and simplified way.
Converting from CNF to DNF can be useful for simplifying and clarifying logical statements. It can also make it easier to perform further logical operations on the statement.
The process for converting from CNF to DNF involves using logical equivalences and rules to manipulate the statement into the desired form. This may involve using distributivity, De Morgan's laws, and other logical operations.
Yes, there are limitations to converting from CNF to DNF. Some logical statements may not have an equivalent DNF form, or the conversion may result in a longer or more complicated statement.
It depends on the specific situation and the goals of the user. Both CNF and DNF have their own advantages and disadvantages, so it is important to consider the context before deciding on a preferred form.