On functors enumerating structures

摘要

We study a new notion of reduction between structures called enumerablefunctors related to the recently investigated notion of computable functors. Our main resultshows that enumerable functors and effective interpretability with the equivalence relationcomputable are equivalent. We also obtain results on the relation between enumerable andcomputable functors.