ConceptTheory & Algos
Case analysis on satisfiability
Analyzing the satisfiability of a subformula to determine whether an invariant holds when dropping another subformula.
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.
Logical invariants1Satisfiability1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.