APAL 1998 | Sciweavers

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

claim paper

Read More »

33

click to vote

APAL
1998

71views more APAL 1998»

On the Finiteness of the Recursive Chromatic Number

13 years 10 months ago

Download www.cs.umd.edu

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

claim paper

Read More »

29

click to vote

APAL
1998

71views more APAL 1998»

Splitting Theorems and the Jump Operator

13 years 10 months ago

Download www.math.cornell.edu

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

claim paper

Read More »

37

click to vote

APAL
1998

121views more APAL 1998»

Computably Enumerable Sets and Quasi-Reducibility

13 years 10 months ago

Download homepages.mcs.vuw.ac.nz

We consider the computably enumerable sets under the relation of Qreducibility. We ﬁrst give several results comparing the upper semilattice of c.e. Q-degrees, RQ, ≤Q , under ...

Rodney G. Downey, Geoffrey LaForte, André N...

claim paper

Read More »

33

click to vote

APAL
1998

60views more APAL 1998»

Classifying Toposes for First-Order Theories

13 years 10 months ago