Christopher Leary
SUNY Distinguished Teaching Professor of MathematicsOffice Hours: Spring 2019
 M: 10:00a  11:00a
 Tu: 11:00a  12:00p
 W: 1:30p 2:30p
 F: 11:00a  12:00p
 or by appointment
Curriculum Vitae
Education
B.A., Oberlin College; 1979
Ph.D., University of Michigan; 1985
Employment
SUNY Geneseo 1992current
United States Agency for International Development (20172018)
Eberhard Karls Universität Tübingen, Germany (2005–2006)
The University of Calgary (1998)
Stetson University (19911992)
Oberlin College (19851991)
Publications
A Friendly Introduction to Mathematical Logic (2nd Edition) (with Lars Kristiansen), (2015), Milne Library, Geneseo NY. Available at http://minerva.geneseo.edu/afriendlyintroductiontomathematicallogi…
Fractals, average distance, and the Cantor set (with Dennis Ruppe and Gregg Hartvigsen), Fractals, vol. 18, no. 3 (2010), pp. 327341.
Component averages in subgraphs of circulantlike graphs (with Jaqueline M. Dresch, Niels C. Hansen, Gregg Hartvigsen and Anthony J. Macula), Bulletin of the Institute for Combinatorics and its Application, vol. 51 (2007), pp. 5568.
Tuning Degree Distributions: Departing from scalefree networks (with HansPeter Duerr, Markus Schwehm and Martin Eichner), Physica A: Statistical Mechanics and its Applications, vol. 382 (2007), pp. 731?738.
The impact of contact structure on infectious disease control: influenza and antiviral agents. (with HansPeter Duerr, Markus Schwehm, SJ DeVlas and Martin Eichner), Epidemiology and Infection, vol. 135, no. 07, (2007), pp.11241132.
Network structure, population size, and vaccination strategy and effort interact to affect the dynamics of influenza epidemics (with Gregg Hartvigsen, Jacqueline Dresch, Amy Zielinski, and Anthony Macula), The Journal of Theoretical Biology, vol. 246 (2007), pp. 205?215.
High infection rates at low transmission potentials in West African onchocerciasis (with HansPeter Duerr and Martin Eichner), International Journal for Parasitology, vol. 36, no. 13 (2006), pp. 13671372.
Filter games on omega and the dual ideal (with Claude Laflamme), Fundamenta Mathematicae, vol. 173, no. 2 (2002), pp. 159?173.
The structure of pleasant ideals. Notre Dame Journal of Formal Logic. 1994;35(2):29298.
Pleasant ideals. Notre Dame Journal of Formal Logic. 1991;32(4):61217.
Patching ideal families on Pkappalambda. Archive for Mathematical Logic. 1990;30(4):26975.
Patching ideal families and enforcing reflection. J. Symbolic Logic. 1989; 54: 26–37.
Latin square achievement games (with Frank Harary). J. Recreational Mathematics. 19831984; 16(4): 241–246.
Research Interests
My research training was in the areas of set theory and logic. In particular, I have published papers dealing with infinitary combinatorics and large cardinals. More recently I have become interested in modeling and applications of mathematics to biology. I have also been fortunate enough to work with members of the Institut für Medizinische Biometrie at the University of Tübingen.
Classes

MATH 221: R/Calculus I
Topics studied are limits and continuity; derivatives and antiderivatives of the algebraic, exponential, logarithmic, trigonometric, and inverse functions; the definite integral; and the fundamental theorem of the calculus. Prerequisites: MATH 112 or Precalculus with trigonometry or the equivalent. Offered every semester

MATH 239: Intro to Mathematical Proof
The course will provide an introduction to the language of advanced mathematics and to mathematical proof. It will emphasize rigorous argument and the practice of proof in various mathematical contexts. Topics will include logic, set theory, cardinality, methods of proof, and induction. Other mathematical topics chosen at the discretion of the instructor will be included as material through which proving skills will be honed. Prerequisites: MATH 222 or permission of the department. Offered every semester

MATH 301: Mathematical Logic
The goal of the course will be to present the important concepts and theorems of mathematical logic and to explain their significance to mathematics. Specific results will include compactness, completeness and incompleteness theorems, with applications including switching circuits and nonstandard analysis. Prerequisites: MATH 239. Offered fall, odd years.