 A is said to be formula_1 recursively enumerable if it is formula_9 definable over formula_10.A is recursive if both A and formula_11 (its complement in formula_1) are formula_1 recursively enumerable.Members of formula_10 are called formula_1 finite and play a similar role to the finite numbers in classical recursion theory.