Realism is multiply ambiguous. The central concern of Part 1 of this paper is to distinguish several of its many senses — four (Theoretical Realism, Cumulative Realism, Progressive Realism and Optimistic Realism) in which it refers to theses about the status of scientific theories, and five (Minimal Realism, Ambitious Absolutism, Transcendentalism, Nidealism, Scholastic Realism) in which it refers to theses about the nature of truth or truth-bearers. Because Realism has these several, largely independent, senses, the conventional wisdom that Tarski's theory (...) of truth supports realism, and that the Meaning-Variance thesis undermines it, needs re-evaluation. The concern of the rest of the paper is to sort out in which senses the conventional wisdom, with respect to Tarski's theory (Part 2) and the Meaning-Variance thesis (Part 3), is correct. (shrink)

'Realism' is multiply ambiguous. The central concern of Part 1 of this paper is to distinguish several of its many senses -- four in which it refers to theses about the status of scientific theories, and five in which it refers to theses about the nature of truth or truth-bearers. Because 'Realism' has these several, largely independent, senses, the conventional wisdom that Tarski's theory of truth supports realism, and that the Meaning-Variance thesis undermines it, needs re-evaluation. The concern of the (...) rest of the paper is to sort out in which senses the conventional wisdom, with respect to Tarski's theory and the Meaning-Variance thesis , is correct. (shrink)

I argue that a general logic of definitions must tolerate ω‐inconsistency. I present a semantical scheme, S, under which some definitions imply ω‐inconsistent sets of sentences. I draw attention to attractive features of this scheme, and I argue that S yields the minimal general logic of definitions. I conclude that any acceptable general logic should permit definitions that generate ω‐inconsistency. This conclusion gains support from the application of S to the theory of truth.

According to some philosophers, the Liar paradox arises because of a mistaken theory of truth. Its lesson is that we must reject some instances of the naive propositional truth-schema \It is true that \ if and only if \\. In this paper, I construct a novel semantic paradox in which no principle even analogous to the truth-schema plays any role. I argue that this undermines the claim that we ought to respond to the Liar by revising our theory of truth.

In his seminal work “The Concept of Truth in Formalized Languages”, Alfred Tarski showed how to construct a formally correct and materially adequate definition of true sentence for certain formalized languages. These results have, eventually, been accepted and applauded by philosophers and logicians nearly in unison. Its Postscript, written two years later, however, has given rise to a considerable amount of controversy. There is an ongoing debate on what Tarski really said in the postscript. These discussions often regard Tarski as (...) putatively changing his logical framework from type theory to set theory. In what follows, we will compare the original results with those presented two years later. After a brief outline of Carnap’s program in The Logical Syntax of Language we will determine its significance for Tarski’s final results. (shrink)

Shapiro (Philos Q 61:320–342, 2011) argues that, if we are deflationists about truth, we should be deflationists about logical consequence. Like the truth predicate, he claims, the logical consequence predicate is merely a device of generalisation and more substantial characterisation, e.g. proof- or model-theoretic, is mistaken. I reject his analogy between truth and logical consequence and argue that, by appreciating how the logical consequence predicate is used as well as the goals of proof theory and model theory, we can be (...) deflationists about truth but not logical consequence. (shrink)

Shapiro (Philos Q 61:320–342, 2011) argues that, if we are deflationists about truth, we should be deflationists about logical consequence. Like the truth predicate, he claims, the logical consequence predicate is merely a device of generalisation and more substantial characterisation, e.g. proof- or model-theoretic, is mistaken. I reject his analogy between truth and logical consequence and argue that, by appreciating how the logical consequence predicate is used as well as the goals of proof theory and model theory, we can be (...) deflationists about truth but not logical consequence. (shrink)

To get to grips with what Shapiro does and can say about higher-order vagueness, it is first necessary to thoroughly review and evaluate his conception of (first-order) vagueness, a conception which is both rich and suggestive but, as it turns out, not so easy to stabilise. In Sections I–IV, his basic position on vagueness (see Shapiro [2003]) is outlined and assessed. As we go along, I offer some suggestions for improvement. In Sections V–VI, I review two key paradoxes of higher-order (...) vagueness, while in Section VII, I explore a possible line of response to such paradoxes given by Keefe [2000]. In Section VIII, I assess whether which Shapiro might adapt Keefe's response to combat both paradoxes. (shrink)

