**Course Web Page - Math 260AB
**

University of California, San Diego

Fall 2007 - Winter 2008

**Instructor:
** Sam Buss

Professor of Mathematics and Computer Science

Email: sbuss@ucsd.edu (this is usually the best way to contact me).

Office for office hours: APM 6210. Office phone: 534-6455. Cell phone: Dial 858 then 442 then 2877.

Office hours for Winter 2008: Monday, 11:00-11:50. Wednesday, 9:00-9:50. In APM 6210.

Please email for appointments at other times.

Please feel free to drop by at other times too (usually, I am in my 7th floor Chair office).

Schedule:

**Meeting times and place:** APM 7421, TuTh 9:00-10:30. (Ending times will vary.)

**Handouts**

Inference Rules for Natural Deduction. October 9,
2007; revised October 30, 2007.

**Homework assignments
** Homework #1. Due Tuesday, October 16.

Homework #2. Due Thursday, October 18.

Homework #3. Due Thursday, November 8.

Homework #4. Due Thursday, November 22.

Homework #5. Due Friday, December 14.

Homework #6. Due Thursday, February 4.

Homework #7. Due Thursday, February 14.

Homework #8. Due Thursday, March 6.

Homework #9. Due Tuesday, March 18.

**Email discussion** is available at the Google Group http://groups.google.com/group/IntroMathLogic0708. I think you can read emails without joining the group; or, if you join the group, you can have all messages forwarded to you automatically. As a member, you can post emails by sending them to IntroMathLogic0708@googlegroups.com.

Please feel free to ask questions, as well as to answer others' questions, in the group email discussion.

This email group has become rather inactive, but should still work, so feel free to use it.

**Synopsis**

This is a first course in mathematical logic, with some emphasis on topics of interest to computer science. Topics for the two quarter sequence are expected to include: Propositional logic, first order logic, soundness, completeness, Herbrand's theorem, Craig interpolation, Löwenheim-Skolem thoerem, model theory, nonstandard models, tense logics including LTL and CTL, modal logic, first order logic for arithmetic, computability, Gödel's incompleteness theorem.

There are no prerequisites beyond the usual mathematical maturity expected from a graduate student in mathematics (for instance). The course is suitable for graduate students in mathematics, computer science, and philosophy.

Grades will be based on homework assignments.

If you are attending the class, please be sure to be on the email list for the course.