from a computational complexity perspective, completeness is the “worst” axiom to violate: only O(n²) to find a violation