"Discrete Mathematics"

as i'm currently studying for my discrete math final i find myself wondering once again what's the application of any of this in programming?

here are some keywords to give you a quick refresher: truth tables, logical equivalences, propositional logic, predicate logic, relations vs. functions, equivalence relations, proof by contraposition/contradiction/induction

give me some god damn motivation

>>1
We use Touhou to keep it fun.
truth tables = hit || not hit;
logical equivalences = Mei & Mai ?
propositional logic = shooting patters!
predicate logic = pattern 1, pattern 2, pattern n;
relations vs. functions = Dresses/customs vs shooting spells;
equivalence relations = pattern n-1 resembles pattern n because f(sin(shots)pi/radius^2 is f(x)+g(x)-project_version/time
proof by contraposition/contradiction/induction = Reimu Hakurei's function of patterns 1-n can be defined as a contradiction to Marisa Kirisame's functions of patterns.