CSC 201A - Mathematical Logic

Semester Hours: 3

Periodically
The propositional calculus: truth tables and axiomatizations. First order theories: completeness theorem, formal number theory, Gödel’s incompleteness theorem.

Prerequisite(s)/Course Notes:
Open to graduate students in computer science; others need permission from computer science graduate director.