Logic	LOGICS OF INDUCTION AND RECURSION
Advanced course	ANUJ DAWAR Department of Computer Science, University of Wales Swansea
Second week	A.Dawar@swansea.ac.uk
Course description	For many applications of logic in the computational and cognitive sciences, first order predicate logic maintains a central role, often solely for histotical reasons. In many areas where recursive or inductive definitions are central, a more appropriate logic is obtained by allowing explicit fixed point constructions, and such logics have found incresingly widespread use. Examples include the study of inductive definitions in arithmetic, the least fixed point logic that plays a central role in finite model theory and the modal mu-calculus. This course will attempt a unified treatment of such logics of induction and recursion. This will include model-theoretic and proof-theoretic aspects of these logics, as well as their connections with models of computation and computational complexity.
Prerequisite	A sound knowledge of logic, as might be obtained in an introductory graduate course.
Literature	No specific recommendation