Keeping ‘True’: A Case Study in Conceptual Ethics

Suppose our ordinary notion of truth is ‘inconsistent’ in the sense that its meaning is partly given by principles that classically entail a logical contradiction. Should we replace the notion with a consistent surrogate? This paper begins by defusing various arguments in favor of this revisionary proposal, including Kevin Scharp’s contention that we need to replace truth for the purposes of semantic theorizing (and thus, in particular, to formulate the inconsistency theory of truth itself). Borrowing a certain conservative metasemantic principle from Matti Eklund, the article goes on to build a positive case for the opposite policy: retaining truth as-is. The thought is basically that bivalence for the bulk of what we say in the course of ordinary, scientific, and philosophical inquiry should suffice to justify keeping ‘true’. Two versions of the story are told: one more philosophical, drawing on an analogy to Lewis’ response to Putnam’s paradox; the other more technical, invoking a deviant strand of mathematical work on the semantic paradoxes.     

Axiomatic Theories of Partial Ground II

This is part two of a two-part paper in which we develop an axiomatic theory of the relation of partial ground. The main novelty of the paper is the of use of a binary ground predicate rather than an operator to formalize ground. In this part of the paper, we extend the base theory of the first part of the paper with hierarchically typed truth-predicates and principles about the interaction of partial ground and truth. We show that our theory is a proof-theoretically conservative extension of the ramified theory of positive truth up to ?? ₀ and thus is consistent. We argue that this theory provides a natural solution to Fine’s “puzzle of ground” about the interaction of truth and ground. Finally, we show that if we apply the truth-predicate to sentences involving our ground-predicate, we run into paradoxes similar to the semantic paradoxes: we get ground-theoretical paradoxes of self-reference.     

Supervaluation-Style Truth Without Supervaluations

Kripke’s theory of truth is arguably the most influential approach to self-referential truth and the semantic paradoxes. The use of a partial evaluation scheme is crucial to the theory and the most prominent schemes that are adopted are the strong Kleene and the supervaluation scheme. The strong Kleene scheme is attractive because it ensures the compositionality of the notion of truth. But under the strong Kleene scheme classical tautologies do not, in general, turn out to be true and, as a consequence, classical reasoning is no longer admissible once the notion of truth is involved. The supervaluation scheme adheres to classical reasoning but violates compositionality. Moreover, it turns Kripke’s theory into a rather complicated affair: to check whether a sentence is true we have to look at all admissible precisification of the interpretation of the truth predicate we are presented with. One consequence of this complicated evaluation condition is that under the supervaluation scheme a more proof-theoretic characterization of Kripke’s theory becomes inherently difficult, if not impossible. In this paper we explore the middle ground between the strong Kleene and the supervaluation scheme and provide an evaluation scheme that adheres to classical reasoning but retains many of the attractive features of the strong Kleene scheme. We supplement our semantic investigation with a novel axiomatic theory of truth that matches the semantic theory we have put forth.     

Filtering Theories of Truth: Compositionality as a Criterion

The traditional way to filter out the implausible candidate solutions to the semantic paradoxes is to appeal to the so-called “cost/benefit analyses.” Yet it is often tedious and controversial to carry out such analyses in detail. Facing this, it would be helpful for us to rely upon some principles to filter out at least something, if not everything, from them. The proposal in this paper is thereby rather simple: We may use principles of compositionality as a “filter” for this purpose. The paper has four sections. In Section 2, the author uses the filter to examine Kripke’s fixed-point theory and to thereby show how it works. In Section 3, the author gives more examples from the classical theories of truth to demonstrate the power of the filter. In Section 4, the author addresses the skepticism concerning whether there is any consistent or non-trivial theory of truth that can survive this filtering procedure. A “nearly sufficient” condition for a theory of truth to survive this test is discussed in order to show that at least some consistent or non-trivial theories of truth do indeed survive the filtering procedure.     

Truth,Predication and a Family of Contingent Paradoxes

