bound (adj.)

A term used as part of the classification of MORPHEMES; opposed to FREE. A bound morpheme (or bound form) is one which cannot occur on its own as a separate WORD, e.g. the various AFFIXES de-, -tion, -ize, etc.

A term used in logic, and frequently encountered in GRAMMATICAL and SEMANTIC theory, applying to VARIABLES which are semantically dependent on a QUANTIFIER or other OPERATOR. In the BINDING sub-theory of GOVERNMENT BINDING THEORY it refers to CONSTITUENTS which have been formally related through CO-INDEXING: X is bound if it is an ARGUMENT CO-INDEXED with a C-COMMANDING argument. Its opposite is FREE. Some constituents (specifically, ANAPHORS) must be bound (A-bound) in their GOVERNING category, and some (variables and R-EXPRESSIONS) must be free, otherwise the structures are ILL FORMED. Variables must be A-bar bound – co-indexed with a c-commanding element in an A-bar position.