This paper investigates the conditions under which diagonal sentences can be taken to constitute paradigmatic cases of self-reference. We put forward well-motivated constraints on the diagonal operator and the coding apparatus which separate paradigmatic self-referential sentences, for instance obtained via Gödel’s diagonalization method, from accidental diagonal sentences. In particular, we show that these constraints successfully exclude refutable Henkin sentences, as constructed by Kreisel.

In this paper we examine various requirements on the formalisation choices under which self-reference can be adequately formalised in arithmetic. In particular, we study self-referential numberings, which immediately provide a strong notion of self-reference even for expressively weak languages. The results of this paper suggest that the question whether truly self-referential reasoning can be formalised in arithmetic is more sensitive to the underlying coding apparatus than usually believed. As a case study, we show how this sensitivity affects the formal study (...) of certain principles of self-referential truth. (shrink)

There is a well-known gap between metamathematical theorems and their philosophical interpretations. Take Tarski’s Theorem. According to its prevalent interpretation, the collection of all arithmetical truths is not arithmetically definable. However, the underlying metamathematical theorem merely establishes the arithmetical undefinability of a set of specific Gödel codes of certain artefactual entities, such as infix strings, which are true in the standard model. That is, as opposed to its philosophical reading, the metamathematical theorem is formulated (and proved) relative to a specific (...) choice of the Gödel numbering and the notation system. A similar observation applies to Gödel’s and Church’s theorems, which are commonly taken to impose severe limitations on what can be proved and computed using the resources of certain formalisms. The philosophical force of these limitative results heavily relies on the belief that these theorems do not depend on contingencies regarding the underlying formalisation choices. The main aim of this paper is to provide metamathematical facts which support this belief. While employing a fixed notation system, I showed in previous work (_Review of Symbolic Logic_, 2021, 14(1):51–84) how to abstract away from the choice of the Gödel numbering. In the present paper, I extend this work by establishing versions of Tarski’s, Gödel’s and Church’s theorems which are invariant regarding _both_ the notation system and the numbering. This paper thus provides a further step towards absolute versions of metamathematical results which do not rely on contingent formalisation choices. (shrink)

Some propositions are true, and it is true that some propositions are true. Each of these facts looks like an impeccable ground of the other. But they cannot both ground each other, since grounding is asymmetric. This paper explores two new diagnoses of this much discussed puzzle. The tools of higher-order logic are used to show how both diagnoses can be fleshed out into strong and consistent theories of grounding. These theories of grounding in turn demand new theories of the (...) granularity of propositions, properties, and relations. Even those who are uninterested in grounding should take seriously these pictures of reality’s logical structure, which are in many ways reminiscent of Russell’s and Wittgenstein’s logical atomism. (shrink)

Is there a key for ‘translating' some set-theoretical paradoxes into counterpart semantical paradoxes and vice-versa? There is, and this encourages the hope of a unified solution. The solution turns not on inventing new axioms that do not entail contradiction, but on imposing a completely intuitive restriction on the comprehension axiom of naive set theory in order to avoid illegitimate (circular) stipulation.

Substructural solutions to the semantic paradoxes have been broadly discussed in recent years. In particular, according to the non-transitive solution, we have to give up the metarule of Cut, whose role is to guarantee that the consequence relation is transitive. This concession—giving up a meta rule—allows us to maintain the entire consequence relation of classical logic. The non-transitive solution has been generalized in recent works into a hierarchy of logics where classicality is maintained at more and more metainferential levels. All (...) the logics in this hierarchy can accommodate a truth predicate, including the logic at the top of the hierarchy—known as CMω—which presumably maintains classicality at all levels. CMω has so far been accounted for exclusively in model-theoretic terms. Therefore, there remains an open question: how do we account for this logic in proof-theoretic terms? Can there be found a proof system that admits each and every classical principle—at all inferential levels—but nevertheless blocks the derivation of the liar? In the present paper, I solve this problem by providing such a proof system and establishing soundness and completeness results. Yet, I also argue that the outcome is philosophically unsatisfactory. In fact, I’m afraid that in light of my results this metainferential solution to the paradoxes can hardly be called a “solution,” let alone a good one. (shrink)

