The paper responds to Neil Tennant's recent discussion of Fitch's so-called paradox of knowability in the context of intuitionistic logic. Tennant's criticisms of the author's earlier work on this topic are shown to rest on a principle about the assertability of disjunctions with the absurd consequence that everything we could make true already is true. Tennant restricts the anti-realist principle that truth implies knowability in order to escape Fitch's argument, but a more complex variant of the argument is shown to (...) elicit from his restricted principle exactly the consequences which it was intended to avoid. (shrink)

There is an argument which seems to show that if all truths are knowable then all truths are known. It may be viewed as a "reductio ad absurdum" of certain forms of antirealism. However, The claim has been made elsewhere that the argument fails against antirealists who employ constructivist rather than classical logic. The paper defends and amplifies this claim against criticisms by crispin wright and others. Relations between knowability and time are discussed. Suggestions are also made about the proper (...) form of the constructivist semantics for the conditional, Involving a non-Platonistic version of the distinction between types and tokens of proofs. (shrink)

If anti-realism is defined as the principle that all truths are knowable, then anti-realists have a reason to revise logic. For an argument first published by Fitch seems to reduce anti-realism to absurdity within classical but not constructivist logic. One might try to sever this link between anti-realism and revisionism in logic by giving either a modified version of anti-realism not vulnerable to Fitch's argument within classical logic or a modified version of Fitch's argument to which anti-realism is vulnerable within (...) constructivist logic. (shrink)

A formal theory of truth, alternative to tarski's 'orthodox' theory, based on truth-value gaps, is presented. the theory is proposed as a fairly plausible model for natural language and as one which allows rigorous definitions to be given for various intuitive concepts, such as those of 'grounded' and 'paradoxical' sentences.

Predicates are term-to-sentence devices, and operators are sentence-to-sentence devices. What Kaplan and Montague's Paradox of the Knower demonstrates is that necessity and other modalities cannot be treated as predicates, consistent with arithmetic; they must be treated as operators instead. Such is the current wisdom.A number of previous pieces have challenged such a view by showing that a predicative treatment of modalities neednot raise the Paradox of the Knower. This paper attempts to challenge the current wisdom in another way as well: (...) to show that mere appeal to modal operators in the sense of sentence-to-sentence devices is insufficient toescape the Paradox of the Knower. A family of systems is outlined in which closed formulae can encode other formulae and in which the diagonal lemma and Paradox of the Knower are thereby demonstrable for operators in this sense. (shrink)