•    “Degree spectra of the successor relation of computable linear orderings,” co-authored with  J. Chubb and A. Frolov, to appear in the Archive for Mathematical Logic.
•    “Computability of Fraïssé limits,” co-authored with B. Csima, R. Miller, and  A. Montalbán, submitted.
  
•    “Effective categoricity of Abelian p-groups,” co-authored with W. Calvert, D. Cenzer, and A. Morozov, submitted.
•    “Intrinsic bounds on complexity at limit levels,” co-authored with J. Chisholm, E. Fokina, S. Goncharov, J. Knight, S. Miller, submitted.
•    “Partial automorphism semigroups,” co-authored with J. Chubb, A. Morozov, S. Pingrey, and E. Ufferman, to appear in the Annals of Pure and Applied Logic.
•    “Chains and antichains in computable partial orderings,” co-authored with C. Jockusch and J. Knight, to appear in the Archive for Mathematical Logic.
•    “P⁰ 1 classes and strong degree spectra of relations,” co-authored with J. Chisholm, J. Chubb, D. Hirschfeldt, C. Jockusch, T. McNicholl, and S. Pingrey, to appear in the Journal of Symbolic Logic 72 (2007),  pp.1003–1018.
•    “Turing degrees of nonabelian groups,” co-authored with M. Dabkowska, M. Dabkowski, and A. Sikora, Proceedings of the American Mathematical Society, 135 (2007), pp. 3383–3391.
•    “Turing degrees of the isomorphism types of algebraic objects,” co-authored with W. Calvert and A. Shlapentokh, Journal of the London Mathematical Society 73 (2007), pp. 273–286.  
  
•    “Compactness and spaces of left orders,” co-authored with  M. Dabkowska, M. Dabkowski, J. Przytycki, and M. Veve, Journal of Knot Theory  and Its Ramifications 16 (2007), pp. 257–266.
  
•    “Spectra of structures and relations,” co-authored with R. Miller, Journal of Symbolic Logic 72 (2007), pp.324–348.
  
•    “On the learnability of vector spaces,” co-authored with F. Stephan, Journal of Computer and System Sciences 73 (2007), pp. 109–122. (Preliminary conference version in: Algorithmic Learning Theory, N. Cesa-Bianchi, M. Numao, and R. Reischuk (editors), Springer-Verlag, Berlin, 2002, pp. 233–247.)
  
•    “Bounding homogeneous models,” co-authored with B. Csima, D. Hirschfeldt, and R. Soare, Journal of Symbolic Logic 72 (2007), pp.305–323.
•    “Inductive inference systems for learning classes of algorithmically generated sets and structures,” Induction, Algorithmic Learning Theory, and Philosophy  (Springer, Dordrecht, 2007), pp. 27–54. 
  
•    “Introduction to the philosophy and mathematics of algorithmic learning theory,” Induction, Algorithmic Learning Theory, and Philosophy  (Springer, Dordrecht, 2007), pp. 1–24.
•    “Index sets of computable structures,” co-authored with W. Calvert, J. Knight, and S. Miller, Algebra and Logic 45 (2006), pp.306–325.
•    “Formal approaches to modality,” co-authored with S. Kaufmann and C. Condoravdi, The Expression of Modality, W. Frawley (editor), Mouton de Gruyter, Berlin, 2006, pp. 71–106. Editor's Preface
•    “Effective categoricity of equivalence structures,” co-authored with W. Calvert, D. Cenzer, and A. Morozov, Annals of Pure and Applied Logic 141 (2006), pp. 61–78.
•    “Enumerations in computable structure theory,” co-authored with S. Goncharov, J. Knight, C. McCoy,  R. Miller, and R. Solomon, Annals of Pure and Applied Logic 136 (2005), pp. 219–246.
•     “On automorphic tuples of elements in computable models,” Russian translation, co-authored with S. Goncharov, J. Knight, A. Morozov, and A. Romina,  Siberian Mathematical Journal 46, 2005, pp. 523–532 (Russian); pp. 405–412 (English translation).
  
