We show that the set of ultimately true sentences in Hartry Field's Revenge-immune solution model to the semantic paradoxes is recursively isomorphic to the set of stably true sentences obtained in Hans Herzberger's revision sequence starting from the null hypothesis. We further remark that this shows that a substantial subsystem of second-order number theory is needed to establish the semantic values of sentences in Field's relative consistency proof of his theory over the ground model of the standard natural numbers: -CA0 (...) (second-order number theory with a -comprehension axiom scheme) is insufficient. We briefly consider his claim to have produced a solution to the semantic paradoxes by introducing this conditional. We remark that the notion of a operator can be introduced in other settings. (shrink)

We show how in the hierarchies${F_\alpha }$of Fieldian truth sets, and Herzberger’s${H_\alpha }$revision sequence starting from any hypothesis for${F_0}$ that essentially each${H_\alpha }$ carries within it a history of the whole prior revision process.As applications we provide a precise representation for, and a calculation of the length of, possiblepath independent determinateness hierarchiesof Field’s construction with a binary conditional operator. We demonstrate the existence of generalized liar sentences, that can be considered as diagonalizing past the determinateness hierarchies definable in Field’s recent (...) models. The ‘defectiveness’ of such diagonal sentences necessarily cannot be classified by any of the determinateness predicates of the model. They are ‘ineffable liars’. We may consider them a response to the claim of Field that ‘the conditional can be used to show that the theory is not subject to “revenge problems”.’. (shrink)

The paper offers a solution to the semantic paradoxes, one in which (1) we keep the unrestricted truth schema “True(A)↔A”, and (2) the object language can include its own metalanguage. Because of the first feature, classical logic must be restricted, but full classical reasoning applies in “ordinary” contexts, including standard set theory. The more general logic that replaces classical logic includes a principle of substitutivity of equivalents, which with the truth schema leads to the general intersubstitutivity of True(A) with A (...) within the language.The logic is also shown to have the resources required to represent the way in which sentences (like the Liar sentence and the Curry sentence) that lead to paradox in classical logic are “defective”. We can in fact define a hierarchy of “defectiveness” predicates within the language. Contrary to claims that any solution to the paradoxes just breeds further paradoxes (“revenge problems”) involving defectiveness predicates, there is a general consistency/conservativeness proof that shows that talk of truth and the various “levels of defectiveness” can all be made coherent together within a single object language. (shrink)