Listed in: Mathematics and Statistics, as MATH-385
Nathan K. Pflueger (Section 01)
Mathematicians confirm their answers to mathematical questions by writing proofs. But what, exactly, is a proof? This course begins with a precise definition specifying what counts as a mathematical proof. This definition makes it possible to carry out a mathematical study of what can be accomplished by means of deductive reasoning and, perhaps more interestingly, what cannot be accomplished. Topics will include the propositional and predicate calculi, completeness, compactness, and decidability. At the end of the course we will study Gödel’s famous Incompleteness Theorem, which shows that there are statements about the positive integers that are true but impossible to prove.
How to handle overenrollment: Preference is given to seniors.
Students who enroll in this course will likely encounter and be expected to engage in the following intellectual skills, modes of learning, and assessment: Problem sets, In-class quizzes or exams, Take-home exams, In-class group work.
Section 01
M 1:00 PM - 1:50 PM SMUD 205
W 1:00 PM - 1:50 PM SMUD 205
F 1:00 PM - 1:50 PM SMUD 205