A Family with a Single Minimal but Not Least Numbering
摘要
We prove the existence of a family of computably enumerable sets that,up to equivalence,has a unique computable minimal but not least numbering.