This is the home page for the interdisciplinary doctoral program in Pure and Applied Logic offered by the departments of Computer Science , Mathematics , and Philosophy at Carnegie Mellon University . The interdisciplinary Ph.D. program in Pure and Applied Logic builds upon Carnegie Mellon's unique strengths in logic and its applications to computer science. Internationally recognized faculty, frequent workshops, colloquia, seminar series, and excellent computing facilities contribute to an ideal environment for both theoretical and applied research.
Graduate fellowships are available.
Automated theorem proving, category theory, constructive and feasible mathematics, foundations of decision theory, foundations of programming languages, logics of programs, lambda-calculus, learning theory, model theory, proof theory, set theory, temporal and modal logics, theory of computing, type theory, and universal algebra. Related Research at Carnegie Mellon Algorithms, artificial intelligence, combinatorial optimization, computational complexity, computational linguistics, operations research, and programming systems.