Online research in philosophy

This papers aims to analyse sentences of a self-referential language containing a truth-predicate by means of a Smullyan-style tableau system. Our analysis covers three variants of Kripke's partial-model semantics (strong and weak Kleene's and supervaluational) and three variants of the revision theory of truth (Belnap's, Gupta's and Herzberger's).

It is a truism that people speak ‘loosely’——that is, that they often say things that we can recognize not to be true, but which come close enough to the truth for practical purposes. Certain expressions. such as those including ‘exactly’, ‘all’ and ‘perfectly’, appear to serve as signals of the intended degree of approximation to the truth. This article presents a novel formalism for representing the notion of approximation to the truth, and analyzes the meanings of these expressions in terms of this formalism. Pragmatic loosencss of this kind should be distinguished from authentic truth-conditional vagueness.

In this book, Yaqub describes a simple conception of truth and shows that it yields a semantical theory that accommodates the whole range of our seemingly conflicting intuitions about truth. This conception takes the Tarskian biconditionals (such as "The sentence 'Johannes loved Clara' is true if and only if Johannes loved Clara") as correctly and completely defining the notion of truth. The semantical theory, which is called the revision theory, that emerges from this conception paints a metaphysical picture of truth as a property whose applicability is given by a revision process rather than by a fixed extension. The main advantage of this revision process is its ability to explain why truth seems in many cases almost redundant, in others substantial, and yet in others paradoxical (as in the famous Liar). Yaub offers a comprehensive defense of the revision theory of truth by developing consistent and adequate formal semantics for languages in which all sorts of problematic sentences (Liar and company) can be constructed. Yaqub concludes by introducing a logic of truth that further demonstrates the adequacy of the revision theory.

In this paper we argue that Revision Rules, introduced by Anil Gupta and Nuel Belnap as a tool for the analysis of the concept of truth, also provide a useful tool for defining computable functions. This also makes good on Gupta's and Belnap's claim that Revision Rules provide a general theory of definition, a claim for which they supply only the example of truth. In particular we show how Revision Rules arise naturally from relaxing and generalizing a classical construction due to Kleene, and indicate how they can be employed to reconstruct the class of the general recursive functions. We also point at how Revision Rules can be employed to access non-minimal fixed points of partially defined computing procedures.

In reply to Geach's objection against expressivism, some have claimed that there is a plurality of truth predicates. I raise a difficulty for this claim: valid inferences can involve sentences assessable by any truth predicate, corresponding to 'lightweight' truth as well as to 'heavyweight' truth. To account for this, some unique truth predicate must apply to all sentences that can appear in inferences. Mixed inferences remind us of a central platitude about truth: truth is what is preserved in valid inferences. The question is why we should postulate truth predicates that do not satisfy this platitude.

This paper primarily deals with the conceptual prospects for generalizing the aim of abduction from the standard one of explaining surprising or anomalous observations to that of empirical progress or even truth approximation. It turns out that the main abduction task then becomes the instrumentalist task of theory revision aiming at an empirically more successful theory, relative to the available data, but not necessarily compatible with them. The rest, that is, genuine empirical progress as well as observational, referential and theoretical truth approximation, is a matter of evaluation and selection, and possibly new generation tasks for further improvement. The paper concludes with a survey of possible points of departure, in AI and logic, for computational treatment of the instrumentalist task guided by the ‘comparative evaluation matrix’.

Straightforward theory revision, taking into account as effectively as possible the established nomic possibilities and, on their basis induced empirical laws, is conducive for (unstratified) nomic truth approximation. The question this paper asks is: is it possible to reconstruct the relevant theory revision steps, on the basis of incoming evidence, in AGM-terms? A positive answer will be given in two rounds, first for the case in which the initial theory is compatible with the established empirical laws, then for the case in which it is incompatible with at least one such a law.

Theories of truth and vagueness are closely connected; in this article, I draw another connection between these areas of research. Gupta and Belnap’s Revision Theory of Truth is converted into an approach to vagueness. I show how revision sequences from a general theory of definitions can be used to understand the nature of vague predicates. The revision sequences show how the meaning of vague predicates are interconnected with each other. The approach is contrasted with the similar supervaluationist approach.

Consider truth predicates. Minimalist analyses of truth predicates may involve commitment to some of the following claims: (i) truth “predicates” are not genuine predicates -- either because the truth “predicate” disappears under paraphrase or translation into deep structure, or because the truth “predicate” is shown to have a non-predicative function by performative or expressivist analysis, or because truth “predicates” must be traded in for predicates of the form “true-in-L”; (ii) truth predicates express ineligible, non-natural, gerrymandered properties; (iii) truth predicates express metaphysically lightweight properties; (iv) truth predicates have thin conceptual roles; (v) truth predicates express properties with no hidden essence; (vi) truth predicates express properties which have no causal or explanatory role in canonical formulations of fundamental theories.

The structuralist theory of truth approximation essen-tially deals with truth approximation by theory revision for a fixed domain. However, variable domains can also be taken into account, where the main changes concern domain extensions and restrictions. In this paper I will present a coherent set of definitions of “more truth-likeness”, “empirical progress” and “truth approximation” due to a revision of the domain of intended applications. This set of definitions seems to be the natural counterpart of the basic definitions of similar notions as far as theory revision is concerned. The formal aspects of theory revision strongly suggest an analogy between truth approximation and design research, for example, drug research. Whereas a new drug may be better for a certain disease than an old one, a certain drug may be better for another disease than for the original target disease, a phenomenon which was nicely captured by the title of a study by Rein Vos [1991]: Drugs Looking for Diseases. Similarly, truth approximation may not only take the shape of theory revision but also of domain revision, naturally suggesting the phenomenon of “Theories looking for domains”. However, whereas Vos documented his title with a number of examples, so far, apart from plausible cases of “truth accumulation by domain extension”, I did not find clear-cut empirical instantiations of the analogy, only, as such, very interesting, non-empirical examples.