A syntactically correct number-specification may fail to specify any number due to underspecification. For similar reasons, although each sentence in the Yablo sequence is syntactically perfect, none yields a statement with any truth-value. As is true of all members of the Liar family, the sentences in the Yablo sequence are so constructed that the specification of their truth-conditions is vacuous; the Yablo sentences fail to yield statements. The ‘revenge’ problem is easily defused. The solution to the semantical paradoxes offered here (...) revives the mediaeval cassatio approach, one that largely disappeared due to its incomprehending rejection by influential contemporary writers such as William Shyreswood and Thomas Bradwardine. The diagnosis readily extends to the set-theoretic paradoxes. (shrink)

Normative theories can be useful in developing descriptive theories, as when normative subjective expected utility theory is used to develop descriptive rational choice theory and behavioral game theory. “Ought” questions are also the essence of theories of moral reasoning, a domain of higher mental processing that could not survive without normative considerations.

Consideration of a paradox originally discovered by John Buridan provides a springboard for a general solution to paradoxes within the Liar family. The solution rests on a philosophical defence of truth-value-gaps and is consistent (non-dialetheist), avoids ‘revenge’ problems, imports no ad hoc assumptions, is not applicable to only a proper subset of the semantic paradoxes and implies no restriction of the expressive capacities of language.

A common objection to hierarchical approaches to truth is that they fragment the concept of truth. This paper defends hierarchical approaches in general against the objection of fragmentation. It argues that the fragmentation required is familiar and unprob-lematic, via a comparison with mathematical proof. Furthermore, it offers an explanation of the source and nature of the fragmentation of truth. Fragmentation arises because the concept exhibits a kind of failure of closure under reflection. This paper offers a more precise characterization of (...) the reflection involved, first in the setting of formal theories of truth, and then in a more general setting. (shrink)

About twenty-five years ago, Charles Parsons published a paper that began by asking why we still discuss the Liar Paradox. Today, the question seems all the more apt. In the ensuing years we have seen not only Parsons’ work (1974), but seminal work of Saul Kripke (1975), and a huge number of other important papers. Too many to list. Surely, one of them must have solved it! In a way, most of them have. Most papers on the Liar Paradox offer (...) some explanation of the behavior of paradoxical sentences, and most also offer some extension for the predicate ‘true’ that they think is adequate, at least in some restricted setting. But if this is a solution, then the problem we face is far from a lack of solutions; rather, we have an overabundance of conflicting ones. Kripke’s work alone provides us with uncountably many different extensions for the truth predicate. Even if it so happens that one of these is a conclusive solution, we do not seem to know which one, or why. We should also ask, given that we are faced with many technically elegant but contradictory views, if they are really all addressing the same problem. What we lack is not solutions, but a way to compare and evaluate the many ones we have. (shrink)

This paper argues for the thesis that, roughly put, it is impossible to talk about absolutely everything. To put the thesis more precisely, there is a particular sense in which, as a matter of semantics, quantifiers always range over domains that are in principle extensible, and so cannot count as really being ‘absolutely everything’. The paper presents an argument for this thesis, and considers some important objections to the argument and to the formulation of the thesis. The paper also offers (...) an assessment of just how implausible the thesis really is. It argues that the intuitions against the thesis come down to a few special cases, which can be given special treatment. Finally, the paper considers some metaphysical ideas that might surround the thesis. Particularly, it might be maintained that an important variety of realism is incompatible with the thesis. The paper argues that this is not the case. (shrink)

This paper argues for the thesis that, roughly put, it is impossible to talk about absolutely everything. To put the thesis more precisely, there is a particular sense in which, as a matter of semantics, quantifiers always range over domains that are in principle extensible, and so cannot count as really being ‘absolutely everything’. The paper presents an argument for this thesis, and considers some important objections to the argument and to the formulation of the thesis. The paper also offers (...) an assessment of just how implausible the thesis really is. It argues that the intuitions against the thesis come down to a few special cases, which can be given special treatment. Finally, the paper considers some metaphysical ideas that might surround the thesis. Particularly, it might be maintained that an important variety of realism is incompatible with the thesis. The paper argues that this is not the case. (shrink)

