Monday, Wednesday, and Friday
12:00 P.M.-12:50 P.M.
This course may be taken for credit in the Mathematics and Computer Science Departments as an equivalent to Math/CS 401B.
Symbolic Logic (3) Definition of computability. Decidability and undecidability,
Church-Turing thesis, the
-
-
theorem, halting problem,
fixed-point theorem, Gödel's incompleteness theorem. Other
topics as time permits.
The text should be available in the ASUA bookstore.
H.-D. Ebbinghaus, J. Flum, and W. Thomas, Mathematical Logic, 2nd ed. (Springer-Verlag, New York, 1994).
The final examination will be Friday, 13 May, 11 A.M.-1 P.M. The final examination is a mandatory part of the course. If you will be unable to take it for any reason, do not take this course. Of course, with documentation, serious medical excuses and the like will be accepted. Airplane tickets, weddings, and so forth, will not be.
There will be a midterm and a final examination. There will also be homework, which will be corrected to provide you with feedback, but not graded. In addition, you will be required to make some contribution to the wiki for a specified class date. The homework, class participation, and use of the wiki will affect your grade in borderline cases, though only in borderline cases. (That is, I shall be more sympathetic if you have handed in homework regularly and participated in the class and the wiki.)
Most questions on the examinations will be based on exercises taken from the text. The examinations will cover all material presented in class. You will be allowed to consult your notes and the book. (Please draw the obvious morals: take good notes on your reading, and do lots of the exercises, whether or not they have been assigned.) Please bring blue books to the examinations.
The base web page for this course is Symbolic Logic B. It is my present intention to post all of my class notes (that is, what I would otherwise have written on the blackboard) here on the wiki. You should post comments, questions, corrections, and discussions here.
This is a mathematics course. Each class day's work builds on that of the previous day. Do not fall behind. You need a good excuse, in advance, to miss an exam. Cheating is rarely an issue, Note, however, that University regulations concerning plagiarism and cheating will be strictly enforced.1
Your course grade will be the average of your letter grades on the midterm and final or the grade on the final, whichever is greater.
Late homework may not be accepted. Short of serious medical excuses with written documentation, missed examinations may result in grading penalties.
If you believe that a mistake has been made in the grading of one of the examinations, you must put your reasons for thinking so in writing and then submit them to me within one week from the time the examination was returned. All grades that have not been appealed will be considered final after one week. No oral appeals of grades will be considered.
Office hours are for your benefit. I encourage you to come, whether to talk about the class material or even just to chat. Individual discussions usually result in more learning than classes alone. Use the opportunity.
My office hours are Monday, Wednesday, and Friday 11:00 A.M.-11:50 A.M. in room 208 Social Sciences. My telephone number is 621-7109, or I may be reached outside of office hours by leaving a message at the department office, 621-3120 or by e-mail, shaughan@ns.arizona.edu .
All page numbers are from the text. The page numbers on different days overlap when I shall talk about the same material for several days. The dates for reading assignments on this calendar are approximate, and will vary according to class needs and interests. The syllabus is quite ambitious, and it is likely that we will not get through all of the material. Homework will be assigned in class, and will always be due one week from the date on which it is assigned, which may not be the date indicated on the calendar.