Sciweavers

APAL
1998
51views more  APAL 1998»
13 years 11 months ago
What's the Difference?
James H. Schmerl
APAL
1998
54views more  APAL 1998»
13 years 11 months ago
Computable Isomorphisms, Degree Spectra of Relations, and Scott Families
Bakhadyr Khoussainov, Richard A. Shore
APAL
1998
56views more  APAL 1998»
13 years 11 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
APAL
1998
71views more  APAL 1998»
13 years 11 months ago
On the Finiteness of the Recursive Chromatic Number
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...
William I. Gasarch, Andrew C. Y. Lee
APAL
1998
71views more  APAL 1998»
13 years 11 months ago
Splitting Theorems and the Jump Operator
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...
Rodney G. Downey, Richard A. Shore
APAL
1998
121views more  APAL 1998»
13 years 11 months ago
Computably Enumerable Sets and Quasi-Reducibility
We consider the computably enumerable sets under the relation of Qreducibility. We first give several results comparing the upper semilattice of c.e. Q-degrees, RQ, ≤Q , under ...
Rodney G. Downey, Geoffrey LaForte, André N...
APAL
1998
60views more  APAL 1998»
13 years 11 months ago
Classifying Toposes for First-Order Theories
Carsten Butz, Peter Johnstone
APAL
1998
88views more  APAL 1998»
13 years 11 months ago
The Dense Simple Sets are Orbit Complete with Respect to the Simple Sets
We prove conjectures of Herrmann and Stob by showing that the dense simple sets are orbit complete w.r.t. the simple sets.
Peter Cholak