A splitting theorem for the Medvedev and Muchnik lattices. - Stephen Binns (Math. Log. Q., 2003)

Embeddings into the Medvedev and Muchnik lattices of pi01classes. - Stephen Binns; Stephen G. Simpson (Arch. Math. Log., 2004)

Small Pi01 Classes. - Stephen Binns (Arch. Math. Log., 2006)

On a conjecture of Dobrinen and Simpson concerning almost everywhere domination. - Stephen Binns; Bjørn Kjos-Hanssen; Manuel Lerman; Reed Solomon (J. Symb. Log., 2006)

Hyperimmunity in 2ℕ. - Stephen Binns (Notre Dame J. Formal Log., 2007)

Pi01 classes with complex elements. - Stephen Binns (J. Symb. Log., 2008)

Self-Embeddings of Computable Trees. - Stephen Binns; Bjørn Kjos-Hanssen; Manuel Lerman; James H. Schmerl; Reed Solomon (Notre Dame J. Formal Log., 2008)

Finding paths through narrow and wide trees. - Stephen Binns; Bjørn Kjos-Hanssen (J. Symb. Log., 2009)

Relative Kolmogorov complexity and geometry. - Stephen Binns (J. Symb. Log., 2011)

Completeness, Compactness, Effective Dimensions. - Stephen Binns (Math. Log. Q., 2013)

Compressibility and Kolmogorov Complexity. - Stephen Binns; Marie Nicholson (Notre Dame J. Formal Log., 2013)

Mass problems and density. - Stephen Binns; Richard A. Shore; Stephen G. Simpson (J. Math. Log., 2016)