Degree spectra of prime models. - Barbara F. Csima (J. Symb. Log., 2004)

Bounding prime models. - Barbara F. Csima; Denis R. Hirschfeldt; Julia F. Knight; Robert I. Soare (J. Symb. Log., 2004)

Every 1-generic computes a properly 1-generic. - Barbara F. Csima; Rod Downey; Noam Greenberg; Denis R. Hirschfeldt; Joseph S. Miller (J. Symb. Log., 2006)

Computability results used in differential geometry. - Barbara F. Csima; Robert I. Soare (J. Symb. Log., 2006)

Boolean Algebras, Tarski Invariants, and Index Sets. - Barbara F. Csima; Antonio Montalbán; Richard A. Shore (Notre Dame J. Formal Log., 2006)

Comparing C.E. Sets Based on Their Settling Times. - Barbara F. Csima (CiE, 2007)

Bounding homogeneous models. - Barbara F. Csima; Valentina S. Harizanov; Denis R. Hirschfeldt; Robert I. Soare (J. Symb. Log., 2007)

The settling-time reducibility ordering. - Barbara F. Csima; Richard A. Shore (J. Symb. Log., 2007)

Computable Categoricity of Graphs with Finite Components. - Barbara F. Csima; Bakhadyr Khoussainov; Jiamou Liu (CiE, 2008)

When Is Reachability Intrinsically Decidable?. - Barbara F. Csima; Bakhadyr Khoussainov (Developments in Language Theory, 2008)

Linear orders with distinguished function symbol. - Douglas A. Cenzer; Barbara F. Csima; Bakhadyr Khoussainov (Arch. Math. Log., 2009)

The strength of the rainbow Ramsey Theorem. - Barbara F. Csima; Joseph R. Mileti (J. Symb. Log., 2009)

The Settling Time Reducibility Ordering and Delta20 Sets. - Barbara F. Csima (J. Log. Comput., 2009)

Degree spectra and immunity properties. - Barbara F. Csima; Iskander Sh. Kalimullin (Math. Log. Q., 2010)

The complexity of central series in nilpotent computable groups. - Barbara F. Csima; Reed Solomon (Ann. Pure Appl. Log., 2011)

Limits on jump inversion for strong reducibilities. - Barbara F. Csima; Rod Downey; Keng Meng Ng (J. Symb. Log., 2011)

Computability of Fraïssé limits. - Barbara F. Csima; Valentina S. Harizanov; Russell G. Miller; Antonio Montalbán (J. Symb. Log., 2011)

Degrees of Categoricity and the Hyperarithmetic Hierarchy. - Barbara F. Csima; Johanna N. Y. Franklin; Richard A. Shore (Notre Dame J. Formal Log., 2013)

A Bounded Jump for the Bounded Turing Degrees. - Bernard A. Anderson; Barbara F. Csima (Notre Dame J. Formal Log., 2014)

Measuring complexities of classes of structures. - Barbara F. Csima; Carolyn Knoll (Ann. Pure Appl. Log., 2015)

Degrees That Are Not Degrees of Categoricity. - Bernard A. Anderson; Barbara F. Csima (Notre Dame J. Formal Log., 2016)

Bounded low and high sets. - Bernard A. Anderson; Barbara F. Csima; Karen M. Lange (Arch. Math. Log., 2017)

Degrees of Categoricity on a cone via η-Systems. - Barbara F. Csima; Matthew Harrison-Trainor (J. Symb. Log., 2017)

Finite computable dimension and degrees of categoricity. - Barbara F. Csima; Jonathan Stephenson (Ann. Pure Appl. Log., 2019)

The reverse mathematics of Hindman's Theorem for sums of exactly two elements. - Barbara F. Csima; Damir D. Dzhafarov; Denis R. Hirschfeldt; Carl G. Jockusch Jr.; Reed Solomon; Linda Brown Westrick (Comput., 2019)

Degrees of categoricity above limit ordinals. - Barbara F. Csima; Michael Deveau; Matthew Harrison-Trainor; Mohammad Assem Mahmoud (Comput., 2020)

Positive Enumerable Functors. - Barbara F. Csima; Dino Rossegger; Daniel Yu (CiE, 2021)

Some Questions of Uniformity in Algorithmic Randomness. - Laurent Bienvenu; Barbara F. Csima; Matthew Harrison-Trainor (J. Symb. Log., 2021)

Every Δ20 degree is a strong degree of categoricity. - Barbara F. Csima; Keng Meng Ng (J. Math. Log., 2022)

Which Classes of Structures Are Both Pseudo-Elementary and Definable by an Infinitary Sentence? - Will Boney; Barbara F. Csima; Nancy A. Day; Matthew Harrison-Trainor (Bull. Symb. Log., 2023)

ON THE C.E. DEGREES REALIZABLE IN $ Pi ^0_1$ CLASSES. - Barbara F. Csima; Rod Downey; Keng Meng Ng (J. Symb. Log., 2024)

Degrees of categoricity and treeable degrees. - Barbara F. Csima; Dino Rossegger (J. Math. Log., 2024)