mathematical logic computability
Complete and Undecidable
Finite examples can make a rule engine look complete even when no procedure can decide every case it will meet. Logic separates consistency, completeness and decidability; computability supplies the hard boundary.