Technical Reports

The ICICS/CS Reading Room


UBC CS TR-83-12 Summary

Acceptable Numerations of Function Spaces, October 1983 K and Akira a

We study when a numeration of the set of morphisms from a numeration to the other is well-behaved. We call well-behaved numerations ``acceptable numerations''. We characterize acceptable numerations by two axioms and show that acceptable numerations are recursively isomorphic to each other. We also show that for each acceptable numeration a fixed point theorem holds. Relation between Cartesian closedness and S-m-n property is discussed in terms of acceptable numerations. As an example of acceptable numerations, we study directed indexings of effective domains.


If you have any questions or comments regarding this page please send mail to help@cs.ubc.ca.