A function is a definable function if its graph of a function is a definable set. Equivalently, a first-order formula defines exactly the pairs with . Totality and uniqueness mean . The same definition with restricted domains gives definable partial functions. A function need not be a symbol of the language to be definable; the graph can be specified through the existing relations and operations.
New to topics? Read the docs here!