<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Csima, Barbara F.</style></author><author><style face="normal" font="default" size="100%">Downey, Rod</style></author><author><style face="normal" font="default" size="100%">Ng, Keng Meng</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">On the c.e. degrees realizable in $\Pi^0_1$ classes</style></title><secondary-title><style face="normal" font="default" size="100%">J. Symb. Log.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2024</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1017/jsl.2023.26</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">3</style></number><volume><style face="normal" font="default" size="100%">89</style></volume><pages><style face="normal" font="default" size="100%">1370–1395</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Csima, Barbara F.</style></author><author><style face="normal" font="default" size="100%">Rossegger, Dino</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Degrees of categoricity and treeable degrees</style></title><secondary-title><style face="normal" font="default" size="100%">J. Math. Log.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2024</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1142/S0219061324500028</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">3</style></number><volume><style face="normal" font="default" size="100%">24</style></volume><pages><style face="normal" font="default" size="100%">Paper No. 2450002, 18</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Al-Hellawi, Layth</style></author><author><style face="normal" font="default" size="100%">Alvir, Rachael</style></author><author><style face="normal" font="default" size="100%">Csima, Barbara F.</style></author><author><style face="normal" font="default" size="100%">Xie, Xinyue</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Effectiveness of Walker's cancellation theorem</style></title><secondary-title><style face="normal" font="default" size="100%">MLQ Math. Log. Q.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2024</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1002/malq.202400030</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">3</style></number><volume><style face="normal" font="default" size="100%">70</style></volume><pages><style face="normal" font="default" size="100%">347–355</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Boney, Will</style></author><author><style face="normal" font="default" size="100%">Csima, Barbara F.</style></author><author><style face="normal" font="default" size="100%">Day, Nancy A.</style></author><author><style face="normal" font="default" size="100%">Harrison-Trainor, Matthew</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Which classes of structures are both pseudo-elementary and definable by an infinitary sentence?</style></title><secondary-title><style face="normal" font="default" size="100%">Bull. Symb. Log.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2023</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1017/bsl.2023.1</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">1</style></number><volume><style face="normal" font="default" size="100%">29</style></volume><pages><style face="normal" font="default" size="100%">1–18</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Csima, Barbara F.</style></author><author><style face="normal" font="default" size="100%">Ng, Keng Meng</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Every $\Delta_2^0$ degree is a strong degree of categoricity</style></title><secondary-title><style face="normal" font="default" size="100%">J. Math. Log.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2022</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1142/S0219061322500222</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">3</style></number><volume><style face="normal" font="default" size="100%">22</style></volume><pages><style face="normal" font="default" size="100%">Paper No. 2250022, 18</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Barbara F. Csima</style></author><author><style face="normal" font="default" size="100%">Dino Rossegger</style></author><author><style face="normal" font="default" size="100%">Daniel Yu</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Liesbeth De Mol</style></author><author><style face="normal" font="default" size="100%">Andreas Weiermann</style></author><author><style face="normal" font="default" size="100%">Florin Manea</style></author><author><style face="normal" font="default" size="100%">David Fernández-Duque</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Positive Enumerable Functors</style></title><secondary-title><style face="normal" font="default" size="100%">Connecting with Computability - 17th Conference on Computability in Europe, CiE 2021, Virtual Event, Ghent, July 5-9, 2021, Proceedings</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2021</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1007/978-3-030-80049-9_38</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><volume><style face="normal" font="default" size="100%">12813</style></volume><pages><style face="normal" font="default" size="100%">385–394</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Bienvenu, Laurent</style></author><author><style face="normal" font="default" size="100%">Csima, Barbara F.</style></author><author><style face="normal" font="default" size="100%">Harrison-Trainor, Matthew</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Some questions of uniformity in algorithmic randomness</style></title><secondary-title><style face="normal" font="default" size="100%">J. Symb. Log.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2021</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1017/jsl.2021.58</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">4</style></number><volume><style face="normal" font="default" size="100%">86</style></volume><pages><style face="normal" font="default" size="100%">1612–1631</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Csima, Barbara F.</style></author><author><style face="normal" font="default" size="100%">Deveau, Michael</style></author><author><style face="normal" font="default" size="100%">Harrison-Trainor, Matthew</style></author><author><style face="normal" font="default" size="100%">Mahmoud, Mohammad Assem</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Degrees of categoricity above limit ordinals</style></title><secondary-title><style face="normal" font="default" size="100%">Computability</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2020</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi-org.proxy.lib.uwaterloo.ca/10.3233/com-190254</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">2</style></number><volume><style face="normal" font="default" size="100%">9</style></volume><pages><style face="normal" font="default" size="100%">127–137</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Bienvenu, Laurent</style></author><author><style face="normal" font="default" size="100%">Csima, Barbara F.</style></author><author><style face="normal" font="default" size="100%">Harrison-Trainor, Matthew</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Optimal bounds for single-source Kolmogorov extractors</style></title><secondary-title><style face="normal" font="default" size="100%">Trans. Amer. Math. Soc.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2020</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi-org.proxy.lib.uwaterloo.ca/10.1090/tran/7972</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">3</style></number><volume><style face="normal" font="default" size="100%">373</style></volume><pages><style face="normal" font="default" size="100%">1983–2006</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Csima, Barbara F.</style></author><author><style face="normal" font="default" size="100%">Stephenson, Jonathan</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Finite computable dimension and degrees of categoricity</style></title><secondary-title><style face="normal" font="default" size="100%">Ann. Pure Appl. Logic</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2019</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1016/j.apal.2018.08.012</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">1</style></number><volume><style face="normal" font="default" size="100%">170</style></volume><pages><style face="normal" font="default" size="100%">58–94</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Csima, Barbara F.</style></author><author><style face="normal" font="default" size="100%">Dzhafarov, Damir D.</style></author><author><style face="normal" font="default" size="100%">Hirschfeldt, Denis R.</style></author><author><style face="normal" font="default" size="100%">Jockusch, Carl G. Jr.</style></author><author><style face="normal" font="default" size="100%">Solomon, Reed</style></author><author><style face="normal" font="default" size="100%">Westrick, Linda Brown</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The reverse mathematics of Hindman&amp;#39;s theorem for sums of exactly two elements</style></title><secondary-title><style face="normal" font="default" size="100%">Computability</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2019</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi-org.proxy.lib.uwaterloo.ca/10.3233/com-180094</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">3-4</style></number><volume><style face="normal" font="default" size="100%">8</style></volume><pages><style face="normal" font="default" size="100%">253–263</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Anderson, Bernard A.</style></author><author><style face="normal" font="default" size="100%">Csima, Barbara F.</style></author><author><style face="normal" font="default" size="100%">Lange, Karen M.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Bounded low and high sets</style></title><secondary-title><style face="normal" font="default" size="100%">Arch. Math. Logic</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1007/s00153-017-0537-8</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">5-6</style></number><volume><style face="normal" font="default" size="100%">56</style></volume><pages><style face="normal" font="default" size="100%">507–521</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Csima, Barbara F.</style></author><author><style face="normal" font="default" size="100%">Harrison-Trainor, Matthew</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Degrees of categoricity on a cone via η-systems</style></title><secondary-title><style face="normal" font="default" size="100%">J. Symb. Log.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1017/jsl.2016.43</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">1</style></number><volume><style face="normal" font="default" size="100%">82</style></volume><pages><style face="normal" font="default" size="100%">325–346</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>34</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Csima, Barbara F.</style></author><author><style face="normal" font="default" size="100%">Deveau, Michael</style></author><author><style face="normal" font="default" size="100%">Stephenson, Jonathan</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">When does a relation code an isomorphism?</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Anderson, Bernard</style></author><author><style face="normal" font="default" size="100%">Csima, Barbara</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Degrees that are not degrees of categoricity</style></title><secondary-title><style face="normal" font="default" size="100%">Notre Dame J. Form. Log.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2016</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/DOI:10.1215/00294527-3496154</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">3</style></number><volume><style face="normal" font="default" size="100%">57</style></volume><pages><style face="normal" font="default" size="100%">389–398</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Csima, Barbara F.</style></author><author><style face="normal" font="default" size="100%">Knoll, Carolyn</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Measuring complexities of classes of structures</style></title><secondary-title><style face="normal" font="default" size="100%">Ann. Pure Appl. Logic</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2015</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1016/j.apal.2015.08.001</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">12</style></number><volume><style face="normal" font="default" size="100%">166</style></volume><pages><style face="normal" font="default" size="100%">1365–1381</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Anderson, Bernard</style></author><author><style face="normal" font="default" size="100%">Csima, Barbara</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A bounded jump for the bounded Turing degrees</style></title><secondary-title><style face="normal" font="default" size="100%">Notre Dame J. Form. Log.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2014</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1215/00294527-2420660</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">2</style></number><volume><style face="normal" font="default" size="100%">55</style></volume><pages><style face="normal" font="default" size="100%">245–264</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Csima, Barbara F.</style></author><author><style face="normal" font="default" size="100%">Franklin, Johanna N. Y.</style></author><author><style face="normal" font="default" size="100%">Shore, Richard A.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Degrees of categoricity and the hyperarithmetic hierarchy</style></title><secondary-title><style face="normal" font="default" size="100%">Notre Dame J. Form. Log.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1215/00294527-1960479</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">2</style></number><volume><style face="normal" font="default" size="100%">54</style></volume><pages><style face="normal" font="default" size="100%">215–231</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Csima, Barbara F.</style></author><author><style face="normal" font="default" size="100%">Solomon, Reed</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The complexity of central series in nilpotent computable groups</style></title><secondary-title><style face="normal" font="default" size="100%">Ann. Pure Appl. Logic</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1016/j.apal.2011.01.011</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">8</style></number><volume><style face="normal" font="default" size="100%">162</style></volume><pages><style face="normal" font="default" size="100%">667–678</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Csima, Barbara F.</style></author><author><style face="normal" font="default" size="100%">Harizanov, Valentina S.</style></author><author><style face="normal" font="default" size="100%">Miller, Russell</style></author><author><style face="normal" font="default" size="100%">Montalbán, Antonio</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Computability of Fraïssé limits</style></title><secondary-title><style face="normal" font="default" size="100%">J. Symbolic Logic</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.2178/jsl/1294170990</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">1</style></number><volume><style face="normal" font="default" size="100%">76</style></volume><pages><style face="normal" font="default" size="100%">66–93</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Csima, Barbara F.</style></author><author><style face="normal" font="default" size="100%">Downey, Rod</style></author><author><style face="normal" font="default" size="100%">Ng, Keng Meng</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Limits on jump inversion for strong reducibilities</style></title><secondary-title><style face="normal" font="default" size="100%">J. Symbolic Logic</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.2178/jsl/1318338849</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">4</style></number><volume><style face="normal" font="default" size="100%">76</style></volume><pages><style face="normal" font="default" size="100%">1287–1296</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Csima, Barbara F.</style></author><author><style face="normal" font="default" size="100%">Kalimullin, Iskander S.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Degree spectra and immunity properties</style></title><secondary-title><style face="normal" font="default" size="100%">MLQ Math. Log. Q.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1002/malq.200910001</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">1</style></number><volume><style face="normal" font="default" size="100%">56</style></volume><pages><style face="normal" font="default" size="100%">67–77</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Cenzer, Douglas</style></author><author><style face="normal" font="default" size="100%">Csima, Barbara F.</style></author><author><style face="normal" font="default" size="100%">Khoussainov, Bakhadyr</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Linear orders with distinguished function symbol</style></title><secondary-title><style face="normal" font="default" size="100%">Arch. Math. Logic</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1007/s00153-008-0112-4</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">1</style></number><volume><style face="normal" font="default" size="100%">48</style></volume><pages><style face="normal" font="default" size="100%">63–76</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Csima, Barbara F.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The settling time reducibility ordering and $\Delta_2^0$ sets</style></title><secondary-title><style face="normal" font="default" size="100%">J. Logic Comput.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1093/logcom/exn031</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">1</style></number><volume><style face="normal" font="default" size="100%">19</style></volume><pages><style face="normal" font="default" size="100%">145–150</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Csima, Barbara F.</style></author><author><style face="normal" font="default" size="100%">Mileti, Joseph R.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The strength of the rainbow Ramsey theorem</style></title><secondary-title><style face="normal" font="default" size="100%">J. Symbolic Logic</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.2178/jsl/1254748693</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">4</style></number><volume><style face="normal" font="default" size="100%">74</style></volume><pages><style face="normal" font="default" size="100%">1310–1324</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Csima, Barbara F.</style></author><author><style face="normal" font="default" size="100%">Khoussainov, Bakhadyr</style></author><author><style face="normal" font="default" size="100%">Liu, Jiamou</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Computable categoricity of graphs with finite components</style></title><secondary-title><style face="normal" font="default" size="100%">Logic and theory of algorithms</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Lecture Notes in Comput. Sci.</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1007/978-3-540-69407-6_15</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer, Berlin</style></publisher><volume><style face="normal" font="default" size="100%">5028</style></volume><pages><style face="normal" font="default" size="100%">139–148</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Csima, Barbara F.</style></author><author><style face="normal" font="default" size="100%">Khoussainov, Bakhadyr</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">When is reachability intrinsically decidable?</style></title><secondary-title><style face="normal" font="default" size="100%">Developments in language theory</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Lecture Notes in Comput. Sci.</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1007/978-3-540-85780-8_17</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer, Berlin</style></publisher><volume><style face="normal" font="default" size="100%">5257</style></volume><pages><style face="normal" font="default" size="100%">216–227</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Csima, Barbara F.</style></author><author><style face="normal" font="default" size="100%">Harizanov, Valentina S.</style></author><author><style face="normal" font="default" size="100%">Hirschfeldt, Denis R.</style></author><author><style face="normal" font="default" size="100%">Soare, Robert I.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Bounding homogeneous models</style></title><secondary-title><style face="normal" font="default" size="100%">J. Symbolic Logic</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2007</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.2178/jsl/1174668397</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">1</style></number><volume><style face="normal" font="default" size="100%">72</style></volume><pages><style face="normal" font="default" size="100%">305–323</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Csima, Barbara F.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Comparing c.e. sets based on their settling times</style></title><secondary-title><style face="normal" font="default" size="100%">Computation and logic in the real world</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Lecture Notes in Comput. Sci.</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2007</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1007/978-3-540-73001-9_21</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer, Berlin</style></publisher><volume><style face="normal" font="default" size="100%">4497</style></volume><pages><style face="normal" font="default" size="100%">196–204</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Csima, Barbara F.</style></author><author><style face="normal" font="default" size="100%">Shore, Richard A.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The settling-time reducibility ordering</style></title><secondary-title><style face="normal" font="default" size="100%">J. Symbolic Logic</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2007</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.2178/jsl/1191333856</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">3</style></number><volume><style face="normal" font="default" size="100%">72</style></volume><pages><style face="normal" font="default" size="100%">1055–1071</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Csima, Barbara F.</style></author><author><style face="normal" font="default" size="100%">Montalbán, Antonio</style></author><author><style face="normal" font="default" size="100%">Shore, Richard A.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Boolean algebras, Tarski invariants, and index sets</style></title><secondary-title><style face="normal" font="default" size="100%">Notre Dame J. Formal Logic</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2006</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1305/ndjfl/1143468308</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">1</style></number><volume><style face="normal" font="default" size="100%">47</style></volume><pages><style face="normal" font="default" size="100%">1–23</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Csima, Barbara F.</style></author><author><style face="normal" font="default" size="100%">Soare, Robert I.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Computability results used in differential geometry</style></title><secondary-title><style face="normal" font="default" size="100%">J. Symbolic Logic</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2006</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.2178/jsl/1164060462</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">4</style></number><volume><style face="normal" font="default" size="100%">71</style></volume><pages><style face="normal" font="default" size="100%">1394–1410</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Csima, Barbara F.</style></author><author><style face="normal" font="default" size="100%">Downey, Rod</style></author><author><style face="normal" font="default" size="100%">Greenberg, Noam</style></author><author><style face="normal" font="default" size="100%">Hirschfeldt, Denis R.</style></author><author><style face="normal" font="default" size="100%">Miller, Joseph S.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Every 1-generic computes a properly 1-generic</style></title><secondary-title><style face="normal" font="default" size="100%">J. Symbolic Logic</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2006</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.2178/jsl/1164060461</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">4</style></number><volume><style face="normal" font="default" size="100%">71</style></volume><pages><style face="normal" font="default" size="100%">1385–1393</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Csima, Barbara F.</style></author><author><style face="normal" font="default" size="100%">Montalbán, Antonio</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A minimal pair of $K$-degrees</style></title><secondary-title><style face="normal" font="default" size="100%">Proc. Amer. Math. Soc.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2006</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1090/S0002-9939-05-08086-X</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">5</style></number><volume><style face="normal" font="default" size="100%">134</style></volume><pages><style face="normal" font="default" size="100%">1499–1502</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Csima, Barbara F.</style></author><author><style face="normal" font="default" size="100%">Hirschfeldt, Denis R.</style></author><author><style face="normal" font="default" size="100%">Knight, Julia F.</style></author><author><style face="normal" font="default" size="100%">Soare, Robert I.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Bounding prime models</style></title><secondary-title><style face="normal" font="default" size="100%">J. Symbolic Logic</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2004</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.2178/jsl/1102022214</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">4</style></number><volume><style face="normal" font="default" size="100%">69</style></volume><pages><style face="normal" font="default" size="100%">1117–1142</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Csima, Barbara F.</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Degree spectra of prime models</style></title><secondary-title><style face="normal" font="default" size="100%">J. Symbolic Logic</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2004</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.2178/jsl/1082418536</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">2</style></number><volume><style face="normal" font="default" size="100%">69</style></volume><pages><style face="normal" font="default" size="100%">430–442</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>6</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Csima, Barbara Flora</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Applications of computability theory to prime models and differential geometry</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2003</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&amp;rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&amp;res_dat=xri:pqdiss&amp;rft_dat=xri:pqdiss:3088727</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">ProQuest LLC, Ann Arbor, MI</style></publisher><pages><style face="normal" font="default" size="100%">45</style></pages><isbn><style face="normal" font="default" size="100%">978-0496-36466-4</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><notes><style face="normal" font="default" size="100%">Thesis (Ph.D.)–The University of Chicago</style></notes></record></records></xml>