What are the three orthogonal axes that structure the argument scheme periodic table?
This explores Wagemans's 'Periodic Table of Arguments' — the three coordinate axes he uses to map every possible argument scheme onto a single closed space, and what that buys you over a hand-built list.
This explores Wagemans's Periodic Table of Arguments and the three coordinates that define it. The corpus is precise on the axes: an argument's place is fixed by (1) its **subject–predicate structure** — whether the conclusion adjusts the subject or the predicate of a claim, (2) whether it is **first-order or second-order** reasoning — an argument about the world versus an argument about another argument, and (3) the **pairing of proposition types** it links together Can three axes organize all possible argument schemes?. Because the axes are orthogonal, every combination is a valid cell, and the cells exhaust the space — there's no scheme that falls outside the grid.
The deeper move is what this replaces. The dominant framework before Wagemans was Walton's catalog of 60-plus schemes, assembled by family resemblance — useful but open-ended, with no principle telling you when the list is complete or where a new scheme would sit. Three generative axes turn that contingent list into a finite, predictive structure, exactly mirroring chemistry's jump from cataloging substances to the periodic table that predicted undiscovered elements Can argument schemes be organized by formal principles instead of lists?. The payoff isn't tidiness — it's that empty cells become hypotheses about argument types nobody has studied yet.
The most surprising axis to sit with is the second one. Wagemans argues that the first-order/second-order split does double duty: it lines up with the *classical* distinction between internal and external topoi, and with the *modern* line between reasonable and fallacious arguments. That implies fallacies aren't just dialectical bad manners — they may have a specifiable formal-linguistic signature, a structural location on the grid rather than a judgment call Do first-order and second-order arguments unify classical and modern divisions?.
Worth knowing as a coda: a clean coordinate system on paper doesn't mean machines can read the coordinates. Classifying which scheme an actual argument instantiates demands recognizing inferential patterns spread across a whole passage, not local cues — and models that top 0.80 F1 on tagging argument components stall at 0.55–0.65 on scheme classification Why does argument scheme classification stumble where other NLP tasks succeed?, with LLMs only crossing that bar given few-shot examples and explicit scheme descriptions Can large language models classify argument schemes reliably?. The periodic table tells you the space of answers is closed; placing a real argument inside it stays genuinely hard, partly because the same text often admits more than one valid reconstruction Why do different people reconstruct the same argument differently?.
Sources 6 notes
Wagemans's Periodic Table maps all argument schemes onto coordinates across three axes: subject-predicate structure, first-order versus second-order reasoning, and proposition-type pairings. This combinatorial approach replaces Walton's open-ended list with a closed, systematic space enabling computational analysis and discovery of unstudied scheme types.
Wagemans shows that three orthogonal axes generate a closed, finite classification space for all argument types, replacing the family-resemblance logic behind Walton's 60+ schemes. This mirrors the chemical periodic table's shift from contingent lists to predictive structure.
Wagemans proposes that the first-order vs second-order argument distinction reflects both the classical internal-external topoi divide and the modern reasonable-fallacious distinction. This suggests fallacy theory operates through specifiable formal-linguistic structure rather than purely dialectical criteria.
Scheme classification requires recognizing inferential patterns across distributed text spans, not local surface features. Models plateau at F1 0.55–0.65 while the same systems exceed 0.80 on component tagging and stance, suggesting the integrative reasoning demand is fundamentally different.
Zero-shot prompting fails uniformly across models. Few-shot with scheme descriptions helps, but only larger models exceed F1 0.55, with Claude reaching 0.65. Smaller models plateau around 0.53, suggesting a representational capacity threshold.
Multiple valid argument reconstructions exist for the same text with no ground truth. This is not annotation error but an inherent feature of the task—different formalization schemas are each internally valid.