In J Philos Logic 34:155–192, 2005, Leitgeb provides a theory of truth which is based on a theory of semantic dependence. We argue here that the conceptual thrust of this approach provides us with the best way of dealing with semantic paradoxes in a manner that is acceptable to a classical logician. However, in investigating a problem that was raised at the end of J Philos Logic 34:155–192, 2005, we discover that something is missing from Leitgeb’s original definition. Moreover, we (...) show that once the appropriate repairs have been made, the resultant definition is equivalent to a version of the supervaluation definition suggested in J Philos 72:690–716, 1975 and discussed in detail in J Symb Log 51(3):663–681, 1986. The upshot of this is a philosophical justification for the simple supervaluation approach and fresh insight into its workings. (shrink)

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.

Gupta-Belnap-style circular definitions use all real numbers as possible starting points of revision sequences. In that sense they are boldface definitions. We discuss lightface versions of circular definitions and boldface versions of inductive definitions.

The classical theory of definitions bans so-called circular definitions, namely, definitions of a unary predicate P, based on stipulations of the form $$Px =_{\mathsf {Df}} \phi,$$where ϕ is a formula of a fixed first-order language and the definiendumP occurs into the definiensϕ. In their seminal book The Revision Theory of Truth, Gupta and Belnap claim that “General theories of definitions are possible within which circular definitions [...] make logical and semantic sense” [p. IX]. In order to sustain their claim, they (...) develop in this book one general theory of definitions based on revision sequences, namely, ordinal-length iterations of the operator which is induced by the definition of the predicate. Gupta-Belnap’s approach to circular definitions has been criticised, among others, by D. Martin and V. McGee. Their criticisms point to the logical complexity of revision sequences, to their relations with ordinary mathematical practice, and to their merits relative to alternative approaches. I will present an alternative general theory of definitions, based on a combination of supervaluation and ω-length revision, which aims to address some criticisms raised against revision sequences, while preserving the philosophical and mathematical core of revision. (shrink)

Revision sequences are a kind of transfinite sequences which were introduced by Herzberger and Gupta in 1982 as the main mathematical tool for developing their respective revision theories of truth. We generalise revision sequences to the notion of cofinally invariant sequences, showing that several known facts about Herzberger’s and Gupta’s theories also hold for this more abstract kind of sequences and providing new and more informative proofs of the old results.

This anthology of the very latest research on truth features the work of recognized luminaries in the field, put together following a rigorous refereeing process. Along with an introduction outlining the central issues in the field, it provides a unique and unrivaled view of contemporary work on the nature of truth, with papers selected from key conferences in 2011 such as Truth Be Told, Truth at Work, Paradoxes of Truth and Denotation and Axiomatic Theories of Truth. Studying the nature of (...) the concept of ‘truth’ has always been a core role of philosophy, but recent years have been a boom time in the topic. With a wealth of recent conferences examining the subject from various angles, this collection of essays recognizes the pressing need for a volume that brings scholars up to date on the arguments. Offering academics and graduate students alike a much-needed repository of today’s cutting-edge work in this vital topic of philosophy, the volume is required reading for anyone needing to keep abreast of developments, and is certain to act as a catalyst for further innovation and research. (shrink)

In this paper we explain our pretense account of truth-talk and apply it in a diagnosis and treatment of the Liar Paradox. We begin by assuming that some form of deflationism is the correct approach to the topic of truth. We then briefly motivate the idea that all T-deflationists should endorse a fictionalist view of truth-talk, and, after distinguishing pretense-involving fictionalism (PIF) from error- theoretic fictionalism (ETF), explain the merits of the former over the latter. After presenting the basic framework (...) of our PIF account of truth-talk, we demonstrate a few advantages it offers over T-deflationist accounts that do not explicitly acknowledge pretense at work in the discourse. In turning to the Liar Paradox, we explain how the quasi-anaphoric functioning that our account attributes to truth-talk provides a diagnosis of the Liar Paradox (and other instances of semantic pathology) as having no content—in the sense of not specifying any of what we call M-conditions. At the same time, however, we vindicate the intuition that we can understand liar sentences, thereby avoiding one standard objection to “meaningless strategy” responses to the Liar Paradox. With this diagnosis in place, we then, by way of treatment, introduce a new predicate, ‘semantically defective’, and show how the explanation we give for its application allows for a consistent, yet revenge-immune, (dis)solution of the Liar Paradox, and semantic pathology generally. (shrink)

Kremer presented three approaches of comparing fixed-point and revision theories of truth in Kremer, 363–403, 2009). Using these approaches, he established the relationships among ten fixed-point theories suggested by Kripke in, 690–716, 1975) and three revision theories presented by Gupta and Belnap in. This paper continues Kremer’s work. We add five other revision theories to the comparisons, including the theory proposed by Gupta in, 1–60, 1982), the theory proposed by Herzberger in, 61–102, 1982), the theory based on fully-varied revision sequences (...) proposed by Gupta and Belnap in, the theory proposed by Yaqūb in, and the theory based on weakly consistent revision sequences. We show that, the notion of Thomason model defined by Belnap’s limit rule is not equivalent to the one defined by Gupta’s limit rule, and that the theory based on fully-varied revision sequences is ≤2-equivalent to the one based on the greatest intrinsic fixed point of σ. (shrink)

We present a semi-formal foundational theory of sorts, akin to sets, named librationism because of its way of dealing with paradoxes. Its semantics is related to Herzberger’s semi inductive approach, it is negation complete and free variables (noemata) name sorts. Librationism deals with paradoxes in a novel way related to paraconsistent dialetheic approaches, but we think of it as bialethic and parasistent. Classical logical theorems are retained, and none contradicted. Novel inferential principles make recourse to theoremhood and failure of theoremhood. (...) Identity is introduced à la Leibniz-Russell, and librationism is highly non-extensional. Π 1 1 -comprehension with ordinary Bar-Induction is accounted for (to be lifted). Power sorts are generally paradoxical, and Cantor’s Theorem is blocked as a camouflaged premise is naturally discarded. (shrink)

This paper introduces theories for arithmetical quasi-inductive definitions (Burgess, 1986) as it has been done for first-order monotone and nonmonotone inductive ones. After displaying the basic axiomatic framework, we provide some initial result in the proof theoretic bounds line of research (the upper one being given in terms of a theory of sets extending Kripke–Platek set theory).

We sketch a broadening of the Gupta-Belnap notion of a circular or revision theoretic definition into that of a more generalized form incorporating ideas of Kleene’s generalized or higher type recursion. This thereby connects the philosophically motivated, and derived, notion of a circular definition with an older form of definition by recursion using functionals, that is functions of functions, as oracles. We note that Gupta and Belnap’s notion of ‘categorical in L’ can be formulated in at least one of these (...) schemes. (shrink)