Computability in Europe 2008
Logic and Theory of Algorithms
|Author(s):||Russell Miller and Dustin Mulcahey|
|Slot:||Wed, 11:30-11:50, Room 19 (col. 5)|
We study perfectly locally computable structures, which are (possibly uncountable) structures S that have highly effective presentations of their local properties. We show that every such 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 S, examining its connections to the category of all finitely generated substructures of S.
|websites: Arnold Beckmann||2008-05-30|