- Π₁¹ Relations and Paths through ᵊ.Sergey S. Goncharov, Valentina S. Harizanov, Julia F. Knight & Richard A. Shore - 2004 - Journal of Symbolic Logic 69 (2):585 - 611.details
|
|
Realizing Levels of the Hyperarithmetic Hierarchy as Degree Spectra of Relations on Computable Structures.Walker M. White & Denis R. Hirschfeldt - 2002 - Notre Dame Journal of Formal Logic 43 (1):51-64.details
|
|
Generalized weak presentations.Alexandra Shlapentokh - 2002 - Journal of Symbolic Logic 67 (2):787-819.details
|
|
Π 1 1 relations and paths through.Sergey S. Goncharov, Valentina S. Harizanov, Julia F. Knight & Richard A. Shore - 2004 - Journal of Symbolic Logic 69 (2):585-611.details
|
|
1995 European Summer Meeting of the Association for Symbolic Logic.Johann A. Makowsky - 1997 - Bulletin of Symbolic Logic 3 (1):73-147.details
|
|
Coding a family of sets.J. F. Knight - 1998 - Annals of Pure and Applied Logic 94 (1-3):127-142.details
|
|
Computable isomorphisms, degree spectra of relations, and Scott families.Bakhadyr Khoussainov & Richard A. Shore - 1998 - Annals of Pure and Applied Logic 93 (1-3):153-193.details
|
|
$\Pi _{1}^{0}$ Classes and Strong Degree Spectra of Relations.John Chisholm, Jennifer Chubb, Valentina S. Harizanov, Denis R. Hirschfeldt, Carl G. Jockusch, Timothy McNicholl & Sarah Pingrey - 2007 - Journal of Symbolic Logic 72 (3):1003 - 1018.details
|
|
Degree spectra of relations on computable structures in the presence of Δ20 isomorphisms.Denis Hirschfeldt - 2002 - Journal of Symbolic Logic 67 (2):697-720.details
|
|
Degree spectra of relations on computable structures.Denis R. Hirschfeldt - 2000 - Bulletin of Symbolic Logic 6 (2):197-212.details
|
|
The possible turing degree of the nonzero member in a two element degree spectrum.Valentina S. Harizanov - 1993 - Annals of Pure and Applied Logic 60 (1):1-30.details
|
|
Turing degrees of certain isomorphic images of computable relations.Valentina S. Harizanov - 1998 - Annals of Pure and Applied Logic 93 (1-3):103-113.details
|
|
Turing degrees of hypersimple relations on computable structures.Valentina S. Harizanov - 2003 - Annals of Pure and Applied Logic 121 (2-3):209-226.details
|
|
Computability-theoretic complexity of countable structures.Valentina S. Harizanov - 2002 - Bulletin of Symbolic Logic 8 (4):457-477.details
|
|
On the complexity of the successivity relation in computable linear orderings.Rod Downey, Steffen Lempp & Guohua Wu - 2010 - Journal of Mathematical Logic 10 (1):83-99.details
|
|
Degree Spectra of Relations on Computable Structures in the Presence of Δ02 Isomorphisms.Denis R. Hirschfeldt - 2002 - Journal of Symbolic Logic 67 (2):697 - 720.details
|
|
Degrees of categoricity on a Cone via η-systems.Barbara F. Csima & Matthew Harrison-Trainor - 2017 - Journal of Symbolic Logic 82 (1):325-346.details
|
|
Degree spectra of the successor relation of computable linear orderings.Jennifer Chubb, Andrey Frolov & Valentina Harizanov - 2009 - Archive for Mathematical Logic 48 (1):7-13.details
|
|
Quasi-simple relations in copies of a given recursive structure.C. J. Ash, J. F. Knight & J. B. Remmel - 1997 - Annals of Pure and Applied Logic 86 (3):203-218.details
|
|
Permitting, forcing, and copying of a given recursive relation.C. J. Ash, P. Cholak & J. F. Knight - 1997 - Annals of Pure and Applied Logic 86 (3):219-236.details
|
|
Possible degrees in recursive copies.C. J. Ash & J. F. Knight - 1995 - Annals of Pure and Applied Logic 75 (3):215-221.details
|
|
Possible degrees in recursive copies II.C. J. Ash & J. F. Knight - 1997 - Annals of Pure and Applied Logic 87 (2):151-165.details
|
|