• Normal form (abstract rewriting)
• Normal form (databases)
• Normal form (game theory)
  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 strictly dominated strategies and Nash equilibria, some...
  
  
• Normal form (mathematics)

• Beta normal form
• Chomsky normal form
  Chomsky normal form
  In computer science, a context-free grammar is said to be in Chomsky normal form if all of its production rules are of the form:Every grammar in Chomsky normal form is context-free, and conversely, every context-free grammar can be transformed into an equivalent one which is in Chomsky normal form....
  
  
• Greibach normal form
  Greibach normal form
  In computer science and formal language theory, a context-free grammar is in Greibach normal form if the right-hand sides of all productions start with a terminal symbol, optionally followed by some variables. A non-strict form allows one exception to this format restriction for allowing the empty...
  
  
• Kuroda normal form
  Kuroda normal form
  In formal language theory, a grammar is in Kuroda normal form if, and only if, all production rules are of the form:Every grammar in Kuroda normal form is monotonic, and therefore, generates a context-sensitive language. Conversely, every context-sensitive language which does not generate the...
  
  
• Normal form (abstract rewriting), an element of a rewrite system which cannot be further rewritten

• Algebraic normal form
  Algebraic normal form
  In Boolean logic, the algebraic normal form is a method of standardizing and normalizing logical formulas. As a normal form, it can be used in automated theorem proving , but is more commonly used in the design of cryptographic random number generators, specifically linear feedback shift registers...
  
  
• Clausal normal form
  Clausal normal form
  The clausal normal form of a logical formula is used in logic programming and many theorem proving systems. A formula in clause normal form is a set of clauses, interpreted as a conjunction...
  
  
• Conjunctive normal form
  Conjunctive normal form
  In Boolean logic, a formula is in conjunctive normal form if it is a conjunction of clauses, where a clause is a disjunction of literals.As a normal form, it is useful in automated theorem proving...
  
  
• Negation normal form
• Prenex normal form
  Prenex normal form
  A formula of the predicate calculus is in prenex normal form if it is written as a string of quantifiers followed by a quantifier-free part .Every formula in classical logic is equivalent to a formula in prenex normal form...
  
  
• Skolem normal form
  Skolem normal form
  Reduction to Skolem normal form is a method for removing existential quantifiers from formal logic statements, often performed as the first step in an automated theorem prover....
  
  

• Beta normal form

See also

• Normalization (disambiguation)
• Normalization property
• Musical set theory
  Set (music)
  A set in music theory, as in mathematics and general parlance, is a collection of objects...