Complete Numbering

DEFINITION

A Numbering

u

of a set

A

is called complete (with respect to an element

a \in A

f

h

so that
:

u \circ h(i) = 
\left\{
\begin{matrix} 

u \circ f(i) &\mbox{if}\ i \in \mathrm{dom}(f), \
a &\mbox{otherwise}.
\end{matrix}

ight.

The numbering

u

is called precomplete if

:

u \circ f(i) = 
u \circ h(i) \qquad i \in \mathrm{dom}(f).\,

EXAMPLES

REFERENCES

A.I. Mal'tsev, ''Sets with complete numberings''. Algebra I Logika , 1963, vol. 2, no. 2, 4-29 (Russian)

	CATEGORIES ABOUT COMPLETE NUMBERING

	recursion theory

Information About