In truth theory one aims at general formal laws governing the attribution of truth to statements. Gupta’s and Belnap’s revision-theoretic approach provides various well-motivated theories of truth, in particular T* and T#, which tame the Liar and related paradoxes without a Tarskian hierarchy of languages. In property theory, one similarly aims at general formal laws governing the predication of properties. To avoid Russell’s paradox in this area a recourse to type theory is still popular, as testified by recent work in formal metaphysics by Williamson and Hale. There is a contingent Liar that has been taken to be a problem for type theory. But this is because this Liar has been presented without an explicit recourse to a truth predicate. Thus, type theory could avoid this paradox by incorporating such a predicate and accepting an appropriate theory of truth. There is however a contingent paradox of predication that more clearly undermines the viability of type theory. It is then suggested that a type-free property theory is a better option. One can pursue it, by generalizing the revision-theoretic approach to predication, as it has been done by Orilia with his system P*, based on T*. Although Gupta and Belnap do not explicitly declare a preference for T# over T*, they show that the latter has some advantages, such as the recovery of intuitively acceptable principles concerning truth and a better reconstruction of informal arguments involving this notion. A type-free system based on T# rather than T* extends these advantages to predication and thus fares better than P* in the intended applications of property theory.

     

Minimalism and Paradoxes

This paper argues against minimalism about truth. It does so by way of acomparison of the theory of truth with the theory of sets, and considerationof where paradoxes may arise in each. The paper proceeds by asking twoseemingly unrelated questions. First, what is the theory of truth about?Answering this question shows that minimalism bears important similaritiesto naive set theory. Second, why is there no strengthened version ofRussell's paradox, as there is a strengthened Liar paradox? Answering thisquestion shows that like naive set theory, minimalism is unable to makeadequate progress in resolving the paradoxes, and must be replaced by adrastically different sort of theory. Such a theory, it is shown, must befundamentally non-minimalist.     

Vier Philosophen über semantische Paradoxien

In his treatise on sophisms, the medieval logician and philosopher J. Buridan expounded a theory on what we have come to call semantic paradoxes. His theory has not yet been fully understood. The present paper aims at showing that Barwise’s and Etchemendy’s considerations on paradoxes (founded upon Aczel’s non-well-founded sets) provide the framework for an improved understanding. Barwise’s and Etchemendy’s account is contrasted with Kripke’s. Finally, a recent analysis of Buridan’s position by Epstein is criticized     

Tarski on the Necessity Reading of Convention T

Tarski’s Convention T is often taken to claim that it is both sufficient and necessary for adequacy in a definition of truth that it imply instances of the T-schema where the embedded sentence translates the mentioned sentence. However, arguments against the necessity claim have recently appeared, and, furthermore, the necessity claim is actually not required for the indefinability results for which Tarski is justly famous; indeed, Tarski’s own presentation of the results in the later Undecidable Theories makes no mention of an assumption to the effect that the definition of truth implies the biconditionals. This raises a question: was Tarski in fact committed to the necessity claim in the important papers of the 1930s and 40s? I argue that he was not. The discussion of this apparently esoteric interpretive issue in fact gets to the heart of many important questions about truth, and in the final sections of the paper I discuss the importance of the T-biconditionals in the theory of meaning and the relation of deflationary and inflationary theories of truth to the semantic paradoxes.     

Newton versus Leibniz: intransparency versus inconsistency

In this paper I argue that inconsistencies in scientific theories may arise from the type of causality relation they—tacitly or explicitly—embody. All these seemingly different causality relations can be subsumed under a general strategy developed to defeat the paradoxes which inevitably occur in our experience of the real. With respect to this, scientific theories are just a subclass of the larger class of metaphysical theories, construed as theories that attempt to explain a (part of) the world consistently. All metaphysical theories share a common structural backbone specificially designed to defeat paradoxes, their often wildly diverging ontological claims notwithstanding. This common structure shapes the procedures which govern the invention of ideas in the context of such theories, by codifying some onto-logical a priori assumptions regarding the consistency of reality into its bare conceptual framework. Causality plays a key rôle here, because it implies conservation of identity, itself a far from simple notion. It imposes strong demands on the universalising power of the theories concerned. These demands are often met by the introduction of a metalevel which encompasses the notions of ‘system’ and ‘lawful behaviour’. In classical mechanics, the division between universal and particular leaves its traces in the separate treatment of cinematics and dynamics. The fundamental backbone’s specific gestalt thus functions as a theory’s individual signature and paves the way to a comparative historical approach towards their study. An important part of my paper therefore explores the strong connections between paradoxes as they appear and are dealt with in ancient philosophy and their re-appearance in early modern natural philosophy and science. This analysis is applied to the mechanical theories of Newton and Leibniz, with some surprising results.     

