[FOM] acceptable enumerations

[Panu Raatikainen]

A system of indices is acceptable if it is possible to go effectively  
from the standard coding to the system, and vice versa.

Rogers has shown that a system of indices is acceptable iff it  
satisfies both enumeration and parametrization, and that every  
acceptable system of indices satisfies the Fixed-Point Theorem.

Hence, one can say that acceptable systems of indices provide the same
structure theory for recursive functions as the standard one.


Best

Panu



Lainaus T.Forster at dpmms.cam.ac.uk:

> ... as in ``acceptable enumeration of p.r. functions'' or acceptable  
> enumeration of r.e. sets''...
>
> I am in the market for a decent and thorough explanation of this  
> important notion. I am away from my books and am nowhere near a  
> library, but i do have the internet. Can anyone point me towards an  
> electronically available
> text of this nature? Or perhaps supply such an analysis themselves?
>
>         tf
>
> _______________________________________________
> FOM mailing list
> FOM at cs.nyu.edu
> http://www.cs.nyu.edu/mailman/listinfo/fom
>
>



-- 
Panu Raatikainen

Ph.D., University Lecturer
Docent in Theoretical Philosophy

Theoretical Philosophy
Department of Philosophy, History, Culture and Art Studies
P.O. Box 24  (Unioninkatu 38 A)
FIN-00014 University of Helsinki
Finland

E-mail: panu.raatikainen at helsinki.fi

http://www.mv.helsinki.fi/home/praatika/