Publications
. (2003).
Computable categoricity of graphs with finite components. In Logic and theory of algorithms (Vol. 5028, pp. 139–148). Springer, Berlin. doi:10.1007/978-3-540-69407-6_15
. (2008). When is reachability intrinsically decidable?. In Developments in language theory (Vol. 5257, pp. 216–227). Springer, Berlin. doi:10.1007/978-3-540-85780-8_17
. (2008). Comparing c.e. sets based on their settling times. In Computation and logic in the real world (Vol. 4497, pp. 196–204). Springer, Berlin. doi:10.1007/978-3-540-73001-9_21
. (2007). Positive Enumerable Functors. In Connecting with Computability - 17th Conference on Computability in Europe, CiE 2021, Virtual Event, Ghent, July 5-9, 2021, Proceedings (Vol. 12813, pp. 385–394). Springer. doi:10.1007/978-3-030-80049-9_38
. (2021). . (Submitted). . (2020).
Optimal bounds for single-source Kolmogorov extractors. Trans. Amer. Math. Soc., 373, 1983–2006. doi:10.1090/tran/7972
. (2020). The reverse mathematics of Hindman's theorem for sums of exactly two elements. Computability, 8, 253–263. doi:10.3233/com-180094
. (2019). Finite computable dimension and degrees of categoricity. Ann. Pure Appl. Logic, 170, 58–94. doi:10.1016/j.apal.2018.08.012
. (2019). . (2017). Degrees of categoricity on a cone via η-systems. J. Symb. Log., 82, 325–346. doi:10.1017/jsl.2016.43
. (2017). Degrees that are not degrees of categoricity. Notre Dame J. Form. Log., 57, 389–398. doi:DOI:10.1215/00294527-3496154
. (2016). Measuring complexities of classes of structures. Ann. Pure Appl. Logic, 166, 1365–1381. doi:10.1016/j.apal.2015.08.001
. (2015). A bounded jump for the bounded Turing degrees. Notre Dame J. Form. Log., 55, 245–264. doi:10.1215/00294527-2420660
. (2014). Degrees of categoricity and the hyperarithmetic hierarchy. Notre Dame J. Form. Log., 54, 215–231. doi:10.1215/00294527-1960479
. (2013). The complexity of central series in nilpotent computable groups. Ann. Pure Appl. Logic, 162, 667–678. doi:10.1016/j.apal.2011.01.011
. (2011). . (2011). Limits on jump inversion for strong reducibilities. J. Symbolic Logic, 76, 1287–1296. doi:10.2178/jsl/1318338849
. (2011). . (2010).