Relative To Any Nonrecursive Set (1996)

Cached

Download Links

by Theodore Slaman
Venue:Proc. Amer. Math. Soc
Citations:20 - 0 self

Documents Related by Co-Citation

15 Enumerations, countable structures, and Turing degrees – S Wehner - 1998
38 Degrees coded in jumps of orderings – Julia F Knight - 1986
27 Degrees of structures – L J Richter - 1981
11 The ∆ 0 2-spectrum of a linear order – Russell G Miller
33 Degree spectra and computable dimension in algebraic structures – Denis R. Hirschfeldt, Richard A. Shore - 2002
18 Effective model theory: the number of models and their complexity – Bakhadyr Khoussainov, Richard A. Shore - 1999
475 Recursively Enumerable Sets and Degrees – R Soare - 1987
17 On Presentations of Algebraic Structures – Rod Downey - 1995
7 Spectra of structures and relations – V Harizanov, R Miller
21 Jr.; Every low Boolean algebra is isomorphic to a recursive one – R G Downey, C G Jockusch - 1992
26 Recursively categorical linear orderings – J Remmel - 1981
16 Pure computable model theory, Handbook of Recursive Mathematics – V S Harizanov - 1998
4 On the upper semilattice – A N Khisamiev
5 Turing degrees of the isomorphism types of algebraic objects – Valentina Harizanov, Wesley Calvert, Alexandra
10 Every Set Has a Least Jump Enumeration – Richard J. Coles, Rod G. Downey, Theodore A. Slaman - 1998
26 Computable Isomorphisms, Degree Spectra of Relations, and Scott Families – Bakhadyr Khoussainov, Richard A. Shore - 1998
73 Soare, Recursively Enumerable Sets and Degrees – R I - 1987
63 Computable algebra, general theory and theory of computable fields – Michael O Rabin - 1960
27 Effective content of field theory – G Metakides, A Nerode - 1979