default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBarbara F. Csima
Person information
- affiliation: University of Waterloo, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j26]Will Boney, Barbara F. Csima, Nancy A. Day, Matthew Harrison-Trainor:
Which Classes of Structures Are Both Pseudo-Elementary and Definable by an Infinitary Sentence? Bull. Symb. Log. 29(1): 1-18 (2023)- 2022
- [j25]Barbara F. Csima, Keng Meng Ng:
Every Δ20 degree is a strong degree of categoricity. J. Math. Log. 22(3): 2250022:1-2250022:18 (2022) - 2021
- [j24]Laurent Bienvenu, Barbara F. Csima, Matthew Harrison-Trainor:
Some Questions of Uniformity in Algorithmic Randomness. J. Symb. Log. 86(4): 1612-1631 (2021) - [c4]Barbara F. Csima, Dino Rossegger
, Daniel Yu:
Positive Enumerable Functors. CiE 2021: 385-394 - [i1]Laurent Bienvenu, Barbara F. Csima, Matthew Harrison-Trainor:
Some Questions of Uniformity in Algorithmic Randomness. CoRR abs/2111.01472 (2021) - 2020
- [j23]Barbara F. Csima, Michael Deveau, Matthew Harrison-Trainor, Mohammad Assem Mahmoud:
Degrees of categoricity above limit ordinals. Comput. 9(2): 127-137 (2020)
2010 – 2019
- 2019
- [j22]Barbara F. Csima, Jonathan Stephenson:
Finite computable dimension and degrees of categoricity. Ann. Pure Appl. Log. 170(1): 58-94 (2019) - [j21]Barbara F. Csima, Damir D. Dzhafarov, Denis R. Hirschfeldt, Carl G. Jockusch Jr., Reed Solomon, Linda Brown Westrick:
The reverse mathematics of Hindman's Theorem for sums of exactly two elements. Comput. 8(3-4): 253-263 (2019) - 2017
- [j20]Bernard A. Anderson, Barbara F. Csima, Karen M. Lange:
Bounded low and high sets. Arch. Math. Log. 56(5-6): 507-521 (2017) - [j19]Barbara F. Csima, Matthew Harrison-Trainor:
Degrees of Categoricity on a cone via η-Systems. J. Symb. Log. 82(1): 325-346 (2017) - 2016
- [j18]Bernard A. Anderson, Barbara F. Csima:
Degrees That Are Not Degrees of Categoricity. Notre Dame J. Formal Log. 57(3): 389-398 (2016) - 2015
- [j17]Barbara F. Csima, Carolyn Knoll:
Measuring complexities of classes of structures. Ann. Pure Appl. Log. 166(12): 1365-1381 (2015) - 2014
- [j16]Bernard A. Anderson, Barbara F. Csima:
A Bounded Jump for the Bounded Turing Degrees. Notre Dame J. Formal Log. 55(2): 245-264 (2014) - 2013
- [j15]Barbara F. Csima, Johanna N. Y. Franklin, Richard A. Shore:
Degrees of Categoricity and the Hyperarithmetic Hierarchy. Notre Dame J. Formal Log. 54(2): 215-231 (2013) - 2011
- [j14]Barbara F. Csima, Reed Solomon:
The complexity of central series in nilpotent computable groups. Ann. Pure Appl. Log. 162(8): 667-678 (2011) - [j13]Barbara F. Csima, Valentina S. Harizanov, Russell G. Miller, Antonio Montalbán:
Computability of Fraïssé limits. J. Symb. Log. 76(1): 66-93 (2011) - [j12]Barbara F. Csima, Rod Downey, Keng Meng Ng:
Limits on jump inversion for strong reducibilities. J. Symb. Log. 76(4): 1287-1296 (2011) - 2010
- [j11]Barbara F. Csima, Iskander Sh. Kalimullin:
Degree spectra and immunity properties. Math. Log. Q. 56(1): 67-77 (2010)
2000 – 2009
- 2009
- [j10]Douglas A. Cenzer, Barbara F. Csima, Bakhadyr Khoussainov:
Linear orders with distinguished function symbol. Arch. Math. Log. 48(1): 63-76 (2009) - [j9]Barbara F. Csima, Joseph R. Mileti:
The strength of the rainbow Ramsey Theorem. J. Symb. Log. 74(4): 1310-1324 (2009) - [j8]Barbara F. Csima:
The Settling Time Reducibility Ordering and Delta20 Sets. J. Log. Comput. 19(1): 145-150 (2009) - 2008
- [c3]Barbara F. Csima, Bakhadyr Khoussainov, Jiamou Liu:
Computable Categoricity of Graphs with Finite Components. CiE 2008: 139-148 - [c2]Barbara F. Csima, Bakhadyr Khoussainov:
When Is Reachability Intrinsically Decidable?. Developments in Language Theory 2008: 216-227 - 2007
- [j7]Barbara F. Csima, Valentina S. Harizanov, Denis R. Hirschfeldt, Robert I. Soare:
Bounding homogeneous models. J. Symb. Log. 72(1): 305-323 (2007) - [j6]Barbara F. Csima, Richard A. Shore:
The settling-time reducibility ordering. J. Symb. Log. 72(3): 1055-1071 (2007) - [c1]Barbara F. Csima:
Comparing C.E. Sets Based on Their Settling Times. CiE 2007: 196-204 - 2006
- [j5]Barbara F. Csima, Rod Downey, Noam Greenberg, Denis R. Hirschfeldt, Joseph S. Miller:
Every 1-generic computes a properly 1-generic. J. Symb. Log. 71(4): 1385-1393 (2006) - [j4]Barbara F. Csima, Robert I. Soare:
Computability results used in differential geometry. J. Symb. Log. 71(4): 1394-1410 (2006) - [j3]Barbara F. Csima, Antonio Montalbán, Richard A. Shore:
Boolean Algebras, Tarski Invariants, and Index Sets. Notre Dame J. Formal Log. 47(1): 1-23 (2006) - 2004
- [j2]Barbara F. Csima:
Degree spectra of prime models. J. Symb. Log. 69(2): 430-442 (2004) - [j1]Barbara F. Csima, Denis R. Hirschfeldt, Julia F. Knight, Robert I. Soare:
Bounding prime models. J. Symb. Log. 69(4): 1117-1142 (2004)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