The Logics of Strict-Tolerant Logic

Adding a transparent truth predicate to a language completely governed by classical logic is not possible. The trouble, as is well-known, comes from paradoxes such as the Liar and Curry. Recently, Cobreros, Egré, Ripley and van Rooij have put forward an approach based on a non-transitive notion of consequence which is suitable to deal with semantic paradoxes while having a transparent truth predicate together with classical logic. Nevertheless, there are some interesting issues concerning the set of metainferences validated by this logic. In this paper, we show that this logic, once it is adequately understood, is weaker than classical logic. Moreover, the logic is in a way similar to the paraconsistent logic LP.     

Field's Paradox and Its Medieval Solution

Hartry Field's revised logic for the theory of truth in his new book, Saving Truth from Paradox, seeking to preserve Tarski's T-scheme, does not admit a full theory of negation. In response, Crispin Wright proposed that the negation of a proposition is the proposition saying that some proposition inconsistent with the first is true. For this to work, we have to show that this proposition is entailed by any proposition incompatible with the first, that is, that it is the weakest proposition incompatible with the proposition whose negation it should be. To show that his proposal gave a full intuitionist theory of negation, Wright appealed to two principles, about incompatibility and entailment, and using them Field formulated a paradox of validity (or more precisely, of inconsistency).

The medieval mathematician, theologian and logician, Thomas Bradwardine, writing in the fourteenth century, proposed a solution to the paradoxes of truth which does not require any revision of logic. The key principle behind Bradwardine's solution is a pluralist doctrine of meaning, or signification, that propositions can mean more than they explicitly say. In particular, he proposed that signification is closed under entailment. In light of this, Bradwardine revised the truth-rules, in particular, refining the T-scheme, so that a proposition is true only if everything that it signifies obtains. Thereby, he was able to show that any proposition which signifies that it itself is false, also signifies that it is true, and consequently is false and not true. I show that Bradwardine's solution is also able to deal with Field's paradox and others of a similar nature. Hence Field's logical revisions are unnecessary to save truth from paradox.     

Stability and Paradox in Algorithmic Logic

There is significant interest in type-free systems that allow flexible self-application. Such systems are of interest in property theory, natural language semantics, the theory of truth, theoretical computer science, the theory of classes, and category theory. While there are a variety of proposed type-free systems, there is a particularly natural type-free system that we believe is prototypical: the logic of recursive algorithms. Algorithmic logic is the study of basic statements concerning algorithms and the algorithmic rules of inference between such statements. As shown in [1], the threat of paradoxes, such as the Curry paradox, requires care in implementing rules of inference in this context. As in any type-free logic, some traditional rules will fail. The first part of the paper develops a rich collection of inference rules that do not lead to paradox. The second part identifies traditional rules of logic that are paradoxical in algorithmic logic, and so should be viewed with suspicion in type-free logic generally.     

Self-deception as affective coping. An empirical perspective on philosophical issues

In the philosophical literature, self-deception is mainly approached through the analysis of paradoxes. Yet, it is agreed that self-deception is motivated by protection from distress. In this paper, we argue, with the help of findings from cognitive neuroscience and psychology, that self-deception is a type of affective coping.First, we criticize the main solutions to the paradoxes of self-deception. We then present a new approach to self-deception. Self-deception, we argue, involves three appraisals of the distressing evidence: (a) appraisal of the strength of evidence as uncertain, (b) low coping potential and (c) negative anticipation along the lines of Damasio’s somatic marker hypothesis. At the same time, desire impacts the treatment of flattering evidence via dopamine. Our main proposal is that self-deception involves emotional mechanisms provoking a preference for immediate reward despite possible long-term negative repercussions. In the last part, we use this emotional model to revisit the philosophical paradoxes.     

Logic of paradoxes in classical set theories

