Skip to content

Fitch's paradox of knowability

Fitch's paradox of knowability is a puzzle of epistemic logic.

Version
v1 · 2026-09-28 · History
Domain-specific #
9478
Domain group
Humanities
Origin domain
Philosophy
Subdomains
Epistemic Logic, Epistemology → Philosophy

Core Idea

Fitch's paradox of knowability is treated here as the recurring mathematics, logic, and statistics identity summarized by this source-grounded definition: Fitch's paradox of knowability is a puzzle of epistemic logic. Fitch's paradox of knowability is a puzzle of epistemic logic. It provides a challenge to the knowability thesis, which states that every truth is, in principle, knowable. The paradox states that this assumption implies the omniscience principle, which asserts that every truth is known. Essentially, Fitch's paradox asserts that the existence of an unknown truth is unknowable.

Scope of Application

  • Generalisations. Joe Salerno gives the example of "caused by God": rule (C) becomes that every true fact could have been caused by God, and the conclusion is that every true fact was.

  • Proof. Suppose p is a sentence that is an unknown truth; that is, the sentence p is true, but it is not known that p is true.

  • Proof. In such a case, the sentence "the sentence p is an unknown truth" is true; and, if all truths are knowable, it should be possible to know that "p is an.

  • Proof. But this isn't possible, because as soon as we know "p is an unknown truth", we know that p is true, rendering p no longer an unknown truth, so the statement.

  • Proof. Hence, the statement "p is an unknown truth" cannot be both known and true at the same time.

Clarity

A clear use of Fitch's paradox of knowability names the carrier, the operative relation, and the conditions under which the source treats the identity as present. The minimal definition is Fitch's paradox of knowability is a puzzle of epistemic logic. The strongest recognition evidence in the frozen account is: The paradox appeared as a minor theorem in a 1963 paper by Frederic Fitch, "A Logical Analysis of Some Value Concepts".

Manages Complexity

Fitch's paradox of knowability compresses multiple mathematics, logic, and statistics details into a stable diagnostic relation. The source shows both the central mechanism—for instance instead of "known" we could have the doxastic modality "believed by a rational person" (represented by B).—and the practical consequence—in such a case, the sentence "the sentence p is an unknown truth" is true; and, if all truths are knowable, it should be.

Abstract Reasoning

  1. Type the carrier. Identify the mathematics, logic, and statistics entities to which the claim applies.
  2. State the relation. Use the source-grounded identity: Fitch's paradox of knowability is a puzzle of epistemic logic.
  3. Check operation and conditions. So if any true sentence could possibly be believed by a rational person, then that sentence is believed by one or more rational persons.
  4. Demand recognition evidence. The paradox appeared as a minor theorem in a 1963 paper by Frederic Fitch, "A Logical Analysis of Some Value Concepts".

Knowledge Transfer

Within the home domain. Knowledge about Fitch's paradox of knowability transfers literally when a new case preserves the same carrier type, relation, and recognition test. Joe Salerno gives the example of "caused by God": rule (C) becomes that every true fact could have been caused by God, and the conclusion is that every true fact was caused by God. Suppose p is a sentence that is.

Relationships to Other Abstractions

Local relationship map for Fitch's paradox of knowabilityParents appear above the current abstraction, mutual partners to the right, and children below. Node labels state whether each abstraction is prime or domain-specific; colors identify relation types.Fitch's paradoxof knowabilityDOMAINPrime abstraction: Paradox — is a kind ofParadoxPRIME

Current abstraction Fitch's paradox of knowability Domain-specific

Parents (1) — more general patterns this builds on

  • Fitch's paradox of knowability is a kind of Paradox Prime

    Fitch's paradox of knowability is a domain-specific kind of paradox under the frozen identity and differentia.

Hierarchy path (1) — routes to 1 parentless root

  • Fitch's paradox of knowability → Paradox

Neighborhood in Abstraction Space

Fitch's paradox of knowability sits in a sparse region of the domain-specific corpus (71st percentile for distinctiveness): few abstractions share its structure, so a faithful description tends to retrieve it precisely.

Family — Formal Logic & Semantic Systems (18 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08