Abstract
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}}\).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Borceux, F.: Handbook of Categorical Algebra, 3 volumes. Cambridge University Press, Cambridge (1994-1995)
Mac Lane, S.: Categories for the Working Mathematician. 2nd edn. Springer, New York (1997)
Miller, R.G.: Locally computable structures. In: Cooper, B., Löwe, B., Sorbi, A. (eds.) CiE 2007. LNCS, vol. 4497, pp. 575–584. Springer, Heidelberg (2007), qcpages.qc.cuny.edu/~rmiller/research
Miller, R.G.: Local computability and uncountable structures (to appear)
Soare, R.I.: Recursively Enumerable Sets and Degrees. Springer, New York (1987)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Miller, R., Mulcahey, D. (2008). Perfect Local Computability and Computable Simulations. In: Beckmann, A., Dimitracopoulos, C., Löwe, B. (eds) Logic and Theory of Algorithms. CiE 2008. Lecture Notes in Computer Science, vol 5028. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69407-6_48
Download citation
DOI: https://doi.org/10.1007/978-3-540-69407-6_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69405-2
Online ISBN: 978-3-540-69407-6
eBook Packages: Computer ScienceComputer Science (R0)