•    “Dependence relations in computably rigid computable vector spaces,” co-authored with R. Dimitrov, and A. Morozov, Annals of Pure and Applied Logic 132, 2005, pp.97–108.
•    “P¹ ₁ relations and paths through O,” co-authored with S. Goncharov, J. Knight, and R. Shore, Journal of Symbolic Logic 69, 2004, pp.585–611.
•    “Relatively hyperimmune relations on structures,” co-authored with S. Goncharov, J. Knight, and C. McCoy, Algebra and Logic 43, 2004, pp.94–101.
•    “Trivial, strongly minimal theories are model complete after naming constants,” co-authored with S. Goncharov, M. Laskowski, S. Lempp, and C. McCoy, Proceedings of the American Mathematical Society 131, 2003, pp. 3901–3912.
•    “Turing degrees of hypersimple relations on computable structures,” Annals of Pure and Applied Logic 121, 2003, pp. 209–226.
•    “Simple and immune relations on countable structures,” co-authored with S. Goncharov, J. Knight, and C. McCoy, Archive for Mathematical Logic 42, 2003, pp.279–291.
•    “Computably-theoretic complexity of countable structures,” Bulletin of Symbolic Logic 8, 2002, pp. 457–477.
•    “Sequences of n-diagrams,” co-authored with J Knight and A. Morozov, Journal of Symbolic Logic 67, 2002, pp.1227–1247.
•    “Relations on computable structures,” Contemporary Mathematics, N. Bokan (editor), devoted to the 125^th anniversary of the Department of Mathematics, University of Belgrade, 2000, pp. 65–81.
•    “Effectively nowhere simple relations on computable structures,” Recursion Theory and Complexity, vol. 2, M. Arslanov, and S. Lempp (editors), de Gruyter, Berlin, 1999, pp. 59–70.
•    “Pure Computable Model Theory,” Handbook of Recursive Mathematics, vol. I, Yu. Ershov, S. Goncharov, A. Nerode, and J. B. Remmel (editors), North-Holland, Amsterdam, 1998, pp. 3–114.
•    “Turing degrees of certain isomorphic images of recursive relations,” Annals of Pure and Applied Logic 93, 1998, pp. 103–113.
•    “Effectively and non-effectively nowhere simple sets,” Mathematical Logic Quarterly 42, 1996, pp. 241–248.
•    “The possible Turing degree of the nonzero member in a two-element degree spectrum,” Annals of Pure and Applied Logic 60, 1993, pp. 1–30.
•    “Frequency computations and the cardinality theorem,” pdf file from JSTOR, co-authored with M. Kummer, and J. Owings, Journal of Symbolic Logic 57, 1992, pp. 682–687.
•     “Some effects of Ash-Nerode and other decidability conditions on degree spectra,” Annals of Pure and Applied Logic 55, 1991, pp. 51–65.
  
•     “Uncountable degree spectra,” Annals of Pure and Applied Logic 54, 1991, pp. 255–263.
•     “Regular relations and the quantifier ‘there exists uncountably many’,” co-authored with Z. Mijajlovic, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 29, 1983, pp. 151–161.
•     “On some finite groupoids whose equational theories are not finitely based,” Algebraic Conference, Mathematical Institute, Novi Sad, 1982, pp. 35–38.
•     “On the functional equation ƒfƒ=ƒ,” Publications de l’Institut Mathématique, Nouvelle Série 29, 1981, pp. 61–64.

•  “Algorithms, undecidability, and incompleteness,” Mathematics Colloquium, Howard University, November 2007.
  
