(computing) A formal notation for context-free grammars.

(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 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 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 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 repeating groups and attributes have been eliminated by putting each into a separate table connected by a primary-key/foreign-key relationship.

(differential geometry) the Riemannian metric for 2-dimensional manifolds, i.e. given a surface with regular parametrization x(u,v), the first fundamental form is a set of three functions, {E, F, G}, dependent on u and v, which give information about local intrinsic curvature of the surface. These functions are given by

(logic) A statement that is expressed in a valid, syntactically correct, manner.

(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.

(game theory) Informally, a representation of a game as a tree of decision nodes, with the game beginning at a unique initial node, and flowing through the tree along a path determined by the players until a terminal node is reached, where play ends and payoffs are assigned to all players; each non-terminal node belongs to a player; that player chooses among the possible moves at that node, each possible move is an edge leading from that node to another node.