Prior to his 2002 arrival at Kenyon, Bob Milnikel studied at Carleton College and Cornell University and taught at Wellesley College. His research is focused on the mathematical analysis of logic as used in computer science. His teaching also bridges math and CS, including algebra and calculus courses as well as logic and introductory programming. Currently serving on the Tenure and Promotion Committee, Bob is also active in several of Kenyon's musical ensembles. His Chicago area roots engendered an enduring fondness for good pizza and hapless baseball teams.

Education

Ph.D. Cornell University
M.A. Cornell University
B.A. Carleton College

Selected Publications

"Derivability in the Logic of Proofs" is $\Pi^p_2$-complete, To appear, Annals of Pure and Applied Logic

"Embedding Modal Nonmonotonic Logics into Default Logic", Studia Logica, 75 (2003), 377-382

"Sequent Calculi for Skeptical Reasoning in Predicate Default Logic and Other Nonmonotonic Systems", Annals of Mathematics and Artificial Intelligence 44:1 (2005), 1-34

"The Complexity of Predicate Default Logic over a Countable Domain", Annals of Pure and Applied Logic 120, 1-3 (April 2003), pp. 151-163.

"Skeptical Reasoning in FC-Normal Logic Programs is $\Pi^1_1$-Complete", Fundamenta Informaticae 45, 3 (2001), pp. 237-252.

Courses Taught

MATH 105, Surprises at Infinity
MATH 118, Introduction to Programming
MATH 322, Mathematical Logic
MATH 335, Abstract Algebra
MATH 348, Theory of Computation