- normal form
- A well-formed formula of the propositional calculus is in conjunctive normal form when it is of the form A & B &…where each of A, B…is a formula consisting of a disjunction of atomic propositions or negations of atomic propositions (e.g.
*p*∨*q*∨ ¬*r*…). In disjunctive normal form it is a disjunction of conjuncts subject to the same condition.

*Philosophy dictionary.
Academic.
2011.*

### Look at other dictionaries:

**Normal form**— may refer to: Normal form (abstract rewriting) Normal form (databases) Normal form (game theory) Normal form (mathematics) In formal language theory: Beta normal form Chomsky normal form Greibach normal form Kuroda normal form Normal form… … Wikipedia**normal form**— norminė forma statusas T sritis automatika atitikmenys: angl. normal form vok. Normalform, f rus. нормальная форма, f pranc. forme normale, f … Automatikos terminų žodynas**normal form**— noun logic : a canonical or standard fundamental form of a statement to which others can be reduced; especially : a compound statement in the propositional calculus consisting of nothing but a conjunction of disjunctions whose disjuncts are… … Useful english dictionary**normal form**— noun a) Any of various forms of a relational database providing criteria for determining a tables degree of vulnerability to logical inconsistencies and anomalies. b) A matrix that represents the possible outcomes of a game … Wiktionary**normal form**— ● ►en loc. f. ► Voir forme normale … Dictionnaire d'informatique francophone**Normal-form game**— In game theory, normal form is a way of describing a game. Unlike extensive form, normal form representations are not graphical per se, but rather represent the game by way of a matrix. While this approach can be of greater use in identifying… … Wikipedia**Normal form (abstract rewriting)**— In abstract rewriting, a normal form is an element of the system which cannot be rewritten any further. Stated formally, for some reduction relation ⋅ → ⋅ over X a term t in X is a normal form if there does not exist a term t′ in X such … Wikipedia**Normal form (term rewriting)**— In considering rewriting systems, a normal form is an element of the system which cannot be rewritten any further. Consider the basic term rewriting system with reduction rule ρ : g ( x , y ) → x . The term g ( g (4, 2), g (3, 1)) has the… … Wikipedia**Normal form (natural deduction)**— An inference of natural deduction is a normal form, according to Dag Prawitz, if no formula occurrence is both the principal premise of an elimination rule and the conclusion of an introduction rule. This logic related article is a stub. You can… … Wikipedia**normal form game**— noun Formally, a structure where P = 1,2, ...,m is a set of players, is an m tuple of pure strategy sets, one for each player, and is an m tuple of payoff functions. <! If someone can turn the math to inline math, please do it. See Also:… … Wiktionary