Apps

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

Begging the Question (Petitio Principii)

Also Known As: Petitio Principii Circular Argument Assuming the Conclusion
Informal Fallacy ID: begging_the_question

Definition

Begging the question occurs when an argument's premises assume the truth of the conclusion, making the argument circular. In its strict logical sense, it is a form of circular reasoning where the conclusion is smuggled into the premises, often through rephrasing or implicit assumption. It differs from common misuse of the phrase 'begs the question' (meaning 'raises the question').

Examples

"Free speech is important because people should be able to say what they want." (The premise -- people should be able to say what they want -- is simply a restatement of the conclusion that free speech is important.)

A tech CEO argues: 'Our platform should not be regulated because government interference in free markets is always harmful.' The premise — that regulation is harmful — simply assumes the conclusion that the platform should be left alone, without providing independent support.

A student defends plagiarism: 'Copying this essay can't be wrong because I'm not doing anything unethical.' The claim that it is not unethical is exactly what needs to be proven; the premise merely restates the conclusion in different words.

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.

P (where P is equivalent to or presupposes the conclusion C); therefore C
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 any premise assume or restate the conclusion?

    Type: binary
  2. 2

    Could someone who doubts the conclusion also reasonably doubt the premise?

    Type: binary
  3. 3

    Does the argument provide independent support for 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