Sciweavers

APAL
1998
56views more  APAL 1998»
13 years 7 months ago
Turing Degrees of Certain Isomorphic Images of Computable Relations
A model is computable if its domain is a computable set and its relations and functions are uniformly computable. Let A be a computable model and let R be an extra relation on the ...
Valentina S. Harizanov