I have been thinking about Fitch’s paradox again, and it seems to me that a very generic contextualist solution is available. The knowledge operator is said to be a three place relation, Katp, between (1) an agent, (2) a time, and (3) a proposition. The contextualist argument modifies this relation to include context in some way. In other words, context governs shifting standards in play when attributing knowledge. This modification, then, may be represented by adding an index to the knowledge operator, something like an ordered pair, <f,n>, representing a set of standards ‘n’ relative to an information state ‘f’. In other words, we have a factual component representing the information a particular context makes accessible, and a normative component which supervenes on the factual component.1 Abbreviating this pair as ‘c’, we have the knowledge operator now represented as a four-place relation Katcp. Given this generic representation of context, the variable ‘c’ may shift in two directions, either (a) the standards in play may be strengthened or weakened or (b) the information-state of the agent may change. While a change in information-state will tend to shift the epistemic standards in play, it is not necessary that these two variables shift in tandem, for there are many examples of context shifting due to the introduction of new information that does not specifically undermine particular knowledge claims.2
Given this framework, a preliminary objection could be made that there is no operator to shift the context, but I think that the recent to-do about competent deduction closure schemas presents an efficient method for introducing such an operator. That is to say, when one is in a position-to-know some proposition, whatever operator is introduced to show a deduction being made would be sufficient to shift the context ‘c’. This is due to the introduction of new information–the move from evidence to knowledge–which could potentially raise or lower the supervenient standards.3
Now for the paradox of knowability. To be brief4, the core of the paradox lies in a reductio ad absurdum:
| (1) K(p & ~Kp) | Assumption | |
| (2) Kp & K(~Kp) | (1), K-Closure | |
| (3) Kp & ~Kp | (3), K-Factive |
Where (2) follows from (1) given that knowledge distributes over conjunction, and (3) follows from (2) provided that knowledge is logically stronger than truth. Now, a competent deduction closure schema would modify the move from (1) to (2), limiting the conjuncts in (2) to just the set of some agents evidence, where said agent would have to preform a competent deduction on her evidence in order to infer the contradiction in (3). Given the preceding framework, however, this deduction would shift the context parameter between the left-hand-side and right-hand-side of (3):
| (1) Kc(p & ~Kcp) | Assumption | |
| (2) Ep & E(~Kcp) | (1), CD-Closure | |
| (3) Kc’p & Kc’(~Kcp) | (2), Competent Deduction | |
| (4) Kc’p & ~Kcp | (3), K-Factive |
Here (2) notes that some agent is in a position to know the conjuncts of (1), but the move from (2) to (3), the deduction itself, shifts the context. New information is introduced. In other words, if knowledge is closed under position-to-know, then there is a relationship between the information one has access to in any given context and the potential extensions of said information, but once one does in fact extend said information the information-state denoted by ‘f’ in ‘c’ has changed.
- I should note here that I am oversimplifying things by characterizing ‘f’ as factual, for I would think that the information accessible given any context would consist not only of facts, but also the salient possibilities of error, the set of presuppositions in play, and possibly many other components which would be relevant to the supervenient norms. ↩
- This is going to localize knowledge in much the same way Jonathan Schaffer’s contrastive account does, and I have to say that I have benefited greatly from my antecedent work on his contrastivism. Additionally, I have to thank Jonathan Kvanvig for the many conversations regarding the issues involved in the paradox of knowability as well, for without his teaching I would not have the grasp I do on the intricacies of this particular problem. ↩
- I have to thank Ryan Wasserman here for pointing out that the position-to-know closure schema might be available to do some extra work regarding a solution to this paradox. ↩
- Given that this is just a blog, I am here summarizing the germ of an idea on which I intend to capitalize in a more formal manner in the weeks to come. For additional information on this paradox, see my posts here and here, or the SEP entry here. ↩

Recent Comments