Skip to content

CMPUT 272: Formal Systems and Logic in Computing Science

At a glance

  • Units: 3
  • Prerequisites: CMPUT 101, 174, 175, 274, SCI 100, or ENCMP 100.
  • Offered: Now: Fall 2026; Scheduled: Winter 2027
  • Difficulty: Medium
  • Workload: Moderate

An introduction to the tools of set theory, logic, and induction, and their use in the practice of reasoning about algorithms and programs. Basic set theory; the notion of a function; counting; propositional and predicate logic and their proof systems; inductive definitions and proofs by induction; program specification and correctness.

Official catalogue entry ยท facts synced 2026-10-01

What Students Say

Imported from the original course reviews page, which mixed student contributions with summarized Reddit discussion. Tips aren't term-stamped yet; if you've taken this course recently, add your experience.

Propositional logic, predicate logic, proofs, set theory. Dry but necessary. Many students find it tedious; the students who actually absorb the proof-writing skills are better prepared for theory courses.

Student tips: - Do all the practice problems. The exam questions mirror practice closely. - 272 is a prerequisite for 204, 291, 331, 366, and 416, and a corequisite of 267, so take it early. The proof skills carry straight into algorithms.