Apps

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

Kettle Logic

Also Known As: Kettle Defense Alternative Pleading
Informal Fallacy ID: kettle_logic

Definition

Kettle logic presents multiple inconsistent or contradictory arguments in defense of the same position, without acknowledging the contradictions between them. Named after Freud's anecdote about a man who (1) returned the kettle undamaged, (2) it was already damaged when he borrowed it, and (3) he never borrowed it, each defense undermines the others. The arguer throws out every possible defense hoping one will stick.

Examples

"I didn't take the money from the register. And even if I did, it was owed to me. Besides, there was never any money in the register in the first place."

A student caught plagiarizing tells the professor: 'That essay is entirely my own work. And even if some sentences look similar, I was just inspired by that source. Besides, everyone in the class copies things — it's basically expected.'

A company spokesperson responds to pollution allegations: 'Our factory has not released any harmful chemicals. And if trace amounts were detected, they are well within acceptable limits. Also, the testing equipment used by the environmental agency is known to be unreliable.'

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.

Defend(P, A1) AND Defend(P, A2) AND Contradicts(A1, A2)
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

    Are multiple defenses or explanations being offered simultaneously?

    Type: binary
  2. 2

    Are the defenses logically inconsistent with each other?

    Type: binary
  3. 3

    Would accepting one defense undermine another defense offered for the same point?

    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