Stephen Binns

According to our database, Stephen Binns authored at least 12 papers between 2003 and 2016.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2016

Mass problems and density.

Stephen Binns, Richard A. Shore, Stephen G. Simpson

J. Math. Log., 2016

2013

Compressibility and Kolmogorov Complexity.

Stephen Binns, Marie Nicholson

Notre Dame J. Formal Log., 2013

Completeness, Compactness, Effective Dimensions.

Stephen Binns

Math. Log. Q., 2013

2011

Relative Kolmogorov complexity and geometry.

Stephen Binns

J. Symb. Log., 2011

2009

Finding paths through narrow and wide trees.

Stephen Binns, Bjørn Kjos-Hanssen

J. Symb. Log., 2009

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

Pi⁰₁ classes with complex elements.

Stephen Binns

J. Symb. Log., 2008

2007

Hyperimmunity in 2^ℕ.

Stephen Binns

Notre Dame J. Formal Log., 2007

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

Small Pi⁰₁ Classes.

Stephen Binns

Arch. Math. Log., 2006

2004

Embeddings into the Medvedev and Muchnik lattices of pi⁰₁classes.

Stephen Binns, Stephen G. Simpson

Arch. Math. Log., 2004

2003

A splitting theorem for the Medvedev and Muchnik lattices.

Stephen Binns

Math. Log. Q., 2003