MétaCan
Menu
Back to cohort
Record W2124662483 · doi:10.22329/il.v30i2.2868

Why Fallacies Appear to be Better Arguments Than They Are

2010· article· en· W2124662483 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
venuePublished in a venue whose home country is Canada.

Bibliographic record

VenueInformal Logic · 2010
Typearticle
Languageen
FieldArts and Humanities
TopicEpistemology, Ethics, and Metaphysics
Canadian institutionsUniversity of Windsor
Fundersnot available
KeywordsArgumentation theoryArgument (complex analysis)HeuristicsAppealDefeasible estateEpistemologyJumpScheme (mathematics)Mathematical economicsPsychologyComputer sciencePositive economicsMathematicsPhilosophyEconomicsLawPolitical scienceMathematical optimizationPhysics

Abstract

fetched live from OpenAlex

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.957
Threshold uncertainty score0.894

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0010.001

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.

Opus teacher head0.061
GPT teacher head0.262
Teacher spread0.201 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it