In comparing classical and non-classical solutions to the semantic paradoxes arguments relying on strength have been influential. In this paper I argue that non-classical solutions should preserve the proof-theoretic strength of classical solutions. Leitgeb’s logic of HYPE is then presented as an interesting possibility to strengthen FDE with a suitable conditional. It is shown that HYPE allows for a non-classical Kripkean theory of truth, called KFL, that is strong enough for the relevant purposes and has additional attractive properties.

Hartry Field distinguished two concepts of type‐free truth: scientific truth and disquotational truth. We argue that scientific type‐free truth cannot do justificatory work in the foundations of mathematics. We also present an argument, based on Crispin Wright's theory of cognitive projects and entitlement, that disquotational truth can do justificatory work in the foundations of mathematics. The price to pay for this is that the concept of disquotational truth requires non‐classical logical treatment.

We discuss the interplay between the axiomatic and the semantic approach to truth. Often, semantic constructions have guided the development of axiomatic theories and certain axiomatic theories have been claimed to capture a semantic construction. We ask under which conditions an axiomatic theory captures a semantic construction. After discussing some potential criteria, we focus on the criterion of ℕ-categoricity and discuss its usefulness and limits.

The infinitary function of the truth predicate consists in its ability to express infinite conjunctions and disjunctions. A transparency principle for truth states the equivalence between a sentence and its truth predication; it requires an introduction principle—which allows the inference from “snow is white” to “the sentence ‘snow is white’ is true”—and an elimination principle—which allows the inference from “the sentence ‘snow is white’ is true” to “snow is white”. It is commonly assumed that a theory of truth needs to (...) satisfy a transparency principle to fulfil the infinitary function. Picollo and Schindler (Erkenntnis 83:899–928, 2017) argue against this idea. They prove that, given certain assumptions, an elimination principle is sufficient for the purpose. Then, they pose a challenge: to show why we should incorporate introduction principles to our theory of truth. In this essay I take on the challenge. I show that, given the authors’ assumptions, an introduction principle is also sufficient to perform the infinitary function. (shrink)

I describe some paradoxes of ground and relate them to the semantic paradoxes.

Nonclassical theories of truth that take truth to be transparent have some obvious advantages over any classical theory of truth. But several authors have recently argued that there’s also a big disadvantage of nonclassical theories as compared to their “external” classical counterparts: proof-theoretic strength. While conceding the relevance of this, the paper argues that there is a natural way to beef up extant internal theories so as to remove their proof-theoretic disadvantage. It is suggested that the resulting internal theories are (...) preferable to their external counterparts. (shrink)

If properties are to play a useful role in semantics, it is hard to avoid assuming the naïve theory of properties: for any predicate Θ(x), there is a property such that an object o has it if and only if Θ(o). Yet this appears to lead to various paradoxes. I show that no paradoxes arise as long as the logic is weakened appropriately; the main difficulty is finding a semantics that can handle a conditional obeying reasonable laws without engendering paradox. (...) I employ a semantics which is infinite-valued, with the values only partially ordered. Can the solution be adapted to naïve set theory? Probably not, but limiting naïve comprehension in set theory is perfectly satisfactory, whereas this is not so in a property theory used for semantics. (shrink)

The paper shows how we can add a truth predicate to arithmetic (or formalized syntactic theory), and keep the usual truth schema Tr( ) ↔ A (understood as the conjunction of Tr( ) → A and A → Tr( )). We also keep the full intersubstitutivity of Tr(>A>)) with A in all contexts, even inside of an →. Keeping these things requires a weakening of classical logic; I suggest a logic based on the strong Kleene truth tables, but with → (...) as an additional connective, and where the effect of classical logic is preserved in the arithmetic or formal syntax itself. Section 1 is an introduction to the problem and some of the difficulties that must be faced, in particular as to the logic of the →; Section 2 gives a construction of an arithmetically standard model of a truth theory; Section 3 investigates the logical laws that result from this; and Section 4 provides some philosophical commentary. (shrink)

