This article is cited in 2 papers

Mathematical logic, algebra and number theory

On functors enumerating structures

Dino Rossegger

Institute of Discrete Mathematics and Geometry, Technische Universität Wien, Wiedner Hauptstraße 8-10/104, 1040 Wien, Austria

Abstract: 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.

UDC: 510.5

MSC: 03C57

Received June 19, 2017, published July 26, 2017

Language: English

DOI: 10.17377/semi.2017.14.059

Bibliographic databases:

•