A course in mathematical logic for both mathematics and computer science majors. There will be an emphasis on applications in computer science, alongside traditional subject matter. Topics covered include propositional and predicate logic, first-order arithmetic, completeness and incompleteness theorems, computability, automated proof assistants, and satisfiability solvers.
Written reviews 0
No written reviews yet
Numerical ratings and written feedback are separate. Be the first to share what you wish you’d known before taking this course.