It might be thought that we could argue for the consistency of a mathematical theory T within T, by giving an inductive argument that all theorems of T are true and inferring consistency. By Gödel's second incompleteness theorem any such argument must break down, but just how it breaks down depends on the kind of theory of truth that is built into T. The paper surveys the possibilities, and suggests that some theories of truth give far more intuitive diagnoses of (...) the breakdown than do others. The paper concludes with some morals about the nature of validity and about a possible alternative to the idea that mathematical theories are indefinitely extensible. (shrink)

The naive theory of properties states that for every condition there is a property instantiated by exactly the things which satisfy that condition. The naive theory of properties is inconsistent in classical logic, but there are many ways to obtain consistent naive theories of properties in nonclassical logics. The naive theory of classes adds to the naive theory of properties an extensionality rule or axiom, which states roughly that if two classes have exactly the same members, they are identical. In (...) this paper we examine the prospects for obtaining a satisfactory naive theory of classes. We start from a result by Ross Brady, which demonstrates the consistency of something resembling a naive theory of classes. We generalize Brady’s result somewhat and extend it to a recent system developed by Andrew Bacon. All of the theories we prove consistent contain an extensionality rule or axiom. But we argue that given the background logics, the relevant extensionality principles are too weak. For example, in some of these theories, there are universal classes which are not declared coextensive. We elucidate some very modest demands on extensionality, designed to rule out this kind of pathology. But we close by proving that even these modest demands cannot be jointly satisfied. In light of this new impossibility result, the prospects for a naive theory of classes are bleak. (shrink)

ABSTRACT Section 1 discusses properties and propositions, and some of the motivation for an account in which property instantiation and propositional truth behave ‘naively’. Section 2 generalizes a standard Kripke construction for naive properties and propositions, in a language with modal operators but no conditionals. Whereas Kripke uses a 3-valued value space, the generalized account allows for a broad array of value spaces, including the unit interval [0,1]. This is put to use in Section 3, where I add to the (...) language a conditional suitable for restricting quantification. The shift from a value space based on the ‘mini-space’ {0,, 1} to one based on the ‘mini-space’ [0,1] leads to more satisfactory results than I was able to achieve in previous work: a vast variety of paradoxical sentences can now be treated very simply. In Section 4 I make a further addition to the language, a conditional modeled on the ordinary English conditional, paying particular attention to how it interacts with the restricted quantifier conditional. This is all done in the [0,1] framework, and two alternatives are considered for how the ordinary conditional is to be handled; one of them results from adding a tweak to a construction by Ross Brady. Section 5 discusses a further alternative, a standard relevance conditional (for the ordinary conditional, perhaps for use with a different quantifier-restricting conditional), but argues that it is not promising. Section 6 discusses the identity conditions of properties and propositions (again in the setting of a value space based on [0,1]); the issue of achieving naivety for coarse-grained properties is seen to be more complicated than some brief remarks in Field [2010] suggested, but a way to get a fair degree of coarse-grainedness is shown. (shrink)

Tim Maudlin’s Truth and Paradox is terrific. In some sense its solution to the paradoxes is familiar—the book advocates an extension of what’s called the Kripke-Feferman theory (although the definition of validity it employs disguises this fact). Nonetheless, the perspective it casts on that solution is completely novel, and Maudlin uses this perspective to try to make the prima facie unattractive features of this solution seem palatable, indeed inescapable. Moreover, the book deals with many important issues that most writers on (...) the paradoxes never deal with, including issues about the application of the Gödel theorems to powerful theories that include our theory of truth. The book includes intriguing excursions into general metaphysics, e.g. on the nature of logic, facts, vagueness, and much more; and it’s lucid and lively, a pleasure to read. It will interest a wide range of philosophers. (shrink)

