Linked from

The 23 pages that link to Counterexample, each with the reason it gives.

• FalsifiabilityRelated: It is the specific kind of observation that can show some claims false.

• Socratic methodRelated: A single counterexample can undermine a definition that fails to cover every relevant case.

• PremiseRelated: A counterexample can undermine a premise or expose a faulty inference.

• Proof by contradictionCompared with: A single counterexample refutes a universal statement directly, without an indirect proof.

• Model checkingRelated: A failed check can return an execution trace that violates the property.

• ArgumentRelated: A counterexample can expose a flaw in a premise or invalidate a general inference.

• Surjective functionRelated: One codomain element with no preimage is enough to disprove surjectivity.

• TheoremRelated: A single counterexample can refute a proposed theorem before proof is possible.

• Weierstrass functionNarrower topic: The function refuted the expectation that continuity generally entails differentiability.

• Reductio ad absurdumCompared with: Unlike reductio, a counterexample can refute a universal claim without deriving a contradiction.

• Logical validityRelated: A single case with true premises and a false conclusion disproves validity.

• Affirming the consequentRelated: One true conditional with a true consequent and false antecedent refutes the form.

• PhilosophyRelated: Counterexamples pressure-test philosophical theories and definitions.

• Existence theoremCompared with: A single counterexample can refute a related universal claim, unlike proving one instance exists.

• Mathematical conjectureRelated: One counterexample can disprove a conjecture asserting a property for every case.

• Erdős–Straus conjectureCompared with: One integer n with no valid decomposition would refute the conjecture.

• Littlewood conjectureCompared with: Finding a pair with positive limit inferior would refute the conjecture.

• Mathematical problemRelated: A single counterexample can resolve a problem asking whether a general claim holds.

• Agrawal's conjectureRelated: A single composite satisfying the identity for every a would refute the conjecture.

• Bunkbed conjectureRelated: Finding a graph that reverses the probability comparison would settle the conjecture negatively.

• Hedetniemi's conjectureRelated: A finite pair of graphs with a smaller product chromatic number refutes the conjecture.

• Herzog–Schönheim conjectureCompared with: No counterexample to the conjecture is known, despite extensive searches.

• Ibragimov–Iosifescu conjectureRelated: A counterexample would settle the conjecture negatively while preserving boundedness and vanishing c6-mixing.