In
mathematical logic, a
definable set is an
n-ary
relation on the
domain of a
structure whose elements are precisely those elements satisfying some
formula in the language of that structure. A set can be defined with or without
parameters, which are elements of the domain that can be referenced in the formula defining the relation.