This paper extends Kripke’s theory of truth to a language with a variably strict conditional operator, of the kind that Stalnaker and others have used to represent ordinary indicative conditionals of English. It then shows how to combine this with a different and independently motivated conditional operator, to get a substantial logic of restricted quantification within naive truth theory.

Any theory of truth must find a way around Curry’s paradox, and there are well-known ways to do so. This paper concerns an apparently analogous paradox, about validity rather than truth, which JC Beall and Julien Murzi call the v-Curry. They argue that there are reasons to want a common solution to it and the standard Curry paradox, and that this rules out the solutions to the latter offered by most “naive truth theorists.” To this end they recommend a radical (...) solution to both paradoxes, involving a substructural logic, in particular, one without structural contraction. In this paper I argue that substructuralism is unnecessary. Diagnosing the “v-Curry” is complicated because of a multiplicity of readings of the principles it relies on. But these principles are not analogous to the principles of naive truth, and taken together, there is no reading of them that should have much appeal to anyone who has absorbed the morals of both the ordinary Curry paradox and the second incompleteness theorem. (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)

Bounds consequence provides an interpretation of a multiple-conclusion consequence relation in which the derivability of a sequent is understood as the claim that it is conversationally out-of-bounds to take a position in which each member of Γ is asserted while each member of Δ is denied. Two of the foremost champions of bounds consequence—Greg Restall and David Ripley—have independently indicated that the shape of the bounds in question is determined by conversational practice. In this paper, I suggest that the standard (...) treatments of bounds consequence have focused heavily on the matter of veridicality at the expense of ignoring other features by which conversational bounds are set, prime among them being the matter of content or subject-matter. Furthermore, I argue that the semantic behavior of propositions containing “monstrous” content—content whose introduction is inappropriate to a context independently of veridical considerations—leads to a weak Kleene account of bounds consequence. (shrink)

elaboration of the last part of my Tarski Lecture, “Truth unbound”, UC Berkeley, 3 April 2006, and of the lecture, “A nicer formal theory of non-hierarchical truth”, Workshop on Mathematical Methods in Philosophy, Banff , 18-23 Feb. 2007.

Russell’s theory of memory as acquaintance with the past seems to square uneasily with his definition of acquaintance as the converse of the relation of presentation of an object to a subject. We show how the two views can be made to cohere under a suitable construal of ‘presentation’, which has the additional appeal of bringing Russell’s theory of memory closer to contemporary views on direct reference and object-dependent thinking than is usually acknowledged. The drawback is that memory as acquaintance (...) with the past falls short of fulfilling Russell’s requirement that knowledge by acquaintance be discriminating knowledge – a shortcoming shared by contemporary externalist accounts of knowledge from memory. (shrink)

The rich body of physical theories defines the foundation of our understanding of the world. Its mathematical formulation is based on classical Aristotelian logic. In the philosophy of science the ambiguities, paradoxes, and the possibility of subjective interpretations of facts have challenged binary logic, leading, among other developments, to Gotthard Günther’s theory of polycontexturality. Günther’s theory explains how observers with subjective perception can become aware of their own subjectivity and provides means to describe contradicting or even paradox observations in a (...) logically sound formalism. Here we summarize the formalism behind Günther’s theory and apply it to two well-known examples from physics where different observers operate in distinct and only locally valid logical systems. Using polycontextural logic we show how the emerging awareness of these limitations of logical systems entails the design of mathematical transformations, which then become an integral part of the theory. In our view, this approach offers a novel perspective on the structure of physical theories and, at the same time, emphasizes the relevance of the theory of polycontexturality in modern sciences. (shrink)

We consider the issue of what an agent or a processor needs to know in order to know that its messages are true. This may be viewed as a first step to a general theory of cooperative communication in distributed systems. An honest message is one that is known to be true when it is sent (or said). If every message that is sent is honest, then of course every message that is sent is true. Various weaker considerations than honesty (...) are investigated with the property that provided every message sent satisfies the condition, then every message sent is true. (shrink)

