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.
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.
1999 — Doctor of Philosophy from Cornell University
1996 — Master of Science from Cornell University
1992 — Bachelor of Arts from Carleton College, Phi Beta Kappa
"Group Activities for Math Enthusiasts," coauthored with Judy Holdener, PRIMUS.
"A New Angle on an Old Construction," Mathematics Magazine, 88:4, October 2015.
"The Logic of Uncertain Justifications," Annals of Pure and Applied Logic, 165:1, January 2014.
"The Logic of Uncertain Justifications" (preliminary report), Proceedings of the International Symposium on the Logical Foundations of Computer Science, January 2013.
"Conservativity in Logics of Justified Belief: Two Approaches," Annals of Pure and Applied Logic, 163:7, July 2012.
"Conservativity in Logics of Justified Belief," Presented at LFCS '09, Spring Verlag series LNCS 5407, 2009.
"Derivability in the Logic of Proofs is $\Pi^p_2$-complete," Annals of Pure and Applied Logic, 145:3, 223-239, March 2007.
"Sequent Calculi for Skeptical Reasoning in Predicate Default Logic and Other Nonmonotonic Systems," Annals of Mathematics and Artificial Intelligence 44:1, 1-34, 2005.
"A Sequent Calculus for Skeptical Reasoning in Autoepistemic Logic," Presented at the 10th International Symposium on Nonmonotonic Reasoning, June 2004.
"Embedding Modal Nonmonotonic Logics into Default Logic," Studia Logica, 75, 377-382, 2003.
"The Complexity of Predicate Default Logic Over a Countable Domain," Annals of Pure and Applied Logic, 120, 151-163, April 2003.
"A Sequent Calculus for Skeptical Reasoning in Predicate Default Logic" (extended abstract), Presented at ECSQARU 2003, Proceedings Springer-Verlag LNCS 2711.
"Skeptical Reasoning in FC-Normal Logic Programs is $\Pi^1_1$-Complete," Fundamenta Informaticae, 45, 237-252, 2001.