Recursively enumerable sets and degrees
Recursively enumerable sets and degrees
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
| Hi-index | 0.00 |
We study perfectly locally computable structures, which are (possibly uncountable) structures ${\mathcal{S}}$ that have highly effective presentations of their local properties. We show that every such ${\mathcal{S}}$ can be simulated, in a strong sense and even over arbitrary finite parameter sets, by a computable structure. We also study the category theory of a perfect cover of ${\mathcal{S}}$, examining its connections to the category of all finitely generated substructures of ${\mathcal{S}}$.