About a century ago some crazy mathematicians got nervous and decided to apply the techniques of mathematics to the study of logical languages and proof systems. Their formal systems are the basis of the automation of reasoning. You'll develop an automatable proof strategy for first-order logic and explore the relationship to the theory of computation, climaxing in the presentation of Goedel's incompleteness theorem.
Description Provides a theoretical foundation for the logic of computation.
There is currently no scheduling information for Introduction to Mathematical Logic. It may be offered every other year or on an otherwise intermittent basis. If you have additional questions about how this course may apply to your degree program, please send e-mail to the CSE academic coordinator .