Barbara F. Csima

Affiliations:
  • University of Waterloo, Canada


According to our database1, Barbara F. Csima authored at least 31 papers between 2004 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
ON THE C.E. DEGREES REALIZABLE IN $\Pi ^0_1$ CLASSES.
J. Symb. Log., 2024

2023
Which Classes of Structures Are Both Pseudo-Elementary and Definable by an Infinitary Sentence?
Bull. Symb. Log., March, 2023

2022
Every Δ20 degree is a strong degree of categoricity.
J. Math. Log., 2022

2021
Some Questions of Uniformity in Algorithmic Randomness.
J. Symb. Log., 2021

Positive Enumerable Functors.
Proceedings of the Connecting with Computability, 2021

2020
Degrees of categoricity above limit ordinals.
Comput., 2020

2019
The reverse mathematics of Hindman's Theorem for sums of exactly two elements.
Comput., 2019

Finite computable dimension and degrees of categoricity.
Ann. Pure Appl. Log., 2019

2017
Degrees of Categoricity on a cone via η-Systems.
J. Symb. Log., 2017

Bounded low and high sets.
Arch. Math. Log., 2017

2016
Degrees That Are Not Degrees of Categoricity.
Notre Dame J. Formal Log., 2016

2015
Measuring complexities of classes of structures.
Ann. Pure Appl. Log., 2015

2014
A Bounded Jump for the Bounded Turing Degrees.
Notre Dame J. Formal Log., 2014

2013
Degrees of Categoricity and the Hyperarithmetic Hierarchy.
Notre Dame J. Formal Log., 2013

2011
Computability of Fraïssé limits.
J. Symb. Log., 2011

Limits on jump inversion for strong reducibilities.
J. Symb. Log., 2011

The complexity of central series in nilpotent computable groups.
Ann. Pure Appl. Log., 2011

2010
Degree spectra and immunity properties.
Math. Log. Q., 2010

2009
The Settling Time Reducibility Ordering and Delta<sub>2</sub><sup>0</sup> Sets.
J. Log. Comput., 2009

The strength of the rainbow Ramsey Theorem.
J. Symb. Log., 2009

Linear orders with distinguished function symbol.
Arch. Math. Log., 2009

2008
When Is Reachability Intrinsically Decidable?.
Proceedings of the Developments in Language Theory, 12th International Conference, 2008

Computable Categoricity of Graphs with Finite Components.
Proceedings of the Logic and Theory of Algorithms, 2008

2007
The settling-time reducibility ordering.
J. Symb. Log., 2007

Bounding homogeneous models.
J. Symb. Log., 2007

Comparing C.E. Sets Based on Their Settling Times.
Proceedings of the Computation and Logic in the Real World, 2007

2006
Boolean Algebras, Tarski Invariants, and Index Sets.
Notre Dame J. Formal Log., 2006

Computability results used in differential geometry.
J. Symb. Log., 2006

Every 1-generic computes a properly 1-generic.
J. Symb. Log., 2006

2004
Bounding prime models.
J. Symb. Log., 2004

Degree spectra of prime models.
J. Symb. Log., 2004


  Loading...