Publications

Search
Author Title Type Year(Asc)
2024
Csima, B. F., Downey, R., & Ng, K. Meng. (2024). On the c.e. degrees realizable in $\Pi^0_1$ classes. J. Symb. Log., 89, 1370–1395. doi:10.1017/jsl.2023.26
Al-Hellawi, L., Alvir, R., Csima, B. F., & Xie, X.. (2024). Effectiveness of Walker's cancellation theorem. MLQ Math. Log. Q., 70, 347–355. doi:10.1002/malq.202400030
Csima, B. F., & Rossegger, D.. (2024). Degrees of categoricity and treeable degrees. J. Math. Log., 24, Paper No. 2450002, 18. doi:10.1142/S0219061324500028
2023
Boney, W., Csima, B. F., Day, N. A., & Harrison-Trainor, M.. (2023). Which classes of structures are both pseudo-elementary and definable by an infinitary sentence?. Bull. Symb. Log., 29, 1–18. doi:10.1017/bsl.2023.1
2022
Csima, B. F., & Ng, K. Meng. (2022). Every $\Delta_2^0$ degree is a strong degree of categoricity. J. Math. Log., 22, Paper No. 2250022, 18. doi:10.1142/S0219061322500222
2021
Bienvenu, L., Csima, B. F., & Harrison-Trainor, M.. (2021). Some questions of uniformity in algorithmic randomness. J. Symb. Log., 86, 1612–1631. doi:10.1017/jsl.2021.58
Csima, B. F., Rossegger, D., & Yu, D.. (2021). 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
2020
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
Bienvenu, L., Csima, B. F., & Harrison-Trainor, M.. (2020). Optimal bounds for single-source Kolmogorov extractors. Trans. Amer. Math. Soc., 373, 1983–2006. doi:10.1090/tran/7972
2019
Csima, B. F., Dzhafarov, D. D., Hirschfeldt, D. R., Jockusch, Jr., C. G., Solomon, R., & Westrick, L. Brown. (2019). The reverse mathematics of Hindman's theorem for sums of exactly two elements. Computability, 8, 253–263. doi:10.3233/com-180094
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
2017
Csima, B. F., Deveau, M., & Stephenson, J.. (2017). When does a relation code an isomorphism?.
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., & Harrison-Trainor, M.. (2017). Degrees of categoricity on a cone via η-systems. J. Symb. Log., 82, 325–346. doi:10.1017/jsl.2016.43
2016
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
2015
Csima, B. F., & Knoll, C.. (2015). Measuring complexities of classes of structures. Ann. Pure Appl. Logic, 166, 1365–1381. doi:10.1016/j.apal.2015.08.001
2014
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
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
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

Pages