Teaching‎ > ‎2012 Fall‎ > ‎

Phil 450

Intermediate Symbolic Logic

This course will be taught from Boolos, Burgess, and Jeffrey, Computability and Logic

The readings and topics we will cover are (in order) the following:

Chapter 1 - enumerability
Chapter 2 - uncountability
Chapter 9 - syntax of first-order logic
Chapter 10 - semantics of first-order logic
Handout on deduction
Chapter 6 - primitive recursive functions
Chapter 7 - recursive functions and relations
Chapter 15 - computability and logic
Chapter 16 - representation of recursive functions in logic
Chapter 17 - the first incompleteness theorem

If you want a second source on any of this material, ask me for other notes.

Sample solutions to exercises, with comments.

Homework 1 - Exercise 1.2
Homework 2 - Exercise 2.8
Homework 3 - Exercise 9.1
Homework 4 - Exercise 9.5
Homework 5 - posted here

For 9/6: An entertaining video showing why .99999...=1 (and thus, why .011111...=.10000... in binary, and .04444...=.1000... in base 5).