Mathematics 27800 / Computer Science 27800: Mathematical Logic II, Winter 2024

TTh 12:30 - 1:50 in Eckhart 312


Instructor:

Denis Hirschfeldt
drh@uchicago.edu
He/Him/His
Office Hours: M 1:00-2:00 and W 3:30-4:30


College Fellow:

Duarte Maia
dmaia@uchicago.edu
He/Him/His
Office Hours:
   Tuesday, Ryerson 178: Problem Session 3:30 to 4:20, followed by Office Hours until 4:50
   Thursday, Ryerson 253-B: Office Hours 3:30 to 4:50


Course information sheet




Assignment 1 (due on Friday, January 19th)

Assignment 2 (due on Friday, January 26th)

Assignment 3 (due on Friday, February 2nd)

Assignment 4 (due on Friday, February 9th)

Assignment 5 (due on Friday, February 16th)

Assignment 6 (due on Friday, February 23rd)

Assignment 7 (due on Friday, March 1st)




Worskheet for assignment 1: Worksheet    Solutions

Solutions to Homework 3: Without Notes    With Notes

Duarte's Class Notes on Q



Some Recommended Texts:

Jeremy Avigad, Mathematical Logic and Computation

Joseph Mileti, Modern Mathematical Logic

Herbert Enderton, A Mathematical Introduction to Logic



Other Resources:

Evolution of the Function Concept: A Brief Survey by Israel Kleiner

Notices of the AMS: Special issue on Formal Proof including an article by Thomas Hales

Supplementary texts for the book Logic for Mathematics and Computer Science by Stanley N. Burris, including a text on the work of Cantor

Set Theory: An Introduction to Independence Proofs by Kenneth Kunen

A home page for the Axiom of Choice by Eric Schechter of Vanderbilt University

Meyer's or (Putnam's) Proof of the Existence of God by Alexander R. Pruss

To Settle Infinity Dispute, a New Law of Logic by Natalie Wolchover (published in Quanta Magazine)

Notes on Ordinals and Cardinals by Reed Solomon

A video of my public lecture Waking up from Leiniz' Dream: On the Unmechanizability of Truth

Turing's On computable numbers, with an application to the Entscheidungsproblem

A notebook on Turing machines from Wolfram Research

Reflections on Trusting Trust by Ken Thompson (1983 Turing Award lecture)

Gödel's On Formally Undecidable Propositions of Principia Mathematica and Related Systems I

Computability by Cutland, including a proof in the Appendix to Chapter 5 that a function representing configurations of a Turing machine is primitive recursive

Turing Computability: Theory and Applications by Robert I. Soare