On functors enumerating structures
Sibirskie èlektronnye matematičeskie izvestiâ, Tome 14 (2017), pp. 690-702
Voir la notice de l'article provenant de la source Math-Net.Ru
We study a new notion of reduction between structures called enumerable functors related to the recently investigated notion of computable functors. Our main result shows that enumerable functors and effective interpretability with the equivalence relation computable are equivalent. We also obtain results on the relation between enumerable and computable functors.
Keywords:
computable structure theory, enumerable functor, computable structures, enumeration reducibility.
@article{SEMR_2017_14_a19,
author = {Dino Rossegger},
title = {On functors enumerating structures},
journal = {Sibirskie \`elektronnye matemati\v{c}eskie izvesti\^a},
pages = {690--702},
publisher = {mathdoc},
volume = {14},
year = {2017},
language = {en},
url = {http://geodesic.mathdoc.fr/item/SEMR_2017_14_a19/}
}
Dino Rossegger. On functors enumerating structures. Sibirskie èlektronnye matematičeskie izvestiâ, Tome 14 (2017), pp. 690-702. http://geodesic.mathdoc.fr/item/SEMR_2017_14_a19/