The main aim of our paper was to present three formal tools for comparing various axiomatic theories of truth. In Section 2 we aimed at showing that there are indeed many different approaches to defining a set of axioms for the notion of truth. In Section 3 we introduced three different \measures of strength" of axiomatic theories of truth, i.e. three reflexive and transitive relations on the set of axiomatic theories of truth. We have explained the intuition behind each of (...) them. The three relations were called : Fujimoto definability, model-theoretical strength, proof-theoretical strength. Then in the last section we described how they order the truth theories introduced in Section 2. We observed that theories made equivalent by the coarser relation can be strictly ordered by the next one. (shrink)

This paper is a follow-up to [4], in which a mistake in [6] was corrected. We give a strenghtening of the main result on the semantical nonconservativity of the theory of PT−with internal induction for total formulae${$, denoted by PT−in [9]). We show that if to PT−the axiom of internal induction forallarithmetical formulae is added, then this theory is semantically stronger than${\rm{P}}{{\rm{T}}^ - } + {\rm{INT}}\left$. In particular the latter is not relatively truth definable in the former. Last but not (...) least, we provide an axiomatic theory of truth which meets the requirements put forward by Fischer and Horsten in [9]. The truth theory we define is based on Weak Kleene Logic instead of the Strong one. (shrink)

This is a very poorly written book. It is highly repetitive and verbose. Moreover, despite the repetition, it is fundamentally unclear—both because of unhelpful and unexplained terminology, and because of its distinctively tangled prose. Here is one example of the latter.

We propose a critique of normativism, defined as the idea that human thinking reflects a normative system against which it should be measured and judged. We analyze the methodological problems associated with normativism, proposing that it invites the controversial “is-ought” inference, much contested in the philosophical literature. This problem is triggered when there are competing normative accounts (the arbitration problem), as empirical evidence can help arbitrate between descriptive theories, but not between normative systems. Drawing on linguistics as a model, we (...) propose that a clear distinction between normative systems and competence theories is essential, arguing that equating them invites an “is-ought” inference: to wit, supporting normative “ought” theories with empirical “is” evidence. We analyze in detail two research programmes with normativist features – Oaksford and Chater’s rational analysis and Stanovich and West’s individual differences approach – demonstrating how, in each case, equating norm and competence leads to an is-ought inference. Normativism triggers a host of research biases in the psychology of reasoning and decision making: focusing on untrained participants and novel problems, analyzing psychological processes in terms of their normative correlates, and neglecting philosophically significant paradigms when they do not supply clear standards for normative judgement. For example, in a dual-process framework, normativism can lead to a fallacious “ought-is” inference, in which normative responses are taken as diagnostic of analytic reasoning. We propose that little can be gained from normativism that cannot be achieved by descriptivist computational-level analysis, illustrating our position with Hypothetical Thinking Theory and the theory of the suppositional conditional. We conclude that descriptivism is a viable option, and that theories of higher mental processing would be better off freed from normative considerations. (shrink)

It seems that the Truth-teller is either true or false, but there is no accepted principle determining which it is. From this point of view, the Truth-teller is a hypodox. A hypodox is a conundrum like a paradox, but consistent. Sometimes, accepting an additional principle will convert a hypodox into a paradox. Conversely, in some cases, retracting or restricting a principle will convert a paradox to a hypodox. This last point suggests a new method of avoiding inconsistency. This article provides (...) a significant example. The Liar paradox can be defused to a hypodox by relatively minimally restricting three principles: the T-schema, substitution of identicals and universal instantiation. These restrictions are not arbitrary. For each, I identify the source of a contradiction given some presumptions. Then I propose each restriction as a reasonable way to deal with that source of contradiction. (shrink)

