Publications

Search
Author [ Title(Desc)] Type Year
A
Csima, B. Flora. (2003). 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
B
Csima, B. F. , Montalbán, A. , & Shore, R. A. . (2006). Boolean algebras, Tarski invariants, and index sets. Notre Dame J. Formal Logic, 47, 1–23. doi:10.1305/ndjfl/1143468308
Anderson, B. , & Csima, B. . (2014). A bounded jump for the bounded Turing degrees. Notre Dame J. Form. Log., 55, 245–264. doi:10.1215/00294527-2420660
Anderson, B. A. , Csima, B. F. , & Lange, K. M. . (2017). Bounded low and high sets. Arch. Math. Logic, 56, 507–521. doi:10.1007/s00153-017-0537-8
Csima, B. F. , Harizanov, V. S. , Hirschfeldt, D. R. , & Soare, R. I. . (2007). Bounding homogeneous models. J. Symbolic Logic, 72, 305–323. doi:10.2178/jsl/1174668397
Csima, B. F. , Hirschfeldt, D. R. , Knight, J. F. , & Soare, R. I. . (2004). Bounding prime models. J. Symbolic Logic, 69, 1117–1142. doi:10.2178/jsl/1102022214
C
Csima, B. F. . (2007). 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
Csima, B. F. , & Solomon, R. . (2011). The complexity of central series in nilpotent computable groups. Ann. Pure Appl. Logic, 162, 667–678. doi:10.1016/j.apal.2011.01.011
Csima, B. F. , Harizanov, V. S. , Miller, R. , & Montalbán, A. . (2011). Computability of Fraïssé limits. J. Symbolic Logic, 76, 66–93. doi:10.2178/jsl/1294170990
Csima, B. F. , & Soare, R. I. . (2006). Computability results used in differential geometry. J. Symbolic Logic, 71, 1394–1410. doi:10.2178/jsl/1164060462
Csima, B. F. , Khoussainov, B. , & Liu, J. . (2008). 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
D
Csima, B. F. , & Kalimullin, I. S. . (2010). Degree spectra and immunity properties. MLQ Math. Log. Q., 56, 67–77. doi:10.1002/malq.200910001
Csima, B. F. . (2004). Degree spectra of prime models. J. Symbolic Logic, 69, 430–442. doi:10.2178/jsl/1082418536
Csima, B. F. , Deveau, M. , Harrison-Trainor, M. , & Mahmoud, M. Assem. (2020). Degrees of categoricity above limit ordinals. Computability, 9, 127–137. doi:10.3233/com-190254
Csima, B. F. , Franklin, J. N. Y. , & Shore, R. A. . (2013). Degrees of categoricity and the hyperarithmetic hierarchy. Notre Dame J. Form. Log., 54, 215–231. doi:10.1215/00294527-1960479
Csima, B. F. , & Harrison-Trainor, M. . (2017). Degrees of categoricity on a cone via η-systems. J. Symb. Log., 82, 325–346. doi:10.1017/jsl.2016.43
Anderson, B. , & Csima, B. . (2016). Degrees that are not degrees of categoricity. Notre Dame J. Form. Log., 57, 389–398. doi:DOI:10.1215/00294527-3496154
E
Csima, B. F. , Downey, R. , Greenberg, N. , Hirschfeldt, D. R. , & Miller, J. S. . (2006). Every 1-generic computes a properly 1-generic. J. Symbolic Logic, 71, 1385–1393. doi:10.2178/jsl/1164060461
Csima, B. F. , & Ng, K. Meng. (Submitted). Every $\Delta^0_2$ degree is a strong degree of categoricity. degreesofcat21.pdf
F
Csima, B. F. , & Stephenson, J. . (2019). Finite computable dimension and degrees of categoricity. Ann. Pure Appl. Logic, 170, 58–94. doi:10.1016/j.apal.2018.08.012

Pages