Tuesdays,
11:45-1:45pm
GC 6421

Sergei Artemov
GC 4329, 212-817-8661
sartemov@gc.cuny.edu

•   The Computational Logic course grading will be based on three factors:
  • attendance,
  • homework
  • three tests,
    in equal parts: 20% of the total score each. Since we are not under any sort of administrative pressure, I intend to be humane in assigning the final grades to those of you who survives the course.
   
•   Homeworks will be collected by the beginning of a lecture and no late submissions will be accepted. Such a strict deadline is mostly due to three reasons:
  1. I don't want you to be catching up with the homework instead of following a lecture,
  2. we will normally discuss the solutions at the beginning of the lecture,
  3. a grader is also a human being and deserves decent working conditions: returning back to already graded problem sets again and again is not fun.
  
    As a compensation of this strick rule, I offer each of you a credit of one homework set during a semester which you could be reimbursed in full even without handing it in, should you choose to. If you hand in all of the homeworks, your worst score will be compensated in full.
   
• There will be three tests covering about 1/3 of the course each offered in class:
  1. October 8,
  2. November 12,
  3. December 10.

      Good luck.
 

1*. D. van Dalen, Logic and Structure, Springer-Verlag, third or later edition. (a perfect introductory text in logic written by a distinguished professor in Math, Computer Science and Philosophy. I recommend it strongly)

2*. A. Troelstra, H. Schwichtenberg, Basic Proof Theory, Cambridge University Press, 1996. (A comprehensive source book on everything in this course. If you can afford only one book, and you know the baby logic, buy this one. It is now available in paperback.)

3. J.-Y. Girard, Y. Lafont , P. Taylor, Proofs and Types}, Cambridge University Press, Cambridge 1989. (Deep motivations and philosophical insights in the first few chapters. Becomes very technical shortly after, not a very good as a textbook.)

4. S. Artemov, "Explicit provability and constructive semantics", Bulletin of Symbolic Logic, volume 7, No.1, pp. 1-36, 2001 (a comprehensive introduction to proof polynomials and Logic of Proofs. Plenty of philosophy, history and motivations. Available on my webpage for downloading.)

* = worth of buying