6.042J | Fall 2005 | Undergraduate

Mathematics for Computer Science

Lecture Notes

Lecture 5: Three Profound Theorems about Mathematical Logic

Description:

This resource discusses G?del’s completeness theorem, axioms and inference rules, G?del’s incompleteness theorem for arithmetic, sets and functions, and Russell?s Paradox.

Resource Type:
Lecture Notes
pdf
120 kB
Lecture 5: Three Profound Theorems about Mathematical Logic
Learning Resource Types
Exam Solutions
Exams
Lecture Notes
Problem Set Solutions
Problem Sets