Automorphisms of the lattice of Π 0 1 classes: perfect thin classes and anc degrees

by Peter Cholak , Richard Coles , Rod Downey , Eberhard Herrmann
Venue:Trans. Amer. Math. Soc
Citations:16 - 5 self

Active Bibliography

2 Slender classes – Rod Downey, Antonio, Montalb Án - 2006
Invariance And Noninvariance In The Lattice Of Pi Classes – Peter A. Cholak, Rod Downey - 2006
INVARIANCE AND NONINVARIANCE IN THE LATTICE OF � 0 1 CLASSES – Peter A. Cholak, Rod Downey
Invariance And Noninvariance In The Lattice Of ... Classes – Peter A. Cholak, Rod Downey
1 AUTOMORPHISMS OF THE LATTICE OF �0 1 CLASSES; PERFECT THIN CLASSES AND ANC DEGREES – Peter Cholak, Richard Coles, Rod Downey, Eberhard Herrmann
5 Countable thin Π0 1 classes – Douglas Cenzer, Rodney Downey, Carl Jockusch, Richard Shore - 1993
9 Some fundamental issues concerning degrees of unsolvability – Stephen G. Simpson - 2007
Index sets for . . . – Douglas Cenzer, Jeffrey Remmel - 1997
6 There is no Fat Orbit – Rod Downey, Leo Harrington
Definability and Automorphisms of the Computably Enumerable Sets – Rachel Louise Epstein - 2010
2 The complexity of orbits of computably enumerable sets – Peter A. Cholak, Rodney Downey, Leo A. Harrington - 2008
8 A Survey of Recursive Combinatorics – William Gasarch
6 Some orbits for ... – Peter Cholak, Rod Downey, Eberhard Herrmann - 2000
965 AGENDA – Artley Rogers Agenda, Artley Rogers, Leeds Ls Jt, S. Barry Cooper, S. Barry Cooper
STRONG DEGREE SPECTRA OF RELATIONS – Sarah Pingrey, S. Harizanov - 2008
4 Degrees of Computing and Learning – Frank Stephan - 1999
1 Automorphisms of the Lattice of ... Classes; Perfect Thin Classes and Anc Degrees – Peter Cholak, Richard Coles, Rod Downey, Eberhard Herrmann - 1999
5 Questions in Computable Algebra and Combinatorics – Rod Downey, J. B. Remmel - 1999
1 PROMPT SIMPLICITY, ARRAY COMPUTABILITY AND CUPPING – Rod Downey, Noam Greenberg, Joseph S. Miller, Rebecca Weber