Apps

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

Illicit Conversion

Also Known As: Converse Error of Categorical Propositions Simple Conversion Error
Formal Fallacy ID: illicit_conversion

Definition

Illicit conversion is a formal fallacy that involves invalidly converting a categorical statement by switching its subject and predicate. While 'No A are B' validly converts to 'No B are A,' and 'Some A are B' converts to 'Some B are A,' the statement 'All A are B' does not validly convert to 'All B are A.' This asymmetry is frequently overlooked in everyday reasoning.

Examples

"All terrorists are extremists. Therefore, all extremists are terrorists." (Being a terrorist implies being an extremist, but being an extremist does not imply being a terrorist.)

'All vaccines are medical interventions' is incorrectly converted to 'All medical interventions are vaccines.' Being a vaccine guarantees being a medical intervention, but surgeries, antibiotics, and therapies are also medical interventions without being vaccines.

A social media post reads: 'All convicted fraudsters lied to their victims, so everyone who has ever lied is a convicted fraudster.' The original relationship runs one way only — lying is a component of fraud, but lying alone does not make someone a convicted fraudster.

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.

ALL x: A(x) -> B(x); therefore ALL x: B(x) -> A(x) [invalid]
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

    Has the subject and predicate of a categorical statement been switched?

    Type: binary
  2. 2

    Is the original statement a universal affirmative (All A are B)?

    Type: binary
  3. 3

    Does the conversion preserve the logical validity of the original proposition?

    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.

Hierarchical Context