1055 search results - page 8 / 211 » Enumerations in computable structure theory |
CIE
2008
Springer
14 years 11 months ago
2008
Springer
We study perfectly locally computable structures, which are (possibly uncountable) structures S that have highly effective presentations of their local properties. We show that eve...
CIE
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. If L is a finite relational language then all computable Lstructures can be effectively enumerated in a sequence {An}n∈ω in such a way that for every computable L-st...
JSYML
2010
14 years 8 months ago
2010
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
CONCUR
1995
Springer
15 years 1 months ago
1995
Springer
CCA
2009
Springer
15 years 4 months ago
2009
Springer
It is folklore particularly in numerical and computer sciences that, instead of solving some general problem f : A → B, additional structural information about the input x ∈ A ...