r.e. is "recursively enumerable", IIRC. On 2/2/22 13:34, Frank Wimberly wrote: > I wonder what an e. r. relation is. Equivalence relations are reflexive by definition. -- glen Theorem 3. If f(x) is a continuous function of period 2π, then f(x,r)→f(x) as r→1, uniformly ∀x.