The model of self-referential truth presented in this paper, named Revision-theoretic supervaluation, aims to incorporate the philosophical insights of Gupta and Belnap’s Revision Theory of Truth into the formal framework of Kripkean fixed-point semantics. In Kripke-style theories the final set of grounded true sentences can be reached from below along a strictly increasing sequence of sets of grounded true sentences: in this sense, each stage of the construction can be viewed as an improvement on the previous ones. I want to (...) do something similar replacing the Kripkean sets of grounded true sentences with revision-theoretic sets of stable true sentences. This can be done by defining a monotone operator through a variant of van Fraassen’s supervaluation scheme which is simply based on ω-length iterations of the Tarskian operator. Clearly, all virtues of Kripke-style theories are preserved, and we can also prove that the resulting set of “grounded” true sentences shares some nice features with the sets of stable true sentences which are provided by the usual ways of formalising revision. What is expected is that a clearer philosophical content could be associated to this way of doing revision; hopefully, a content directly linked with the insights underlying finite revision processes. (shrink)

An important question for proponents of non-contractive approaches to paradox is why contraction fails. Zardini offers an answer, namely that paradoxical sentences exhibit a kind of instability. I elaborate this idea using revision theory, and I argue that while instability does motivate failures of contraction, it equally motivates failure of many principles that non-contractive theorists want to maintain.

We argue that distinct conditionals—conditionals that are governed by different logics—are needed to formalize the rules of Truth Introduction and Truth Elimination. We show that revision theory, when enriched with the new conditionals, yields an attractive theory of truth. We go on to compare this theory with one recently proposed by Hartry Field.

We present an extension of the basic revision theory of circular definitions with a unary operator, □. We present a Fitch-style proof system that is sound and complete with respect to the extended semantics. The logic of the box gives rise to a simple modal logic, and we relate provability in the extended proof system to this modal logic via a completeness theorem, using interpretations over circular definitions, analogous to Solovay’s completeness theorem forGLusing arithmetical interpretations. We adapt our proof to (...) a special class of circular definitions as well as to the first-order case. (shrink)

This original and enticing book provides a fresh, unifying perspective on many old and new logico-philosophical conundrums. Its basic thesis is that many concepts central in ordinary and philosophical discourse are inherently circular and thus cannot be fully understood as long as one remains within the confines of a standard theory of definitions. As an alternative, the authors develop a revision theory of definitions, which allows definitions to be circular without this giving rise to contradiction (but, at worst, to “vacuous” (...) uses of definienda). The theory is applied with varying levels of detail to a circular analysis of concepts as diverse as truth, predication, necessity, physical object, etc. The focus is on truth, and hope is expressed that a deeper understanding of the Liar and related paradoxes has been provided: “We have tried to show that once the circularity of truth is recognized, a great deal of its behavior begins to make sense. In particular, from this viewpoint, the existence of the paradoxes seems as natural as the existence of the eclipses” (p. 142). We think that this hope is fully justified, although some problems remain that future research in this field should take into account. (shrink)

Russell’s type theory has been the standard property theory for years, relying on rigid type distinctions at the grammatical level to circumvent the paradoxes of predication. In recent years it has been convincingly argued by Bealer, Cochiarella, Turner and others that many linguistic and ontological data are best accounted for by using a type-free property theory. In the spirit of exploring alternatives and “to have as many opportunities as possible for theory comparison”, this paper presents another type-free property theory, to (...) be called P*, intended for applications in Montague-style natural language semantics and formal ontology. The theory is philosophically grounded on Gupta’s and Belnap’s revision theory of definitions and its basic idea is viewing predication (exemplification) as a ‘circular concept’ that can be captured by circular definitions. The paper has the following fourteen sections: (1) Introduction; (2) Formal type-free property theory; (3) Applying RTD [revision theory of definitions] to exemplification; (4) The system P*; (5) Some features of P*; (6) A comparison with Turner’s system; (7) Entailment and P*; (8) P* and natural language semantics; (9) Noun phrases; (10) The need for type-freedom in semantics; (11) Arithmetic in P*; (12) Arithmetic in PN*; (13) Complexity of P*; (14) Conclusion, and acknowledgments. (shrink)

In this paper we show that the Gupta-Belnap systems S# and S* are П12. Since Kremer has independently established that they are П12-hard, this completely settles the problem of their complexity. The above-mentioned upper bound is established through a reduction to countable revision sequences that is inspired by, and makes use of a construction of McGee.

We describe the solution of the Limit Rule Problem of Revision Theory and discuss the philosophical consequences of the fact that the truth set of Revision Theory is a complete 1/2 set.

We look at various notions of a class of definability operations that generalise inductive operations, and are characterised as “revision operations”. More particularly we: (i) characterise the revision theoretically definable subsets of a countable acceptable structure; (ii) show that the categorical truth set of Belnap and Gupta’s theory of truth over arithmetic using \emph{fully varied revision} sequences yields a complete \Pi13 set of integers; (iii) the set of \emph{stably categorical} sentences using their revision operator ψ is similarly \Pi13 and which (...) is complete in Gödel’s universe of constructible sets L; (iv) give an alternative account of a theory of truth—realistic variance that simplifies full variance, whilst at the same time arriving at Kripkean fixed points. (shrink)

I survey some important semantical and axiomatic theories of self-referential truth. Kripke's fixed-point theory, the revision theory of truth and appraoches involving fuzzy logic are the main examples of semantical theories. I look at axiomatic theories devised by Cantini, Feferman, Freidman and Sheard. Finally some applications of the theory of self-referential truth are considered.

Philip Kremer, Department of Philosophy, McMaster University Note: The following version of this paper does not contain the proofs of the stated theorems. A longer version, complete with proofs, is forthcoming. §1. Introduction. In "The truth is never simple" and its addendum, Burgess conducts a breathtakingly comprehensive survey of the complexity of the set of truths which arise when you add a truth predicate to arithmetic, and interpret that predicate according to the fixed point semantics or the revision-theoretic semantics for (...) languages expressing their own truth concepts. Burgess considers various sets that can be said to represent truth in this context, and shows that their complexity ranges from Π11 or Σ11 to Π12 or Σ12. Thus, enriching arithmetic with a truth predicate increases its complexity, which is otherwise only ∆11. (shrink)

In this paper, an objective conception of contexts based loosely upon situation theory is developed and formalized. Unlike subjective conceptions, which take contexts to be something like sets of beliefs, contexts on the objective conception are taken to be complex, structured pieces of the world that (in general) contain individuals, other contexts, and propositions about them. An extended first-order language for this account is developed. The language contains complex terms for propositions, and the standard predicate "ist" that expresses the relation (...) that holds between a context and a proposition just in case the latter is true in the former. The logic for the objective conception features a global classical predicate calculus, a local logic for reasoning within contexts, and axioms for propositions. The specter of paradox is banished from the logic by allowing "ist" to be nonbivalent in problematic cases: it is not in general the case, for any context c and proposition p, that either ist(c,p) or ist(c, ¬p). An important representational capability of the logic is illustrated by proving an appropriately modified version of an illustrative theorem from McCarthy's classic Blocks World example. (shrink)

We consider various concepts associated with the revision theory of truth of Gupta and Belnap. We categorize the notions definable using their theory of circular definitions as those notions universally definable over the next stable set. We give a simplified account of varied revision sequences-as a generalised algorithmic theory of truth. This enables something of a unification with the Kripkean theory of truth using supervaluation schemes.