CSC 438H1

Computability and Logic

0.5 credits · Undergraduate

Computable functions, Church's thesis, unsolvable problems, recursively enumerable sets. Predicate calculus, including the completeness, compactness, and Lowenheim-Skolem theorems. Formal theories and the Gödel Incompleteness Theorem. Ordinarily offered in years alternating with CSC448H1 .

Prerequisites & course information

Prerequisite: CSC463H1 / CSC373H1 / CSC363H5 / CSCC63H3 / MAT247H1; Prerequisite:; Exclusion: MAT309H1 ; PHL348H1 . NOTE: Students not enrolled in the Computer Science Major or Specialist program at A&S, UTM, or UTSC, or the Data Science Specialist at A&S, are limited to a maximum of 1.5 credits in 300-/400-level CSC/ECE courses.; Exclusion:

Sources

Course catalogue ↗2026-2027