|
|
|
|
Barbara
F. Csima |
|
|
|
|
|
|
|
Assistant
Professor
Department of
Pure Mathematics
University of
Waterloo |
|
 |
|
Contact
Information
|
Office: |
MC 5171 |
|
Office Hours: |
M 11:30-12:20, W
3:30-4:20 |
|
Phone: |
1-519-888-4567 ext. 37596 |
|
Email: |
csima at math dot
uwaterloo dot ca |
|
Education:
Ph.D. (2003) University of
Chicago
Research Area:
Mathematical logic; computability theory
Curriculum Vitae:
My
CV is available here.
Seminars:
Pure Mathematics Department Colloquium,
Logic Seminar,
Computability Learning Seminar.
Personal:
I am married to
Ilya Shapiro.
Papers:
B. F. Csima, R. Downey, and K. M. Ng. Limits on Jump
Inversion for Strong Reducibilities, submitted (available
pdf)
B. F. Csima, V. S. Harizanov, R. G. Miller, and A. Montalbán.
Computability of Fraisse limits, submitted (available
pdf)
B. F. Csima and I. S. Kalimullin.
Degree Spectra and Immunity Properties, MLQ. Mathematical Logic
Quarterly, accepted (available
pdf)
B. F. Csima and J. R. Mileti. The
Strength of the Rainbow Ramsey Theorem, J. Symbolic Logic, 74
no. 4 (2009), 1310--1324 (available
pdf)
D. Cenzer, B. F. Csima, and B. Khoussainov. Linear orders
with distinguished function symbol, Archive for Mathematical Logic,
Special Issue: University of Florida Special Year in Logic,
48 (2009), no. 1,
63--76 (available
pdf)
B. F. Csima and B. Khoussainov. When Is Reachability Intrinsically
Decidable?, In Masami Ito and Masafumi Toyama, editors, Developments in
Language Theory, volume 5257 of Lecture Notes in Computer Science,
pages 216-227. Springer, 2008. (available
pdf)
B. F. Csima, B. Khoussainov, and J.
Liu.
Computable Categoricity of Graphs with Finite Components, Logic and Theory
of Algorithms, CiE 2008 (A. Beckmann, C. Dimitracopoulos, and B. Lowe
Eds.), LNCS 5028, pp. 139-148, 2008.
(available
pdf)
B. F. Csima. The settling time reducibility ordering and
Delta-2 sets, Journal of Logic and Computation, Special Issue: Computation
and Logic in the Real World: CiE 2007, 2008, doi: 10.1093/logcom/exn031 (available
pdf)
B. F. Csima, Comparing C.E. Sets Based on Their
Settling Times. Computation and Logic in the Real World - Third Conference
of Computability in Europe, CiE 2007 (S.B. Cooper, B. Lowe, and A. Sorbi
Eds.), LNCS 4497, pp. 196-204, 2007 (available
pdf)
B. F. Csima and R.
A. Shore,
The Settling-Time Reducibility Ordering, J. Symbolic Logic, 72 no.
3 (2007), 1055--1071 (available pdf)
B. F. Csima, V. S. Harizanov,
D. R. Hirschfeldt, and R. I. Soare, Bounding Homogeneous Models, J. Symbolic Logic,
72 no. 1 (2007), 305--323 (available pdf)
B. F. Csima and R. I. Soare,
Computability Results Used in Differential Geometry, J. Symbolic Logic 71 no. 4 (2006), 1394–1410
(available pdf)
B. F. Csima, R. Downey, N. Greenberg, D. R. Hirschfeldt, and J. S. Miller, Every 1-Generic
Computes a Properly 1-Generic, J. Symbolic Logic 71 no. 4 (2006), 1385–1393
(available pdf)
B. F. Csima and A. Montalbán, A Minimal Pair of
K-degrees, Proceedings of the AMS, 134, 2006,
1499-1502 (available dvi,
pdf,
ps)
B. F. Csima, A. Montalbán, and R. A. Shore, Boolean
Algebras, Tarski Invariants, and Index Sets, Notre Dame J. of Formal
Logic, 47 (1), 2006, 1--23 (available dvi, pdf, ps)
B.
F. Csima, D. R. Hirschfeldt, J. F. Knight, and
R. I. Soare, Bounding Prime Models, J. Symbolic
Logic 69 no. 4 (2004),1117–1142 (available dvi, pdf, ps)
B. F. Csima, Degree Spectra of Prime Models, J.
Symbolic Logic 69 no. 2 (2004), 430–442 (available dvi, pdf, ps)
Last modified: October 19, 2009
|