This is a collection of eighteen solicited papers on the topics of the title: circularity, definition, and truth. The papers are loosely connected in subject matter, but present a great variety of issues, theories, and approaches. Amongst the many subjects discussed are: the revision theory of truth and applications of revision rules, partiality and fixed point constructions, substitutional quantification, fuzzy logic, negation, belief revision, context dependence, hierarchies, Tarski on truth, deflationism, correspondence theories of truth, and normative aspects of truth. The (...) Liar paradox figures prominently in this collection, but is not alone. Other familiar paradoxes are also discussed, including paradoxes of definability, the Sorites paradox, and the Surprise Exam paradox. So-called paradoxes of rationality, such as the Prisoner’s Dilemma, receive attention as well. (shrink)

This paper presents an approach to truth and the Liar paradox which combines elements of context dependence and hierarchy. This approach is developed formally, using the techniques of model theory in admissible sets. Special attention is paid to showing how starting with some ideas about context drawn from linguistics and philosophy of language, we can see the Liar sentence to be context dependent. Once this context dependence is properly understood, it is argued, a hierarchical structure emerges which is neither ad (...) hoc nor unnatural. (shrink)

An approach to the treatment of inference in the presence of uncertain truth values is described, based on representing uncertainties by sets of ordinary (certain) truth values. Both the algebraic and the logical aspects are studied for a variety of lattices used as truth value spaces in the domain of many-valued logic.

We may suppose that the truth predicate that we utilize in our semantic metalanguage is a two-place predicate relating sentences to contexts, the truth-in-context-X predicate. Seeming paradoxes pertaining to the truth-in-context-X predicate can be blocked by placing restrictions on the structure of contexts. While contexts must specify a domain of contexts, and what a context constant denotes relative to a context must be a context in the context domain of that context, no context may belong to its own context domain. (...) A generalization of that restriction appears to block all of the paradoxes of truth-in-context-X. This restriction entails that, in a certain sense, we cannot talk about the context we are in. This result will be defended, up to a point, on broadly ontological grounds. It will also be conjectured that our semantic metalanguage can be regarded as semantically closed. (shrink)

A number of philosophers have argued that the key to understanding the semantic paradoxes is to recognize that truth is essentially relative to context. All of these philosophers have been motivated by the idea that once a liar sentence has been uttered we can 'step back' and, from the point of view of a different context, judge that the liar sentence is true. This paper argues that this 'stepping back' idea is a mistake that results from failing to relativize truth (...) to context in the first place. Moreover, context-relative liar sentences, such as 'This sentence is not true in any context' present a paradox even after truth has been relativized to context. Nonetheless, the relativization of truth to context may offer us the means to avoid paradox, if we can justifiably deny that a sentence about a context can be true in the very context it is about. (shrink)

ABSTRACT In the paper we present a survey of some approaches to the semantics of many-valued propositional systems. These approaches are inspired on one hand by classical problems in the investigations of logical aspects of epistemic activity: knowledge and truth, contradictions, beliefs, reliability of data, etc. On the other hand they reflect contemporary concerns of researchers in Artificial Intelligence (and Cognitive Science in general) with inferences drawn from imperfect information, even from total ignorance. We treat the mathematical apparatus that has (...) emerged recently: algebraic structures related to the new logical systems in the same way Boolean algebras correspond to classical logic. (shrink)

This paper motivates and defends alethic nihilism, the theory that nothing is true. I first argue that alethic paradoxes like the Liar and Curry motivate nihilism; I then defend the view from objections. The critical discussion has two primary outcomes. First, a proof of concept. Alethic nihilism strikes many as silly or obviously false, even incoherent. I argue that it is in fact well-motivated and internally coherent. Second, I argue that deflationists about truth ought to be nihilists. Deflationists maintain that (...) the utility of the truth predicate is exhausted by its expressive role, and I argue that the truth predicate can still play this expressive role even if nothing is true. As such, deflationists do not stand to lose anything by accepting nihilism. Since they also stand to gain an elegant solution to the alethic paradoxes, on balance deflationists ought to be nihilists. (shrink)

El excepcionalismo de la lógica asume que la lógica tiene un estatus epistemológico privilegiado, es normativa y no es revisable. El antiexcepcionalismo, en cambio, rechaza ese carácter excepcional. Recientemente, se ha sugerido que el problema de la adopción de reglas lógicas es transversal a la discusión que se da entre excepcionalistas y antiexcepcionalistas. En este trabajo defiendo la tesis contraria. En particular, sostengo que, si el problema de la adopción de reglas es un problema central para la lógica como disciplina, (...) el antiexcepcionalismo debe ser incorrecto. En caso contrario, debe ser incorrecta la postura excepcionalista. Evalúo, además, consecuencias directas del análisis presente sobre la discusión en torno al monismo y el pluralismo de la lógica. (shrink)

