On weakly pre-complete positive equivalences (Q810013)

An equivalence \(\eta\) on the set \({\mathbb{N}}\) of natural numbers is said to be positive if the set \(\{<x,y>|\) x \(\eta\) \(y\}\) is recursively enumerable. An equivalence \(\eta\) is said to be weakly precomplete if there exists a partial recursive function f such that for any \(n\in {\mathbb{N}}\), if \(\kappa_ n\) is a general recursive function with the number n, then f(n) is defined and f(n) \(\eta\kappa\) \({}_ n(f(n))\). If moreover the function f is total then \(\eta\) is said to be precomplete. The result of this paper is that there is a countable number of pairwise nonequivalent weakly precomplete positive equivalences.