P. 1
Computability and Logic Maravilhoso

# Computability and Logic Maravilhoso

|Views: 89|Likes:

### Availability:

See more
See less

11/17/2013

pdf

text

original

A numerical function is a function f deﬁned on a set of n-tuples of natural

numbers:

Dom(f) Nn

and taking natural numbers as values:

Ran(f) N.

The positive integer n is called the arity of the numerical function; it is the

number of inputsx1,x2,...,xn required to produce an outputf(x1,x2,...,xn).

A numerical function with arity n is also called an n- ary numerical function.

(This usage arose from more traditional terminology where unary meant 1-

ary, binary meant 2 -ary, ternary meant 3-ary, etc.)

The function f is called totally deﬁned or total iﬀ f(x1,x2,...,xn) is

deﬁned for all inputs (x1,x2,...,xn) i.e. iﬀ

Dom(f) = Nn
.

When we wish to emphasize that a numerical function is not assumed to

be total we call it partially deﬁned or simply partial. (It is important

to remember that the adjective partial is redundant: a partial numerical

function and a numerical function are the same11

thing. When we call a

function partial we do not exclude the possibility that the function is total.)

scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->