We exhibit computable equivalence structures, one -categorical and one not -categorical, having unbounded character, infinitely many infinite equivalence classes, and no s1-function. This offers a natural example where -categoricity and relative -categoricity differ.
展开▼
