Publications
A minimal pair of $K$-degrees. Proc. Amer. Math. Soc., 134, 1499–1502. doi:10.1090/S0002-9939-05-08086-X
. (2006). Every 1-generic computes a properly 1-generic. J. Symbolic Logic, 71, 1385–1393. doi:10.2178/jsl/1164060461
. (2006). Boolean algebras, Tarski invariants, and index sets. Notre Dame J. Formal Logic, 47, 1–23. doi:10.1305/ndjfl/1143468308
. (2006). Computability results used in differential geometry. J. Symbolic Logic, 71, 1394–1410. doi:10.2178/jsl/1164060462
. (2006). . (2004). . (2004). Applications of computability theory to prime models and differential geometry (p. 45). ProQuest LLC, Ann Arbor, MI. Retrieved from http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:3088727
. (2003). Linear orders with distinguished function symbol. Arch. Math. Logic, 48, 63–76. doi:10.1007/s00153-008-0112-4
. (2009). . (2020).
Optimal bounds for single-source Kolmogorov extractors. Trans. Amer. Math. Soc., 373, 1983–2006. doi:10.1090/tran/7972
. (2020). . (2017).
Degrees that are not degrees of categoricity. Notre Dame J. Form. Log., 57, 389–398. doi:DOI:10.1215/00294527-3496154
. (2016). A bounded jump for the bounded Turing degrees. Notre Dame J. Form. Log., 55, 245–264. doi:10.1215/00294527-2420660
. (2014).