Publications

Search
Author [ Title(Desc)] Type Year
L
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
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
M
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
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
O
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
P
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
R
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
S
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. , & Shore, R. A. . (2007). The settling-time reducibility ordering. J. Symbolic Logic, 72, 1055–1071. doi:10.2178/jsl/1191333856
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
W
Csima, B. F. , Deveau, M. , & Stephenson, J. . (2017). When does a relation code an isomorphism?.
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
Boney, W. , Csima, B. F. , Day, N. A. , & Harrison-Trainor, M. . (2020). Which Classes of Structures Are Both Pseudo-elementary and Definable by an Infinitary Sentence?.

Pages