8 search results - page 2 / 2 » apal 1998 |
APAL
1998
13 years 6 months ago
1998
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 ...
APAL
1998
13 years 6 months ago
1998
We investigate the relationship of (jumps of) the degrees of splittings of a computably enumerable set and the degree of the set. We prove that there is a high computably enumerab...
APAL
1998
13 years 6 months ago
1998
A recursive graph is a graph whose vertex and edges sets are recursive. A highly recursive graph is a recursive graph that also has the following property: one can recursively det...