## ANNOUNCEMENTS

Registration for Spring term opens Thursday, February 23, 2016.

This page was last updated: .

## COURSE DESCRIPTION

The material covered in this term will include an introduction to mathematical logic, including propositional and predicate (or first-order) calculus, computability theory, and computational complexity. We will discuss the syntax and semantics of formal languages, formal proofs, the GĂ¶del Completeness and Incompleteness Theorems, undecidability and intractability.

## POLICIES

### Grades

There will be no final exams. The grade will be based on 6 written assignments.

### Homework Policy

There will be 6 homework assignments consisting of three questions each. The assigments will be due on the followign Tuesdays

1) April 25

2) May 2

3) May 9

4) May 23

5) May 30

6) June 6

Each assignment will be posted on this website two weeks before the due date.

## TEXTBOOKS

There will be no official textbook. The lectures will follow notes that will be posted on this website.

Interested students can consult the following books:

Enderton, A mathematical introduction to logic. Second Edition (2001)

Shoenfield, Mathematical logic. Second Edition (2001)

Manin, A course in mathematical logic for mathematicians. Second Edition (2010)

The following is a book containing a wealth of examples of proofs by induction taken from a variety of mathematical subjects, and aimed at undergraduate students:

David Gunderson, Handbook of Mathematical Induction, CRC Press, 2011

## LECTURE NOTES

Date | Description | |
---|---|---|

April 4 | Lecture 1 | Source |

April 6 | Lecture 2 | Source |

April 11 | Lecture 3 | Source |

April 13 | Lecture 4 | Source |

April 18 | Lecture 5 | Source |

April 20 | Lecture 6 | Source |

April 25 and April 27 | Lecture 7 and 8 | Source |

## HOMEWORK

Due Date | Homework | Solutions |
---|---|---|

April 25 | Homework 1 | |

May 2 | Homework 2 | |

May 9 | Homework 3 | |

May 23 | Homework 4 | |

May 30 | Homework 5 | |

June 6 | Homework 6 | |