•  “Turing computability in theories and structures,” Mathematics Colloquium, Department of Pure Mathematics, University of Waterloo, Canada, November  2006.
•  “Embedding fields into nilpotent groups,”  Logic Workshop, CUNY Graduate Center, New York, October 27, 2006.
• “Inductive inference of classes of computably enumerable vector spaces,” Logic Seminar, Cornell University, December 2004.
• “Intrinsically S⁰a relations on computable structures,” Logic Seminar, Cornell University, November 2004.
• “Scott families and complexity of isomorphisms,” Logic Seminar, Western Illinois University, October 2004.
• “Systems that learn algorithmically generated languages and structures,” Mathematics Colloquium, Western Illinois University, October 2004.
• “Computable model theory,” Logic Seminar, University of Chicago, May 2004.
• “Using computable algebra in theoretical computer science,” University of Notre Dame, April 2004.
• “Computable algebra and algorithmic learning theory,” Mathematics Colloquium, East Carolina University, March 2004.
• “Isomorphic images of relations on countable structures,” Logic Seminar, University of Maryland, College Park, March 2004.
• “Learning classes of algebraic structures from positive and negative information,” Computer Science Colloquium, University of Delaware, 2003.
• “Algorithmic complexity of countable models,” Mathematical Logic and Theoretical Computer Science Seminar, Heidelberg University, Germany, 2002.  
• “Post-type properties of relations on structures,” Logic Seminar, Western Illinois University, Macomb, October 2002.
• “Computability-theoretic complexity of theories, structures, and relations,” Mathematics Colloquium, Western Illinois University, Macomb, 2002.
• “Turing degrees of structure,” Logic Seminar, Sobolev Institute of Mathematics, Novosibirsk State University, Novosibirsk, Russia, 2002.
• “Hyperarithmetical and nonhyperarithmetical relations on structures,” Logic Seminar, University of Chicago, 2002.
• “Intrinsic complexity of relations on structures,” Southern Wisconsin Logic Colloquium, University of Wisconsin, Madison, 2002.
• “Turing complexity of mathematical structures and their relations,” Complexity Theory Seminar, Computer Science Department, University of Maryland, College Park, 2001.
• “Turing degrees of hypersimple relations on computable structures,” Southern Wisconsin Logic Colloquium, University of Wisconsin, Madison, 2000.
• “Simplicity and nowhere simplicity of relations on structures,” Logic Seminar, University of Notre Dame, 2000.
• “Computably enumerable relations on computable models,” Southern Wisconsin Logic Colloquium, University of Wisconsin, Madison, 1999.
• “Computability-theoretic properties of relations on computable models,” Logic Seminar, Cornell University, 1998.
• “Algorithmic properties of models,” Mathematics Colloquium, East Carolina University, 1997.
• “Computability in mathematical structures,” Logic Seminar, Institut für Logik, Komplexität und Deduktionssysteme, Karlsruhe University, Germany, 1996.
• “Algorithmic properties of mathematical structures,” Mathematics and Statistics Colloquium, University of Maryland Baltimore County, 1996.
• “Hilbert’s tenth problem,” Mathematics Faculty/Student Colloquium, University of Maryland, College Park, 1995.
• “Recursive homogeneous structures,” Logic Seminar, University of Maryland, College Park, 1991.
• “Turing degrees of computational difficulty,” Mathematics Colloquium, George Mason University, 1990.
• “Effective mathematics,” Mathematics Colloquium, University of Maryland, College Park, 1990.
• “An introduction to recursive model theory,” Logic Seminar, University of Maryland, College Park, 1988.
• “Degree spectrum of a recursive relation on a recursive structure,” Logic Seminar, University of Illinois, Urbana-Champaign, 1987.

Special Presentations at George Washington

•  “Computable Mathematics,” Research Gallery: President Knapp Inauguration Week Research Day, November 14, 2007.
• “Quantum computing,” Mathematics Initiative Spring Symposium, January 26, 2007.
• “Formal learning theory based on inductive inference,” jointly with Michele Friend (Philosophy), Summary, Columbian College of Arts and Sciences Colloquium  to launch the mathematics across disciplines initiative, May 4, 2006.
  
