Normal form may refer to: * Normal form (databases) * Normal form (game theory) *

Canonical form In mathematics and computer science, a canonical, normal, or standard form of a mathematical object is a standard way of presenting that object as a mathematical expression. Often, it is one which provides the simplest representation of an obje ...

Hesse normal form In analytic geometry, the Hesse normal form (named after Otto Hesse) is an equation used to describe a line in the Euclidean plane \mathbb^2, a plane in Euclidean space \mathbb^3, or a hyperplane in higher dimensions.John Vince: ''Geometry for C ...

* Normal form in music *

Jordan normal form \begin \lambda_1 1\hphantom\hphantom\\ \hphantom\lambda_1 1\hphantom\\ \hphantom\lambda_1\hphantom\\ \hphantom\lambda_2 1\hphantom\hphantom\\ \hphantom\hphantom\lambda_2\hphantom\\ \hphantom\lambda_3\hphantom\\ \hphantom\ddots\hphantom\\ ...

in formal language theory: * Chomsky normal form * Greibach normal form *

Kuroda normal form In formal language theory, a noncontracting grammar is in Kuroda normal form if all production rules are of the form: :''AB'' → ''CD'' or :''A'' → ''BC'' or :''A'' → ''B'' or :''A'' → ''a'' where A, B, C and D are nonterminal symbols and ...

Normal form (abstract rewriting) In abstract rewriting, an object is in normal form if it cannot be rewritten any further, i.e. it is irreducible. Depending on the rewriting system, an object may rewrite to several normal forms or none at all. Many properties of rewriting systems ...

, an element of a rewrite system which cannot be further rewritten in logic: * Normal form (natural deduction) *

Algebraic normal form In Boolean algebra, the algebraic normal form (ANF), ring sum normal form (RSNF or RNF), '' Zhegalkin normal form'', or '' Reed–Muller expansion'' is a way of writing propositional logic formulas in one of three subforms: * The entire formul ...

* Canonical normal form *

Clausal normal form In Boolean algebra, a formula is in conjunctive normal form (CNF) or clausal normal form if it is a conjunction of one or more clauses, where a clause is a disjunction of literals; otherwise put, it is a product of sums or an AND of ORs. In au ...

Conjunctive normal form In Boolean algebra, a formula is in conjunctive normal form (CNF) or clausal normal form if it is a conjunction of one or more clauses, where a clause is a disjunction of literals; otherwise put, it is a product of sums or an AND of ORs. In au ...

Disjunctive normal form In boolean logic, a disjunctive normal form (DNF) is a canonical normal form of a logical formula consisting of a disjunction of conjunctions; it can also be described as an OR of ANDs, a sum of products, or in philosophical logic a ''cluster c ...

* Negation normal form *

Prenex normal form A formula of the predicate calculus is in prenex normal form (PNF) if it is written as a string of quantifiers and bound variables, called the prefix, followed by a quantifier-free part, called the matrix. Together with the normal forms in propos ...

Skolem normal form In mathematical logic, a formula of first-order logic is in Skolem normal form if it is in prenex normal form with only universal first-order quantifiers. Every first-order formula may be converted into Skolem normal form while not changing its ...

in lambda calculus: *

Beta normal form In lambda calculus, a term is in beta normal form if no '' beta reduction'' is possible. A term is in beta-eta normal form if neither a beta reduction nor an '' eta reduction'' is possible. A term is in head normal form if there is no ''beta-redex ...

See also