The Pinocchio paradox, devised by Veronique Eldridge-Smith in February 2001, is a counter-example to solutions to the Liar that restrict the use or definition of semantic predicates. Pinocchio’s nose grows if and only if what he is stating is false, and Pinocchio says ‘My nose is growing’. In this statement, ‘is growing’ has its normal meaning and is not a semantic predicate. If Pinocchio’s nose is growing it is because he is saying something false; otherwise, it is not growing. ‘Because’ (...) stands here for a non-semantic relation; it might be supposed to be causal or of some other nature, but it is not semantic. The paradox is discussed in relation to Tarski’s and Kripke’s theories of truth. Although the paradox is not necessarily a counter-example to a theory of a truth predicate, it is a problem for a theory of truth of the kind preserved by validity. (shrink)

The Liar paradox is an obstacle to a theory of truth, but a Liar sentence need not contain a semantic predicate. The Pinocchio paradox, devised by Veronique Eldridge-Smith, was the first published paradox to show this. Pinocchio’s nose grows if, and only if, what Pinocchio is saying is untrue. What happens if Pinocchio says that his nose is growing? Eldridge-Smith and Eldridge-Smith : 212-5, 2010) posed the Pinocchio paradox against the Tarskian-Kripkean solutions to the Liar paradox that use language hierarchies. (...) Eldridge-Smith : 306-8, 2011) also set the Pinocchio paradox against semantic dialetheic solutions to the Liar. Beall argued the Pinocchio story was just an impossible story. Eldridge-Smith : 749-752, 2012b) responded that unless the T-schema is a necessary truth of some sort, the Pinocchio principle is possible. Luna : 77–86, 2016) argues that the Pinocchio contradiction proves the principle is false. D’Agostini & Ficara discuss a more plausible physical truth-tracking trait, the Blushing Liar, and argue that the Pinocchio contradiction is not a metaphysical dialetheia. I respond to Luna, and D’Agostini & Ficara, and prove that the Pinocchio paradox is a counterexample to hierarchical solutions to the Liar. (shrink)

The concept of hypodox is dual to the concept of paradox. Whereas a paradox is incompatibly overdetermined, a hypodox is underdetermined. Indeed, many particular paradoxes have dual hypodoxes. So, naively the dual of Russell’s Paradox is whether the set of all sets that are members of themselves is self-membered. The dual of the Liar Paradox is the Truth-teller, and a hypodoxical dual of the Heterological paradox is whether ‘autological’ is autological. I provide some analysis of the duality and I search (...) for modal hypodoxes as duals to known paradoxes. I also try to continue this search further by mapping the relations between some paradoxes and hypodoxes in duality squares. This investigation increases the known extension of the concept of hypodox, and the duality relation between paradoxes and hypodoxes assists in finding some of these. (shrink)

The main thesis of this paper is that we sometimes are disposed to accept false and even jointly inconsistent claims by virtue of our semantic competence, and that this comes to light in the sorites and liar paradoxes. Among the subsidiary theses are that this is an important source of indeterminacy in truth conditions, that we must revise basic assumptions about semantic competence, and that classical logic and bivalence can be upheld in the face of the sorites paradox.

A novel normal form for propositional theories underlies the logic pdl, which captures some essential features of natural discourse, independent from any particular subject matter and related only to its referential structure. In particular, pdlallows to distinguish vicious circularity from the innocent one, and to reason in the presence of inconsistency using a minimal number of extraneous assumptions, beyond the classical ones. Several, formally equivalent decision problems are identified as potential applications: non-paradoxical character of discourses, admissibility of arguments in argumentation (...) networks, propositional satisfiability, and the existence of kernels of directed graphs. Directed graphs provide the basis for the semantics of pdl and the paper concludes by an overview of relevant graph-theoretical results and their applications in diagnosing paradoxical character of natural discourses. (shrink)

