Construct · 1 fields · 1 citations

knowability paradox: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed
knowabilityparadox1 CONSTRUCTKnowability paradoxFITCH · LOGIC

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Logic

proof that if every truth is knowable then every truth is known, posing a problem for anti-realist accounts of truth.

In logic, knowability paradox refers to proof that if every truth is knowable then every truth is known, posing a problem for anti-realist accounts of truth. This meaning comes from Fitch (1963) in Journal of Symbolic Logic.[1]

Unit
Recovery means
Measured by

Next

Run it through the Collider, or take the citations with you.

See how knowability paradox sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in ColliderExport BibTeXReport this entry

Nearby constructs

accounts1 fields · 1 citationsanchor · a standalone constructparadox3 fields · 4 citationsjingle · one word, three constructsproof2 fields · 5 citationsjingle · one word, two constructs

References

  1. Fitch, F. B. (1963). A logical analysis of some value concepts. Journal of Symbolic Logic, 28(2), 135-142. https://doi.org/10.2307/2271594

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct