%0 Journal Article
%J J. Symb. Log.
%D 2024
%T On the c.e. degrees realizable in $\Pi^0_1$ classes
%A Csima, Barbara F.
%A Downey, Rod
%A Ng, Keng Meng
%B J. Symb. Log.
%V 89
%P 1370–1395
%G eng
%U https://doi.org/10.1017/jsl.2023.26
%R 10.1017/jsl.2023.26

%0 Journal Article
%J J. Math. Log.
%D 2024
%T Degrees of categoricity and treeable degrees
%A Csima, Barbara F.
%A Rossegger, Dino
%B J. Math. Log.
%V 24
%P Paper No. 2450002, 18
%G eng
%U https://doi.org/10.1142/S0219061324500028
%R 10.1142/S0219061324500028

%0 Journal Article
%J MLQ Math. Log. Q.
%D 2024
%T Effectiveness of Walker's cancellation theorem
%A Al-Hellawi, Layth
%A Alvir, Rachael
%A Csima, Barbara F.
%A Xie, Xinyue
%B MLQ Math. Log. Q.
%V 70
%P 347–355
%G eng
%U https://doi.org/10.1002/malq.202400030
%R 10.1002/malq.202400030

%0 Journal Article
%J Bull. Symb. Log.
%D 2023
%T Which classes of structures are both pseudo-elementary and definable by an infinitary sentence?
%A Boney, Will
%A Csima, Barbara F.
%A Day, Nancy A.
%A Harrison-Trainor, Matthew
%B Bull. Symb. Log.
%V 29
%P 1–18
%G eng
%U https://doi.org/10.1017/bsl.2023.1
%R 10.1017/bsl.2023.1

%0 Journal Article
%J J. Math. Log.
%D 2022
%T Every $\Delta_2^0$ degree is a strong degree of categoricity
%A Csima, Barbara F.
%A Ng, Keng Meng
%B J. Math. Log.
%V 22
%P Paper No. 2250022, 18
%G eng
%U https://doi.org/10.1142/S0219061322500222
%R 10.1142/S0219061322500222

%0 Conference Paper
%B Connecting with Computability - 17th Conference on Computability in Europe, CiE 2021, Virtual Event, Ghent, July 5-9, 2021, Proceedings
%D 2021
%T Positive Enumerable Functors
%A Barbara F. Csima
%A Dino Rossegger
%A Daniel Yu
%E Liesbeth De Mol
%E Andreas Weiermann
%E Florin Manea
%E David Fernández-Duque
%B Connecting with Computability - 17th Conference on Computability in Europe, CiE 2021, Virtual Event, Ghent, July 5-9, 2021, Proceedings
%S Lecture Notes in Computer Science
%I Springer
%V 12813
%P 385–394
%G eng
%U https://doi.org/10.1007/978-3-030-80049-9_38
%R 10.1007/978-3-030-80049-9_38

%0 Journal Article
%J J. Symb. Log.
%D 2021
%T Some questions of uniformity in algorithmic randomness
%A Bienvenu, Laurent
%A Csima, Barbara F.
%A Harrison-Trainor, Matthew
%B J. Symb. Log.
%V 86
%P 1612–1631
%G eng
%U https://doi.org/10.1017/jsl.2021.58
%R 10.1017/jsl.2021.58

%0 Journal Article
%J Computability
%D 2020
%T Degrees of categoricity above limit ordinals
%A Csima, Barbara F.
%A Deveau, Michael
%A Harrison-Trainor, Matthew
%A Mahmoud, Mohammad Assem
%B Computability
%V 9
%P 127–137
%G eng
%U https://doi-org.proxy.lib.uwaterloo.ca/10.3233/com-190254
%R 10.3233/com-190254

%0 Journal Article
%J Trans. Amer. Math. Soc.
%D 2020
%T Optimal bounds for single-source Kolmogorov extractors
%A Bienvenu, Laurent
%A Csima, Barbara F.
%A Harrison-Trainor, Matthew
%B Trans. Amer. Math. Soc.
%V 373
%P 1983–2006
%G eng
%U https://doi-org.proxy.lib.uwaterloo.ca/10.1090/tran/7972
%R 10.1090/tran/7972

%0 Journal Article
%J Ann. Pure Appl. Logic
%D 2019
%T Finite computable dimension and degrees of categoricity
%A Csima, Barbara F.
%A Stephenson, Jonathan
%B Ann. Pure Appl. Logic
%V 170
%P 58–94
%G eng
%U https://doi.org/10.1016/j.apal.2018.08.012
%R 10.1016/j.apal.2018.08.012

%0 Journal Article
%J Computability
%D 2019
%T The reverse mathematics of Hindman's theorem for sums of exactly two elements
%A Csima, Barbara F.
%A Dzhafarov, Damir D.
%A Hirschfeldt, Denis R.
%A Jockusch, Carl G. Jr.
%A Solomon, Reed
%A Westrick, Linda Brown
%B Computability
%V 8
%P 253–263
%G eng
%U https://doi-org.proxy.lib.uwaterloo.ca/10.3233/com-180094
%R 10.3233/com-180094

