ConceptSystems & CS
Bounded verification
Bounded verification caps summations to a small number like k=2 or k=4 to make semantic structure reasoning tractable for solvers.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.