Below are notes about the new version of Stanford's CS103 course, which they
call "Mathematical Foundations of Computing."  Here is the current course
description:

    Mathematical foundations required for computer science, including
    propositional predicate logic, induction, sets, functions, and
    relations.  Formal language theory, including regular expressions,
    grammars, finite automata, Turing machines, and NP-completeness.
    Mathematical rigor, proof techniques, and applications.

And here's a breakdown by lecture:

    I. Logic (7 lectures)
    II. Sets, Relations, and Functions (4 lectures)
    III. Induction (4 lectures)
    IV. Finite Automata (2 lectures)
    V. Regular Expressions (2 lectures)
    VI. Context-free Grammars  (2 lectures)
    VII. Turing Machines, Undecidability (3 lectures)
    VIII. NP-completeness (3 lectures)

It is a 5-unit course even though it has just 3 lecture hours and no section.
There are schedule times when TAS are available to help with homework.