º£½ÇÉçÇø

Sara Quinn

Professor, Mathematics
Rosary College of Arts and Sciences

Director, Data Science Major
Rosary College of Arts and Sciences

Education
PhD, Mathematics, University of Notre Dame
MS, Mathematics, University of Notre Dame
BS, Mathematics, Loyola University Chicago
Selected Publications

Carson, J., Harizanov, V., Knight, J., Lange, K., McCoy, C., Morozov, A., Quinn, S., Safranski, C., & Wallbaum, J. (2012).Describing free groups. Transactions of the American Mathematical Society, 364, 5715-5728. Retrieved from .  

Carson, J., Fokina, E., Harizanov, V., Knight, J., Quinn, S., Safranski, C., & Wallbaum, J. (2012). The computable embedding problem. Algebra and Logic, 50, 478–493. Retrieved from . 

Fokina, E., Knight, J., Melnikov, A., Quinn, S., & Safranski, C. (2011). Classes of Ulm type and coding rank-homogeneous trees in other structures. The Journal of Symbolic Logic, 76(3), 846-869. Retrieved from .  

Chisholm, J., Fokina, E., Goncharov, S., Harizanov, V., Knight, J., Quinn, S. (2009).  Intrinsic bounds on complexity and definability at limit levels. The Journal of Symbolic Logic 74(3), 1047 - 1060. DOI: . 

Chisholm, J., Knight, J., & Miller, S. (2007). Computable embeddings and strongly minimal theories. Journal of Symbolic Logic, 72(3), 1031–1040. doi:10.2178/jsl/1191333854. Retrieved from . 

Knight, J., Miller, S., & Boom, M.(2007). Turing computable embeddings. Journal of Symbolic Logic, 72(3), 901–918. doi:10.2178/jsl/1191333847. Retrieved from . 

Selected Presentations
Relativized turing computable embeddings, Computability in Europe / Podium, 2010
Index sets and scott sentences, Computability in Europe / Podium, 2009
Rank-homgeneous trees turing computable embeddings, American Mathematical Society Eastern Sectional Meeting / Podium, 2008
Turing computable embeddings into equivalence structures, University of Waterloo Logic Seminar / PaperI, 2007
Turing computable embeddings, Computable Models and Numberings Workshop / Podium, 2007

 

Dominican faculty and staff, .