Apps

🧪 This platform is in early beta. Features may change and you might encounter bugs. We appreciate your patience!

Argument from Classification

Also Known As: Categorical Argument Argument from Category Membership
Discourse Mechanics ID: argument_from_classification

Definition

An argumentation scheme that attributes properties to an individual based on its membership in a category. The scheme relies on the correctness of the classification and the universality of the attributed property within the category. It is defeasible when the classification is contested or the property admits exceptions.

Examples

This substance is classified as a carcinogen. Carcinogens should be regulated. Therefore, this substance should be regulated.

This algorithm has been officially classified as a high-risk AI system under the relevant regulation. High-risk AI systems are required to undergo third-party audits before deployment. Therefore, this algorithm must undergo a third-party audit before deployment.

This employee's role has been classified as 'exempt' under labor law. Exempt employees are not entitled to overtime pay. Therefore, this employee is not entitled to overtime pay — though the critical question is whether the classification itself was applied correctly.

Formal Logic Pattern
FOL Pattern
The First-Order Logic formula representing this reasoning pattern's logical structure.
FOL (First-Order Logic) uses quantifiers (∀ = for all, ∃ = there exists), connectives (∧ = and, ∨ = or, ⇒ = implies, ¬ = not), and predicates to capture the essential form of a reasoning pattern. For example, the Ad Hominem fallacy: Person(x) ∧ HasFlaw(x) ⇒ Invalid(Claim(x)). These patterns allow automated verification of logical validity.

InCategory(x, C) ∧ ∀y(InCategory(y, C) → P(y)) ⇒ P(x)
Formal Verification:
Formal Verification
Checks whether a reasoning pattern is logically valid or invalid using an automated theorem prover.
Formal verification uses an SMT (Satisfiability Modulo Theories) solver — specifically Z3 — to mathematically check whether an argument's logical structure is valid. Each reasoning pattern is translated into First-Order Logic and tested: Can the premises be true while the conclusion is false? If yes, it's formally invalid. If no, it's formally valid. Many real-world patterns (analogies, heuristics) cannot be fully captured in formal logic — these are marked as not formally decidable, which doesn't mean they're wrong.
Not formally decidable

Verification Steps
Verification Steps
Binary yes/no questions that an AI must answer to detect a reasoning pattern in a text.
Each of the 452 aspects has verification steps — simple yes/no questions designed to systematically detect whether a pattern appears in a text. For ad hominem: "Does the argument attack a person rather than their claim?" For false dichotomy: "Are only two options presented when more exist?" This ensures consistent, reproducible analysis.

Binary (yes/no) questions an LLM must answer to identify this aspect:

  1. 1

    Is something being classified into a specific category?

    Type: binary
  2. 2

    Are properties of the category being attributed to the classified item?

    Type: binary
  3. 3

    Is the classification itself justified rather than merely asserted?

    Type: binary
  4. 4

    Is the property genuinely universal to the category rather than merely typical?

    Type: binary
Deep Dive
The expandable detail section on each aspect page with examples, psychology, and counter-strategies.
The Deep Dive section provides in-depth information about each aspect: a real-world example showing the pattern in action, an explanation of why it works psychologically, practical advice on how to counter it, alternative names, and links to related aspects.