CS 401
Theoretical Foundations of Computer Science
Fall 2006

Lectures

Time: Mon Wed Fri 9:00–9:50
Place: ME 300

Instructor

Stephan Falke
Email: spf@cs.unm.edu
Office: ME 429
Office hours: Tue 14:00–15:00
  Thu 11:00–12:00

Homework assignments

Homework will be assigned in class every Wednesday, and is due in class the following Wednesday. Late submissions will not be accepted.

Exams

There will be a midterm and a final. The midterm will take place in class on Wednesday, October 11th, 2006.

The final will have a take-home and an in-class part. The take-home part will be assigned on Wednesday, December 6th, 2006 and is due on Friday, December 8th, 2006 at 9:00. The in-class part will take place on Friday, December 8th, 2006, 9:00–9:50, in ME 300.

Grading

CR/NC
Homework: 1/6
Midterm: 1/3
Final: 1/2

Cheating

Feel free to discuss homework assignments with classmates and the instructor. However, do not copy solutions. Exchanging homework solutions is cheating and all involved students will be reported to the university administration.

Lecture notes

The class will mostly follow Lecture Notes on Theoretical Foundations of Computer Science by Calogero G. Zarba, available at http://alan.cs.uni-sb.de/~zarba/notes.html.

Syllabus

  1. Naive Set Theory
    Aug 21 1.1, 1.2
    Aug 23 1.3 until Proposition 1.3.13
    Aug 25 finished 1.3, 1.4, addendum to 1.4
    Aug 28 1.5 until Proposition 1.5.17
    Aug 30 finished 1.5, 1.6
    Sep 1 1.7 until Definition 1.7.6
    Sep 6 finished 1.7
  2. Natural Numbers
    Sep 6 2.1 until Proposition 2.1.10
    Sep 8 2.1 until Proposition 2.1.17, addendum to 2.1
    Sep 11 finished 2.1
    Sep 13 2.2 until Proposition 2.2.7
    Sep 15 finished 2.2, 2.3 until Proposition 2.3.9
    Sep 18 finished 2.3, 2.4
    Sep 20 2.7 until Proposition 2.7.7
    Sep 22 2.7 until Proposition 2.7.11
    Sep 25 finished 2.7
  3. Cardinality
    Sep 27 3.1 until Proposition 3.1.7
    Sep 29 finished 3.1
    Oct 2 3.2 until Proposition 3.2.7
    Oct 4 3.2 until Proposition 3.2.9
    Oct 6 finished 3.2, 3.3
  4. Well-Founded Induction
    Oct 16 4.1, 4.2 until Definition 4.2.2
    Oct 18 finished 4.2, 4.3 until Example 4.3.2
      A mistake in the proof of Proposition 4.2.4 in the notes has been fixed.
    Oct 20 4.4, 4.5
    Oct 23 finished 4.3
      The notes have been updated in order to reflect the presentation in class.
  5. Propositional Logic
    Oct 25 5.1 until Proposition 5.1.8
    Nov 3 5.1 until Proposition 5.1.12
    Nov 6 5.1 until Example 5.1.17 part 5
      A mistake in Example 5.1.17 part 5 in the notes has been fixed.
    Nov 8 finished 5.1, 5.2, 5.3 until Definition 5.3.1
    Nov 10 finished 5.3
    Nov 13 5.4 until correctness of Proposition 5.4.9
    Nov 15 finished 5.4
      Section 5.4.1 from the lecture notes was skipped.
      Section 5.5 from the lecture notes was skipped.
    Nov 17 5.6 until Definition 5.6.3
    Nov 20 5.6 until Example 5.6.9 part 1
    Nov 22 finished 5.6
  6. First-Order Logic
    This chapter was skipped.
  7. Regular Languages
    Nov 27 7.1, 7.2 until Definition 7.2.4
    Nov 29 7.3 until Proposition 7.3.3
    Dec 1 finished 7.3, 7.2 until Proposition 7.2.9
This document was translated from LATEX by HEVEA.