(databases) Any of various forms of a relational database providing criteria for determining a table's degree of vulnerability to logical inconsistencies and anomalies.

plural of normal form

(obsolete) The Backus-Naur form.

(databases) A stage in the normalization of a relational database in which a database is in Boyce-Codd normal form and all multi-valued dependencies are functional dependencies.

(databases) A stage in the normalization of a relational database in which it is in first normal form and every non-key attribute is dependent upon the entire primary key.

(databases) A stage in the normalization of a relational database in which a database is in second normal form and all non-key attributes are mutually independent (no transient dependencies.)

(databases) A stage in the normalization of a relational database in which a database is in fourth normal form and every join dependency is implied by the candidate keys.

(databases) A stage in the normalization of a relational database in which repeating groups and attributes have been eliminated by putting each into a separate table connected by a primary-key/foreign-key relationship.

(game theory) Formally, a structure (P, mathbf S, mathbf F) where P = {1,2, ...,m} is a set of players, mathbf S=(S_1,S_2,…,S_m) is an m-tuple of pure strategy sets, one for each player, and mathbf F=(F_1,F_2,…,F_m) is an m-tuple of payoff functions.

(logic) The form of a boolean formula that the formula has if the formula is a disjunction of conjunctions of literals, such as “(A and B and C) or (D and E and not F)”.