|
This article is cited in 2 scientific papers (total 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.
Received June 19, 2017, published July 26, 2017
Citation:
Dino Rossegger, “On functors enumerating structures”, Sib. Èlektron. Mat. Izv., 14 (2017), 690–702
Linking options:
https://www.mathnet.ru/eng/semr816 https://www.mathnet.ru/eng/semr/v14/p690
|
Statistics & downloads: |
Abstract page: | 132 | Full-text PDF : | 22 | References: | 25 |
|