This paper explores allowing truth value assignments to be undetermined or "partial" and overdetermined or "inconsistent", thus returning to an investigation of the four-valued semantics that I initiated in the sixties. I examine some natural consequence relations and show how they are related to existing logics, including ukasiewicz's three-valued logic, Kleene's three-valued logic, Anderson and Belnap's relevant entailments, Priest's "Logic of Paradox", and the first-degree fragment of the Dunn-McCall system "R-mingle". None of these systems have nested implications, and I investigate (...) twelve natural extensions containing nested implications, all of which can be viewed as coming from natural variations on Kripke's semantics for intuitionistic logic. Many of these logics exist antecedently in the literature, in particular Nelson 's "constructible falsity". (shrink)

Fitch’s paradox shows, from fairly innocent-looking assumptions, that if there are any unknown truths, then there are unknowable truths. This is generally thought to deliver a blow to antirealist positions that imply that all truths are knowable. The present paper argues that a probabilistic version of antirealism escapes Fitch’s result while still offering all that antirealists should care for.

“Form of life” is considered one of the most significant concepts in Wittgenstein's later philosophy. This term is one of his most ambiguous philosophical concepts. This paper tries to explain the specific and fundamental role of “form of life” as a cornerstone for the whole of Wittgenstein's later philosophy; a role that has not attracted much attention in Wittgenstein scholarship. From the author's perspective, describing the form of life as a condition for the possibility of language can put an end (...) to some of the challenges in Wittgenstein's later philosophy such as Behavioralism, being trapped in general linguistic relativity and the reduction of all reality to linguistic principles. This study attempts to prove the fundamental role of this concept by studying Wittgenstein’s later position toward philosophical explanation in general and pictorial theory of language in particular, and by analyzing in detail the concept of form of life in his later works. Finally, the authors will provide a possible fifth path entitled “Phenomenological Interpretation” through a critical analysis of the four existing interpretations on the concept of form of life. (shrink)

(No abstract is available for this citation).

The variety of semantical approaches that have been invented for logic programs is quite broad, drawing on classical and many-valued logic, lattice theory, game theory, and topology. One source of this richness is the inherent non-monotonicity of its negation, something that does not have close parallels with the machinery of other programming paradigms. Nonetheless, much of the work on logic programming semantics seems to exist side by side with similar work done for imperative and functional programming, with relatively minimal contact (...) between communities. In this paper we summarize one variety of approaches to the semantics of logic programs: that based on fixpoint theory. We do not attempt to cover much beyond this single area, which is already remarkably fruitful. We hope readers will see parallels with, and the divergences from the better known fixpoint treatments developed for other programming methodologies. (shrink)

The book offers a proposal on how to define truth in all its complexity, without reductionism, showing at the same time which questions a theory of truth has to answer and which questions, although related to truth, do not belong within the scope of such a theory. Just like any other theory, a theory of truth has its structure and limits. The semantic core of the position is that truth-ascriptions are pro-forms, i.e. natural language propositional variables. The book also offers (...) an explanation of the syntactic behaviour of truth-terms, and the pragmatic roles of truth-acts. The theory of truth we present is a technical proposal, relatively uncontaminated by radical philosophical discussion. It makes indeed philosophical points, but it is intended to be a conceptual analysis, as neutral as possible, of the aspects that may serve as a point of departure for more philosophically-laden destinations. Like the Fregean account of quantifiers, which is prior to and, to a large extent, independent of the metaphysical debate about existence and its forms, or the Kaplanian view on demonstratives, that is neutral regarding the debate about individuals and the possibilities we have to actually “reach” them in a referring act, we intend our proposal about truth to be a sophisticated and explicative setting that helps to situate other debates about truth accurately, far from the distorted and sometimes strongly ideological discussions that have turned the topic into a paradigm of philosophical impasse. (shrink)

This book explores the interplay between logic and science, describing new trends, new issues and potential research developments.

This book is a sustained defense of the compatibility of the presence of idealizations in the sciences and scientific realism. So, the book is essentially a detailed response to the infamous arguments raised by Nancy Cartwright to the effect that idealization and scientific realism are incompatible.