- Computable structures and the hyperarithmetical hierarchy.C. J. Ash - 2000 - New York: Elsevier. Edited by J. Knight.details
|
|
Π₁¹ 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
|
|
An example concerning Scott heights.M. Makkai - 1981 - Journal of Symbolic Logic 46 (2):301-318.details
|
|
Effective model theory vs. recursive model theory.John Chisholm - 1990 - Journal of Symbolic Logic 55 (3):1168-1191.details
|
|
Categoricity in hyperarithmetical degrees.C. J. Ash - 1987 - Annals of Pure and Applied Logic 34 (1):1-14.details
|
|
Intrinsically Hyperarithmetical Sets.Ivan N. Soskov - 1996 - Mathematical Logic Quarterly 42 (1):469-480.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
|
|
Enumerations in computable structure theory.Sergey Goncharov, Valentina Harizanov, Julia Knight, Charles McCoy, Russell Miller & Reed Solomon - 2005 - Annals of Pure and Applied Logic 136 (3):219-246.details
|
|
Pairs of recursive structures.C. J. Ash & J. F. Knight - 1990 - Annals of Pure and Applied Logic 46 (3):211-234.details
|
|
Pairs of computable structures.C. J. Ash & J. F. Knight - 1990 - Annals of Pure and Applied Logic 46 (3):211-234.details
|
|
Generic copies of countable structures.Chris Ash, Julia Knight, Mark Manasse & Theodore Slaman - 1989 - Annals of Pure and Applied Logic 42 (3):195-205.details
|
|