Bibliographic record
Abstract
This paper offers a solution to the problem of understanding how a fallacious argument can be deceptive by “seeming to be valid”, or (better) appearing to be a better argument of its kind than it really is. The explanation of how fallacies are deceptive is based on heuristics and paraschemes. Heuristics are fast and frugal shortcuts to a solution to a problem that sometimes jump to a conclusion that is not justified. In fallacious instances, according to the theory proposed, this jump overlooks prerequisites of the defeasible argumentation scheme for the type of argument in question. Three informal fallacies, argumentum ad verecundiam, argumentum ad ignorantiam and fear appeal argument, are used to illustrate and explain the theory.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.022 | 0.104 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.005 | 0.003 |
| Science and technology studies | 0.006 | 0.021 |
| Scholarly communication | 0.012 | 0.028 |
| Open science | 0.002 | 0.007 |
| Research integrity | 0.008 | 0.008 |
| Insufficient payload (model declined to judge) | 0.013 | 0.003 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".