Precomplete equivalence relations in dominical categories
Claudio Bernardi · Proceedings of the American Mathematical Society · 1986
In this paper precomplete equivalence relations are introduced in dominical and recursion categories. After recalling definitions in § 2 \S 2 , in § 3 \S 3 an analogue of Eršov’s Fixed Point Theorem is proved, as well as the recursive inseparability of two disjoint (unions of) equivalence classes. In § 4 \S 4 "morphisms" between equivalence relations are discussed, while § 5 \S 5 is devoted to the construction of an example (a new characterization of precomplete equivalence relations is also supplied in Lemma 5).