Apps

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

Circular Reasoning

Also Known As: Begging the Question Petitio Principii Circular Logic
Informal Fallacy 📰 Media Bias ID: circular_reasoning

Definition

Circular reasoning occurs when the conclusion of an argument is assumed, explicitly or implicitly, in one of its premises. Rather than providing independent support, the argument loops back on itself, making it logically valid but epistemically empty. It can be difficult to detect when the circle is large or the conclusion is rephrased in the premises.

Examples

"The Bible is the word of God because it says so in the Bible, and the Bible is trustworthy because it's the word of God."

This investment strategy is the most profitable because it generates the highest returns, and we know it generates the highest returns because it's the most profitable strategy.

Senator Hayes is the most qualified candidate because she has the best credentials, and we know she has the best credentials because she is clearly the most qualified candidate.

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.

A ⇒ B ⇒ A (circular)
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

    Does the conclusion appear (possibly rephrased) among the premises?

    Type: binary
  2. 2

    Is there a circular chain where A supports B and B supports A?

    Type: binary
  3. 3

    Can any premise be verified independently of the conclusion?

    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