In mathematics, at an opposite pole are extremely formal proofs by computer algorithms — jgill
However, if one takes the refutation as an opportunity to include the monster in the intension of the original term, it becomes a refutation, but the intension is also altered tacitly by taking this opportunity. — fdrake
That matching process has changed "the taxonomic, conceptual..." frameworks of (some of) the involved terms, and those frameworks are expressed in the statement of an L2 definition/theorem-statement in which the monster refutes the L1 statement since the monster now unambiguously counts as an example of the term it targets. EG "Polyhedra are Eulerian" with the intended interpretation of convexity and simplicity vs concave polyhedral monsters. — fdrake
Usually, when a counterexample is presented, you have a choice: either you refuse to bother with it, since it is not a counter-example at all in your given language L1, or you agree to change your language by concept-stretching and accept the counterexample in your new language L2… — Twinkle221
Heuristic is concerned with language-dynamics, while logic is concerned with language-statics. — Twinkle221
So I assume, following your answer, that this is why by switching languages we can introduce "real" counterexamples that were not counterexamples before.I believe that's so, the kinds of polyhedron intuited in "all polyhedron are Eulerian" are conceptually distinct from the picture frame polyhedron (and the other monsters). — fdrake
What "allows the monsters to work as refutations" is a mismatch between how concept of polyhedron is articulated verbatim — fdrake
unformalised/unarticulated content of the intended interpretation of the terms. — fdrake
logical counterexamples — Twinkle221
That is, we may have two statements that are consistent in L1, but we switch to L2 in which they are inconsistent. Or, we may have two statements that are inconsistent in L1, but we switch to L2 in which they are consistent. As knowledge grows, languages change. — Twinkle221