%0 Journal Article
%J Arch. Math. Logic
%D 2017
%T Bounded low and high sets
%A Anderson, Bernard A.
%A Csima, Barbara F.
%A Lange, Karen M.
%B Arch. Math. Logic
%V 56
%P 507–521
%G eng
%U https://doi.org/10.1007/s00153-017-0537-8
%R 10.1007/s00153-017-0537-8

%0 Journal Article
%J J. Symb. Log.
%D 2017
%T Degrees of categoricity on a cone via η-systems
%A Csima, Barbara F.
%A Harrison-Trainor, Matthew
%B J. Symb. Log.
%V 82
%P 325–346
%G eng
%U https://doi.org/10.1017/jsl.2016.43
%R 10.1017/jsl.2016.43

%0 Unpublished Work
%D 2017
%T When does a relation code an isomorphism?
%A Csima, Barbara F.
%A Deveau, Michael
%A Stephenson, Jonathan
%G eng

%0 Journal Article
%J Notre Dame J. Form. Log.
%D 2016
%T Degrees that are not degrees of categoricity
%A Anderson, Bernard
%A Csima, Barbara
%B Notre Dame J. Form. Log.
%V 57
%P 389–398
%G eng
%U https://doi.org/DOI:10.1215/00294527-3496154
%R DOI:10.1215/00294527-3496154

%0 Journal Article
%J Ann. Pure Appl. Logic
%D 2015
%T Measuring complexities of classes of structures
%A Csima, Barbara F.
%A Knoll, Carolyn
%B Ann. Pure Appl. Logic
%V 166
%P 1365–1381
%G eng
%U https://doi.org/10.1016/j.apal.2015.08.001
%R 10.1016/j.apal.2015.08.001

%0 Journal Article
%J Notre Dame J. Form. Log.
%D 2014
%T A bounded jump for the bounded Turing degrees
%A Anderson, Bernard
%A Csima, Barbara
%B Notre Dame J. Form. Log.
%V 55
%P 245–264
%G eng
%U https://doi.org/10.1215/00294527-2420660
%R 10.1215/00294527-2420660

%0 Journal Article
%J Notre Dame J. Form. Log.
%D 2013
%T Degrees of categoricity and the hyperarithmetic hierarchy
%A Csima, Barbara F.
%A Franklin, Johanna N. Y.
%A Shore, Richard A.
%B Notre Dame J. Form. Log.
%V 54
%P 215–231
%G eng
%U https://doi.org/10.1215/00294527-1960479
%R 10.1215/00294527-1960479

%0 Journal Article
%J Ann. Pure Appl. Logic
%D 2011
%T The complexity of central series in nilpotent computable groups
%A Csima, Barbara F.
%A Solomon, Reed
%B Ann. Pure Appl. Logic
%V 162
%P 667–678
%G eng
%U https://doi.org/10.1016/j.apal.2011.01.011
%R 10.1016/j.apal.2011.01.011

%0 Journal Article
%J J. Symbolic Logic
%D 2011
%T Computability of Fraïssé limits
%A Csima, Barbara F.
%A Harizanov, Valentina S.
%A Miller, Russell
%A Montalbán, Antonio
%B J. Symbolic Logic
%V 76
%P 66–93
%G eng
%U https://doi.org/10.2178/jsl/1294170990
%R 10.2178/jsl/1294170990

%0 Journal Article
%J J. Symbolic Logic
%D 2011
%T Limits on jump inversion for strong reducibilities
%A Csima, Barbara F.
%A Downey, Rod
%A Ng, Keng Meng
%B J. Symbolic Logic
%V 76
%P 1287–1296
%G eng
%U https://doi.org/10.2178/jsl/1318338849
%R 10.2178/jsl/1318338849

%0 Journal Article
%J MLQ Math. Log. Q.
%D 2010
%T Degree spectra and immunity properties
%A Csima, Barbara F.
%A Kalimullin, Iskander S.
%B MLQ Math. Log. Q.
%V 56
%P 67–77
%G eng
%U https://doi.org/10.1002/malq.200910001
%R 10.1002/malq.200910001

%0 Journal Article
%J Arch. Math. Logic
%D 2009
%T Linear orders with distinguished function symbol
%A Cenzer, Douglas
%A Csima, Barbara F.
%A Khoussainov, Bakhadyr
%B Arch. Math. Logic
%V 48
%P 63–76
%G eng
%U https://doi.org/10.1007/s00153-008-0112-4
%R 10.1007/s00153-008-0112-4

%0 Journal Article
%J J. Logic Comput.
%D 2009
%T The settling time reducibility ordering and $\Delta_2^0$ sets
%A Csima, Barbara F.
%B J. Logic Comput.
%V 19
%P 145–150
%G eng
%U https://doi.org/10.1093/logcom/exn031
%R 10.1093/logcom/exn031

