-
Bjørn Kjos-Hanssen, Only Human: a book review of The Turing GuideNotices of the American Mathematical Society 66 (4). forthcoming.
-
Bjørn Kjos-Hanssen, Permutations of the integers induce only the trivial automorphism of the Turing degreesBulletin of Symbolic Logic 24 (2): 165-174. 2018.
-
Bjørn Kjos-Hanssen, A Conflict Between Some Semantic Conditions of Carmo and Jones for Contrary-to-Duty ObligationsStudia Logica 105 (1): 173-178. 2017.
-
Bjørn Kjos-Hanssen, Frank Stephan, and Sebastiaan A. Terwijn, Covering the recursive setsAnnals of Pure and Applied Logic 168 (4): 804-823. 2017.
-
Katie Brodhead, Mushfeq Khan, Bjørn Kjos-Hanssen, William A. Lampe, Paul Kim Long V. Nguyen, and Richard A. Shore, The strength of the Grätzer-Schmidt theoremArchive for Mathematical Logic 55 (5-6): 687-704. 2016.
-
Bjørn Kjos-Hanssen, Antoine Taveneaux, and Neil Thapen, How much randomness is needed for statistics?Annals of Pure and Applied Logic 165 (9): 1470-1483. 2014.
-
David Diamondstone and Bjørn Kjos-Hanssen, Martin-Löf randomness and Galton–Watson processesAnnals of Pure and Applied Logic 163 (5): 519-529. 2012.
-
Bjørn Kjos-Hanssen, Antoine Taveneaux, and Neil Thapen, How much randomness is needed for statistics?In S. Barry Cooper (ed.), How the World Computes, . pp. 395--404. 2012.
-
Bjørn Kjos-Hanssen, A strong law of computationally weak subsetsJournal of Mathematical Logic 11 (1): 1-10. 2011.
-
Bjørn Kjos-Hanssen, André Nies, Frank Stephan, and Y. U. Liang, Higher kurtz randomnessAnnals of Pure and Applied Logic 161 (10): 1280-1290. 2010.
-
Richard A. Shore and Bjørn Kjos-Hanssen, Lattice initial segments of the hyperdegreesJournal of Symbolic Logic 75 (1): 103-130. 2010.
-
Stephen Binns and Bjørn Kjos-Hanssen, Finding paths through narrow and wide treesJournal of Symbolic Logic 74 (1): 349-360. 2009.
-
Bjørn Kjos-Hanssen and Andrée Nies, SuperhighnessNotre Dame Journal of Formal Logic 50 (4): 445-452. 2009.
-
Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman, James H. Schmerl, and Reed Solomon, Self-Embeddings of Computable TreesNotre Dame Journal of Formal Logic 49 (1): 1-37. 2008.
-
Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman, and Reed Solomon, On a Conjecture of Dobrinen and Simpson concerning Almost Everywhere DominationJournal of Symbolic Logic 71 (1). 2006.
-
Bjørn Kjos-Hanssen, A. Nies, and F. Stephan, Lowness for the class of Schnorr random setsNotre Dame Journal of Formal Logic 35 (3): 647-657. 2005.
-
Klaus Ambos-Spies, Bjørn Kjos-Hanssen, Steffen Lempp, and Theodore A. Slaman, Comparing DNR and WWKLJournal of Symbolic Logic 69 (4): 1089-1104. 2004.
-
Bjørn Kjos-Hanssen, Local initial segments of the Turing degreesBulletin of Symbolic Logic 9 (1): 26-36. 2003.