According to Cantor (Mathematische Annalen 21:545–586, 1883; Cantor’s letter to Dedekind, 1899) a set is any multitude which can be thought of as one (“jedes Viele, welches sich als Eines denken läßt”) without contradiction—a consistent multitude. Other multitudes are inconsistent or paradoxical. Set theoretical paradoxes have common root—lack of understanding why some multitudes are not sets. Why some multitudes of objects of thought cannot themselves be objects of thought? Moreover, it is a logical truth that such multitudes do exist. However we do not understand this logical truth so well as we understand, for example, the logical truth ${\forall x \, x = x}$ . In this paper we formulate a logical truth which we call the productivity principle. Rusell (Proc Lond Math Soc 4(2):29–53, 1906) was the first one to formulate this principle, but in a restricted form and with a different purpose. The principle explicates a logical mechanism that lies behind paradoxical multitudes, and is understandable as well as any simple logical truth. However, it does not explain the concept of set. It only sets logical bounds of the concept within the framework of the classical two valued ${\in}$ -language. The principle behaves as a logical regulator of any theory we formulate to explain and describe sets. It provides tools to identify paradoxical classes inside the theory. We show how the known paradoxical classes follow from the productivity principle and how the principle gives us a uniform way to generate new paradoxical classes. In the case of ZFC set theory the productivity principle shows that the limitation of size principles are of a restrictive nature and that they do not explain which classes are sets. The productivity principle, as a logical regulator, can have a definite heuristic role in the development of a consistent set theory. We sketch such a theory—the cumulative cardinal theory of sets. The theory is based on the idea of cardinality of collecting objects into sets. Its development is guided by means of the productivity principle in such a way that its consistency seems plausible. Moreover, the theory inherits good properties from cardinal conception and from cumulative conception of sets. Because of the cardinality principle it can easily justify the replacement axiom, and because of the cumulative property it can easily justify the power set axiom and the union axiom. It would be possible to prove that the cumulative cardinal theory of sets is equivalent to the Morse–Kelley set theory. In this way we provide a natural and plausibly consistent axiomatization for the Morse–Kelley set theory.     

Grounded Ungroundedness

Abstract

A modification of Kripke’s theory of truth is proposed and it is shown how this modification solves some of the problems of expressive weakness in Kripke’s theory. This is accomplished by letting truth values be grounded in facts about other sentences’ ungroundedness.     

悖论的自指性与循环性

本文使用语义网分析悖论与自指性和循环性。主要结论是证明了有穷悖论都是自指的,同时其矛盾性必定基于循环性。我们还证明存在非自指但基于循环性的(无穷)悖论,比如亚布鲁悖论及其一般变形;又证明了存在自指但不基于循环性的(无穷)悖论,比如超穷赫兹伯格悖论和麦基悖论。这表明自指性与循环性对悖论而言是两个不同的概念。     

A defence of Owens’ exclusivity objection to beliefs having aims

In this paper we argue that Steglich-Petersen’s response to Owens’ Exclusivity Objection does not work. Our first point is that the examples Steglich-Petersen uses to demonstrate his argument do not work because they employ an undefended conception of the truth aim not shared by his target (and officially eschewed by Steglich-Petersen himself). Secondly we will make the point that deliberating over whether to form a belief about p is not part of the belief forming process. When an agent enters into this process of deliberation, he has not, contra Steglich-Petersen, already adopted the truth aim with regard to p. In closing, we further suggest that proponents of the truth aim hypothesis need to focus on aim-guidance, not mere aim attribution, for their approach to have explanatory utility so underlining the significance of Owens’ argument.     

对塔斯基“真”理论的辩护——与陈晓平教授商榷

陈晓平教授对塔斯基的"真"理论提出四点批评,并给出了使用"T′模式"作为真之定义的建议。但"T′模式"并不具有"内容恰当性"和"形式正确性",其引入的对"p"的摹状词解释比塔斯基的方案更复杂,对"真"进行递归定义在现有逻辑学内是不可能的。陈晓平教授对塔斯基"真"理论的批评和建议的失误之处在于误解塔斯基的原意、引入形而上学词项、需要新建形式逻辑。总之,其作为真之定义的"T′模式"是"不能允许地冗长"。     

Axiomatic Theories of Partial Ground I

This is part one of a two-part paper, in which we develop an axiomatic theory of the relation of partial ground. The main novelty of the paper is the of use of a binary ground predicate rather than an operator to formalize ground. This allows us to connect theories of partial ground with axiomatic theories of truth. In this part of the paper, we develop an axiomatization of the relation of partial ground over the truths of arithmetic and show that the theory is a proof-theoretically conservative extension of the theory PT of positive truth. We construct models for the theory and draw some conclusions for the semantics of conceptualist ground.