This paper presents a range of new triviality proofs pertaining to naïve truth theory formulated in paraconsistent relevant logics. It is shown that excluded middle together with various permutation principles such as A → (B → C)⊩B → (A → C) trivialize naïve truth theory. The paper also provides some new triviality proofs which utilize the axioms ((A → B)∧ (B → C)) → (A → C) and (A → ¬A) → ¬A, the fusion connective and the Ackermann constant. An (...) overview over various ways to formulate Leibniz’s law in non-classical logics and two new triviality proofs for naïve set theory are also provided. (shrink)

The present paper suggests relative truth definability as a tool for comparing conceptual aspects of axiomatic theories of truth and gives an overview of recent developments of axiomatic theories of truth in the light of it. We also show several new proof-theoretic results via relative truth definability including a complete answer to the conjecture raised by Feferman in [13].

This paper studies several systems of the transfinite iteration and autonomous progression of self-applicable truth and determines their proof-theoretic strength.

It is shown that two formally consistent type-free second-order systems, due to Cocchiarella, and based on the notion of homogeneous stratification, are subject to a contingent version of Russell's paradox.

In this paper we develop what we can describe as a “dual two-sided” cut-free sequent calculus system for the non-classical logics of truth lp, k3, stt and a non-reflexive logic ts which is, arguably, more elegant than the three-sided sequent calculus developed by Ripley for the same logics. Its elegance stems from how it employs more or less the standard sequent calculus rules for the various connectives and truth, and the fact that it offers a rather neat connection between derivable (...) sequents and validity in comparison to the calculus developed by Ripley. (shrink)

Against the backdrop of the frequent comparison of theories of truth in the literature on semantic paradoxes with regard to which inferences and metainferences are deemed valid, this paper develops a novel approach to defining a binary predicate for representing the valid inferences and metainferences of a theory within the theory itself under the assumption that the theory is defined with a classical meta-theory. The aim with the approach is to obtain a tool which facilitates the comparison between a theory (...) and its competitors within the theory itself, thereby expressing the disagreement between the theories within the theories. After discussing what we can and should require of an object-linguistic representation of a theory for that purpose, this paper proposes to restrict the representation of valid metainferences to locally valid metainferences, a requirement which turns out to be \-consistent and conservative over classical first-order arithmetic. This approach is then applied to four theories definable on strong Kleene models using a labelled nested sequent calculus. (shrink)

This paper continues my work of [9], which showed there was a broad family of many valued logics that have a strict/tolerant counterpart. Here we consider a generalization of weak Kleene three valued logic, instead of the strong version that was background for that earlier work. We explain the intuition behind that generalization, then determine a subclass of strict/tolerant structures in which a generalization of weak Kleene logic produces the same results that the strong Kleene generalization did. This paper provides (...) much background, but is not self-contained. Some results from [9] are called on, and are not reproved here. [9] Melvin C. Fitting. “A Family of Strict/Tolerant Logics”. In: Journal of Philosophical Logic. Online. Print publication forthcoming. (shrink)

We introduce a subclass of Kripke's fixed points in which falsehood is the preferred truth value. In all of these the truthteller evaluates to false, while the liar evaluates to undefined (or overdefined). The mathematical structure of this family of fixed points is investigated and is shown to have many nice features. It is noted that a similar class of fixed points, preferring truth, can also be studied. The notion of intrinsic is shown to relativize to these two subclasses. The (...) mathematical ideas presented here originated in investigations of so-called stable models in the semantics of logic programming. (shrink)

While Kripke's original paper on the theory of truth used a three-valued logic, we believe a four-valued version is more natural. Its use allows for possible inconsistencies in information about the world, yet contains Kripke's development within it. Moreover, using a four-valued logic makes it possible to work with complete lattices rather than complete semi-lattices, and thus the mathematics is somewhat simplified. But more strikingly, the four-valued version has a wide, natural generalization to the family of interlaced bilattices. Thus, with (...) little more work, the theory is extended to a broad class of settings. Indeed, a result like Theorem 6.2 would not even be possible to state without the interlaced bilattice machinery. We hope the notion of interlaced bilattice will make apparent further such connections. (shrink)