Fitch’s Paradox, Stumbling Block or Touchstone for Knowability

Dissertation, Paris 1 (2012)
Download Edit this record How to cite View on PhilPapers
Abstract
If we want to say that all truths are knowable Fitch’s Paradox leads us to conclude that all truths are known. Is it a real philosophical problem or a mere modeling problem? Is it possible to express the idea of knowability using modal logic? The Knowability Principle is expressed by the formula: if Phi is true then it is possible to know that Phi. But what is the meaning of possibility in this context? Using standard modal operators under what condition can we express the idea of knowability? We will in particular examine the subjacent relations of the modal operators in a Kripke Model. We will define the possibility as the possibility of learning opposed to an unclear possibility. Then we will show that Fitch’s Paradox becomes clearer and we will examine how the Knowability Principle could be expressed in such frame.
PhilPapers/Archive ID
MARFPS
Revision history
Archival date: 2012-05-11
View upload history
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Added to PP index
2012-05-11

Total views
348 ( #8,995 of 41,614 )

Recent downloads (6 months)
15 ( #30,309 of 41,614 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks to external links.