Kenneth Kunen Professor of Computer Sciences and MathematicsPh.D., Stanford University, 1968
Computer Sciences Department
University of Wisconsin
1210 W. Dayton St.
Madison, WI 53706-1685
telephone: (608) 262-1204
fax: (608) 262-9777
email: kunen@cs.wisc.edu
http://www.cs.wisc.edu/~kunen/
Typical applications are automated deduction and logic programming. In automated deduction, we use tools like resolution to prove new mathematical theorems. In logic programming, we study the semantics of languages like Prolog. Specific topics I am considering are the Prolog use of negation-as-failure, and the semantic incompatibilities between least-fixed-point computations and the Prolog-style backtracking computation.
In mathematical logic, I work on axiomatic set theory. Besides being of interest in its own right, this subject relates to various abstract areas of mathematics, such as set-theoretic topology and measure theory, where many basic questions turn out to be independent of the usual axioms of set theory.
Single axioms for odd exponent groups (with J. Hart), Journal of Automated Reasoning, 1995.
The shortest single axioms for groups of exponent 4, Computers and Mathematics with Applications, 1995.