Stephen Binns

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

	2013
j10		Stephen Binns, Marie Nicholson: Compressibility and Kolmogorov Complexity. Notre Dame Journal of Formal Logic 54(1): 105-123 (2013)
	2011
j9		Stephen Binns: Relative Kolmogorov complexity and geometry. J. Symb. Log. 76(4): 1211-1239 (2011)
	2009
j8		Stephen Binns, Bjørn Kjos-Hanssen: Finding paths through narrow and wide trees. J. Symb. Log. 74(1): 349-360 (2009)
	2008
j7		Stephen Binns: Pi⁰₁ classes with complex elements. J. Symb. Log. 73(4): 1341-1353 (2008)
j6		Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman, James H. Schmerl, Reed Solomon: Self-Embeddings of Computable Trees. Notre Dame Journal of Formal Logic 49(1): 1-37 (2008)
	2007
j5		Stephen Binns: Hyperimmunity in 2\sp N. Notre Dame Journal of Formal Logic 48(2): 293-316 (2007)
	2006
j4		Stephen Binns: Small Pi⁰₁ Classes. Arch. Math. Log. 45(4): 393-410 (2006)
j3		Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman, Reed Solomon: On a conjecture of Dobrinen and Simpson concerning almost everywhere domination. J. Symb. Log. 71(1): 119-136 (2006)
	2004
j2		Stephen Binns, Stephen G. Simpson: Embeddings into the Medvedev and Muchnik lattices of pi⁰₁classes. Arch. Math. Log. 43(3): 399-414 (2004)
	2003
j1		Stephen Binns: A splitting theorem for the Medvedev and Muchnik lattices. Math. Log. Q. 49(4): 327-335 (2003)

Coauthor Index

Last update Sat May 25 21:49:12 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page