<?xml version="1.0" encoding="UTF-8"?>

<record version="1" id="5677">
 <title>DNF</title>
 <name>DNF</name>
 <created>2004-03-09 13:43:32</created>
 <modified>2004-03-09 13:43:32</modified>
 <type>Definition</type>
 <creator id="6075" name="rspuzio"/>
 <author id="2964" name="iddo"/>
 <classification>
	<category scheme="msc" code="03B05"/>
 </classification>
 <synonyms>
	<synonym concept="DNF" alias="disjunctive normal form"/>
 </synonyms>
 <related>
	<object name="CNF"/>
	<object name="AtomicFormula"/>
 </related>
 <preamble>% this is the default PlanetMath preamble.  as your knowledge
% of TeX increases, you will probably want to edit this, but
% it should be fine as is for beginners.

% almost certainly you want these
\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}

% used for TeXing text within eps files
%\usepackage{psfrag}
% need this for including graphics (\includegraphics)
%\usepackage{graphicx}
% for neatly defining theorems and propositions
%\usepackage{amsthm}
% making logically defined graphics
%\usepackage{xypic}

% there are many more packages, add them here as you need them

% define commands here</preamble>
 <content>A propositional formula is a DNF formula, meaning Disjunctive Normal Form, if it is a disjunction of conjunctions of literals (a literal is a propositional variable or its negation). Hence, a DNF is a formula of the form: $K_1 \vee K_2 \vee \ldots \vee K_n$, where each $K_i$ is of the form $l_{i1} \wedge l_{i2} \wedge \ldots \wedge l_{im}$ for literals $l_{ij}$ and some $m$ which can vary for each $K_i$.

Example: $(x\wedge  y \wedge \neg z) \vee (y\wedge \neg w \wedge \neg u) \vee (x \wedge v)$.</content>
</record>