%0 Journal Article
%J J. Symbolic Logic
%D 2009
%T The strength of the rainbow Ramsey theorem
%A Csima, Barbara F.
%A Mileti, Joseph R.
%B J. Symbolic Logic
%V 74
%P 1310–1324
%G eng
%U https://doi.org/10.2178/jsl/1254748693
%R 10.2178/jsl/1254748693

%0 Book Section
%B Logic and theory of algorithms
%D 2008
%T Computable categoricity of graphs with finite components
%A Csima, Barbara F.
%A Khoussainov, Bakhadyr
%A Liu, Jiamou
%B Logic and theory of algorithms
%S Lecture Notes in Comput. Sci.
%I Springer, Berlin
%V 5028
%P 139–148
%G eng
%U https://doi.org/10.1007/978-3-540-69407-6_15
%R 10.1007/978-3-540-69407-6_15

%0 Book Section
%B Developments in language theory
%D 2008
%T When is reachability intrinsically decidable?
%A Csima, Barbara F.
%A Khoussainov, Bakhadyr
%B Developments in language theory
%S Lecture Notes in Comput. Sci.
%I Springer, Berlin
%V 5257
%P 216–227
%G eng
%U https://doi.org/10.1007/978-3-540-85780-8_17
%R 10.1007/978-3-540-85780-8_17

%0 Journal Article
%J J. Symbolic Logic
%D 2007
%T Bounding homogeneous models
%A Csima, Barbara F.
%A Harizanov, Valentina S.
%A Hirschfeldt, Denis R.
%A Soare, Robert I.
%B J. Symbolic Logic
%V 72
%P 305–323
%G eng
%U https://doi.org/10.2178/jsl/1174668397
%R 10.2178/jsl/1174668397

%0 Book Section
%B Computation and logic in the real world
%D 2007
%T Comparing c.e. sets based on their settling times
%A Csima, Barbara F.
%B Computation and logic in the real world
%S Lecture Notes in Comput. Sci.
%I Springer, Berlin
%V 4497
%P 196–204
%G eng
%U https://doi.org/10.1007/978-3-540-73001-9_21
%R 10.1007/978-3-540-73001-9_21

%0 Journal Article
%J J. Symbolic Logic
%D 2007
%T The settling-time reducibility ordering
%A Csima, Barbara F.
%A Shore, Richard A.
%B J. Symbolic Logic
%V 72
%P 1055–1071
%G eng
%U https://doi.org/10.2178/jsl/1191333856
%R 10.2178/jsl/1191333856

%0 Journal Article
%J Notre Dame J. Formal Logic
%D 2006
%T Boolean algebras, Tarski invariants, and index sets
%A Csima, Barbara F.
%A Montalbán, Antonio
%A Shore, Richard A.
%B Notre Dame J. Formal Logic
%V 47
%P 1–23
%G eng
%U https://doi.org/10.1305/ndjfl/1143468308
%R 10.1305/ndjfl/1143468308

%0 Journal Article
%J J. Symbolic Logic
%D 2006
%T Computability results used in differential geometry
%A Csima, Barbara F.
%A Soare, Robert I.
%B J. Symbolic Logic
%V 71
%P 1394–1410
%G eng
%U https://doi.org/10.2178/jsl/1164060462
%R 10.2178/jsl/1164060462

%0 Journal Article
%J J. Symbolic Logic
%D 2006
%T Every 1-generic computes a properly 1-generic
%A Csima, Barbara F.
%A Downey, Rod
%A Greenberg, Noam
%A Hirschfeldt, Denis R.
%A Miller, Joseph S.
%B J. Symbolic Logic
%V 71
%P 1385–1393
%G eng
%U https://doi.org/10.2178/jsl/1164060461
%R 10.2178/jsl/1164060461

%0 Journal Article
%J Proc. Amer. Math. Soc.
%D 2006
%T A minimal pair of $K$-degrees
%A Csima, Barbara F.
%A Montalbán, Antonio
%B Proc. Amer. Math. Soc.
%V 134
%P 1499–1502
%G eng
%U https://doi.org/10.1090/S0002-9939-05-08086-X
%R 10.1090/S0002-9939-05-08086-X

%0 Journal Article
%J J. Symbolic Logic
%D 2004
%T Bounding prime models
%A Csima, Barbara F.
%A Hirschfeldt, Denis R.
%A Knight, Julia F.
%A Soare, Robert I.
%B J. Symbolic Logic
%V 69
%P 1117–1142
%G eng
%U https://doi.org/10.2178/jsl/1102022214
%R 10.2178/jsl/1102022214

%0 Journal Article
%J J. Symbolic Logic
%D 2004
%T Degree spectra of prime models
%A Csima, Barbara F.
%B J. Symbolic Logic
%V 69
%P 430–442
%G eng
%U https://doi.org/10.2178/jsl/1082418536
%R 10.2178/jsl/1082418536

%0 Book
%D 2003
%T Applications of computability theory to prime models and differential geometry
%A Csima, Barbara Flora
%I ProQuest LLC, Ann Arbor, MI
%P 45
%@ 978-0496-36466-4
%G eng
%U 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