• “Algorithms and oracles in mathematical theories and models,” Columbian Research Fellows Lecture, Columbian College of Arts and Sciences, April 20, 2005.
• “Hilbert's Tenth Problem: from Diophantus to Matiyasevich,” Summer Program for Women in Mathematics, July 2002.
• “Quantum computing,” Summer Program for Women in Mathematics, July 2000.
• “Effectiveness in mathematical structures,” Summer Program for Women in Mathematics, July 1997.

• Jennifer Chubb, Department of Mathematics, in progress (PhD expected in 2008/09).
• Sarah Pingrey, Department of Mathematics, in progress (PhD expected in 2007/08).
• Eric Ufferman, Structures and Partial Computable Automorphisms, Abstract, Department of Mathematics, PhD, 2006 (currently at St. Olaf College, Minnesota, Department of Mathematics, Statistics and Computer Science).
  
• Gosia Dabkowska, Turing Degree Spectra of Groups and Their Spaces of Orders, Abstract, Department of Mathematics, PhD, 2006 (currently at University of Texas at Dallas).
• Amir Togha, On Automorphisms of Structures in Logic and Orderability of Groups in Topology, Abstract, co-advised with Ali Enayat, Department of Mathematics, PhD, 2004 (currently at BCC, CUNY, Department of Mathematics and Computer Science).
  
• Rumen Dimitrov, Computably Enumerable Vector Spaces, Dependence Relations, and Turing Degrees, Abstract, Department of Mathematics, PhD, 2002 (currently at Western Illinois University,  Department of Mathematics).
  
• Timothy McNicholl, The Inclusion Problem for Generalized Frequency Classes, Abstract, Department of Mathematics, PhD, 1995 (currently at Lamar University, Texas, Department of Mathematics).
  
• Mathematical advisor for the interdisciplinary dissertation of Massoud Moussavi, A Six-Valued Logic for Modeling Incomplete Knowledge, Abstract, principal advisor Oscar Garcia, Electrical Engineering and Computer Science, PhD, 1991 (currently at World Bank, Washington, DC).

Professional Affiliations

• Association for Women in Mathematics (AWM) (Combined Membership List) 
• American Mathematical Society (AMS) (EIMS Job Listings)
• Association for Symbolic Logic (ASL) (Member search)
• Mathematical Association of America (MAA)

Recent GW Administrative Assignments

Math Department

College of Arts and Sciences

University

Web Pages of Recent Co-Authors

• Wesley Calvert, Mathematics and Statistics, Murray State University
  
• Doug Cenzer, Mathematics, University of Florida
• Cleo Condoravdi, Natural Language Theory and Technology, Palo Alto Research Center
• Barbara Csima, Pure Mathematics, University of Waterloo, Canada
• Mietek Dabkowski, Mathematical Sciences, University of Texas at Dallas
  
• Sergey Goncharov, Mathematics, Novosibirsk State University and Russian Academy of Sciences
• Denis Hirschfeldt, Mathematics, University of Chicago
• Carl Jockusch, Jr., Mathematics, University of Illinois at Urbana-Champaign
• Stefan Kaufmann, Linguistics, Northwestern University
  
• Julia Knight, Mathematics, University of Notre Dame
  
• Chris Laskowski, Mathematics, University of Maryland-College Park
• Steffen Lempp, Mathematics, University of Wisconsin-Madison
• Russell Miller, Mathematics, Queens College and Graduate Center, CUNY, New York
  
• Antonio Montalbán, Mathematics, Victoria University of Wellington, New Zealand
  
• Andrei Morozov, Mathematics, Novosibirsk State University and Russian Academy of Sciences
• Jozef Przytycki, Mathematics, George Washington University
• Adam Sikora, Mathematics, State University of New York at Buffalo
  
• Alexandra Shlapentokh, Mathematics, East Carolina University
• Richard Shore, Mathematics, Cornell University
• Robert Soare, Mathematics, University of Chicago
• Reed Solomon, Mathematics, University of Connecticut
• Frank Stephan, Computer Science, also Mathematics, National University of Singapore