Publications

Search
Author Title Type Year(Desc)
2003
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
2004
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
Csima, B. F.. (2004). Degree spectra of prime models. J. Symbolic Logic, 69, 430–442. doi:10.2178/jsl/1082418536
2006
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
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., & Montalbán, A.. (2006). A minimal pair of $K$-degrees. Proc. Amer. Math. Soc., 134, 1499–1502. doi:10.1090/S0002-9939-05-08086-X
Csima, B. F., & Soare, R. I.. (2006). Computability results used in differential geometry. J. Symbolic Logic, 71, 1394–1410. doi:10.2178/jsl/1164060462
2007
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.. (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., & Shore, R. A.. (2007). The settling-time reducibility ordering. J. Symbolic Logic, 72, 1055–1071. doi:10.2178/jsl/1191333856
2008
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
Csima, B. F., & Khoussainov, B.. (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
2009
Cenzer, D., Csima, B. F., & Khoussainov, B.. (2009). Linear orders with distinguished function symbol. Arch. Math. Logic, 48, 63–76. doi:10.1007/s00153-008-0112-4
Csima, B. F.. (2009). The settling time reducibility ordering and $\Delta_2^0$ sets. J. Logic Comput., 19, 145–150. doi:10.1093/logcom/exn031
Csima, B. F., & Mileti, J. R.. (2009). The strength of the rainbow Ramsey theorem. J. Symbolic Logic, 74, 1310–1324. doi:10.2178/jsl/1254748693
2010
Csima, B. F., & Kalimullin, I. S.. (2010). Degree spectra and immunity properties. MLQ Math. Log. Q., 56, 67–77. doi:10.1002/malq.200910001
2011
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., Downey, R., & Ng, K. Meng. (2011). Limits on jump inversion for strong reducibilities. J. Symbolic Logic, 76, 1287–1296. doi:10.2178/jsl/1318338849
2013
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

Pages