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)

Is the set of all self-membered sets, S, a member of itself? In naive set theory, this is Russell’s hypodox. By the Laws of Excluded Middle and Non-contradiction, S is a member of itself xor it is not, but no principle of classical logic or naive set theory determines which. (Herein, ‘xor’ extends English with a specifically exclusive disjunction.) As a hypodox, the Truth-teller is a sentence that says of itself simply that it is true; by the above (...) mentioned principles, the Truth-teller is true xor not true, but no principle of classical logic or naive truth determines which. Many concepts that have paradoxes have related hypodoxes, although the focus here is on these two. I argue that the Truth-teller does not rely on a principle of truth, in particular it does not rely on the T-schema. I also argue that Russell’s hypodox does not rely on Comprehension. Yet I relate Russell’s paradox and hypodox based on involution functions. The Liar and the Truth-teller are also related by means of involutions. Relations based on these involution functions can be represented in duality squares. Although hypodoxes are not paradoxes, these involution functions and duality relations warrant some commonality in a correct solution to a paradox and its dual hypodox. Using this and some other premises, I provide novel arguments supporting non-classical solutions for the Liar paradox and the significance of Russell’s hypodox for solutions to Russell’s paradox. (shrink)

Most paradoxes of self-reference have a dual or ‘hypodox’. The Liar paradox (Lr = ‘Lr is false’) has the Truth-Teller (Tt = ‘Tt is true’). Russell’s paradox, which involves the set of sets that are not self-membered, has a dual involving the set of sets which are self-membered, etc. It is widely believed that these duals are not paradoxical or at least not as paradoxical as the paradoxes of which they are duals. In this paper, I argue that (...) some paradox’s duals or hypodoxes are as paradoxical as the paradoxes of which they are duals, and that they raise neglected and interestingly different problems. I first focus on Richard’s paradox (arguably the simplest case of a paradoxical dual), showing both that its dual is as paradoxical as Richard’s paradox itself, and that the classical, Richard-Poincaré solution to the latter does not generalize to the former in any obvious way. I then argue that my argument applies mutatis mutandis to other paradoxes of self-reference as well, the dual of the Liar (the Truth-Teller) proving paradoxical. (shrink)

I distinguish paradoxes and hypodoxes among the conundrums of time travel. I introduce ‘hypodoxes’ as a term for seemingly consistent conundrums that seem to be related to various paradoxes, as the Truth-teller is related to the Liar. In this article, I briefly compare paradoxes and hypodoxes of time travel with Liar paradoxes and Truth-teller hypodoxes. I also discuss Lewis’ treatment of time travel paradoxes, which I characterise as a Laissez Faire theory of time travel. Time travel paradoxes are (...) impossible according to Laissez Faire theories, while it seems hypodoxes are possible. (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 semantic paradoxes are often associated with self-reference or referential circularity. Yablo (Analysis 53(4):251–252, 1993), however, has shown that there are infinitary versions of the paradoxes that do not involve this form of circularity. It remains an open question what relations of reference between collections of sentences afford the structure necessary for paradoxicality. In this essay, we lay the groundwork for a general investigation into the nature of reference structures that support the semantic paradoxes and the semantic hypodoxes. We develop (...) a functionally complete infinitary propositional language endowed with a denotation assignment and extract the reference structural information in terms of graph-theoretic properties. We introduce the new concepts of dangerous and precarious reference graphs, which allows us to rigorously define the task: classify the dangerous and precarious directed graphs purely in terms of their graph-theoretic properties. Ungroundedness will be shown to fully characterize the precarious reference graphs and fully characterize the dangerous finite graphs. We prove that an undirected graph has a dangerous orientation if and only if it contains a cycle, providing some support for the traditional idea that cyclic structure is required for paradoxicality. This leaves the task of classifying danger for infinite acyclic reference graphs. We provide some compactness results, which give further necessary conditions on danger in infinite graphs, which in conjunction with a notion of self-containment allows us to prove that dangerous acyclic graphs must have infinitely many vertices with infinite out-degree. But a full characterization of danger remains an open question. In the appendices we relate our results to the results given in Cook (J Symb Log 69(3):767–774, 2004) and Yablo (2006) with respect to more restricted sentences systems, which we call $\mathcal{F}$ -systems. (shrink)

A historically popular response to the liar paradox (“this sentence is false”) is to say that the liar sentence is meaningless (or semantically defective, or malfunctions, or…). Unfortunately, like all other supposed solutions to the liar, this approach faces a revenge challenge. Consider the revenge liar sentence, “this sentence is either meaningless or false”. If it is true, then it is either meaningless or false, so not true. And if it is not true, then it can’t (...) be either meaningless or false, so it must be true. Either way, we are back in a paradox. This paper provides a detailed and exhaustive discussion of the options for responding to revenge on behalf of “meaningless” theories. Though I attempt to discuss all of the options fairly, I will ultimately opt for one specific response and discuss some of its challenges. Various technical and logical matters will be discussed throughout the paper, but my focus will be philosophical, throughout. My overall conclusion is that the “meaningless” strategy is at least as well off in the face of revenge as any other approach to the liar and related paradoxes. (shrink)

In this paper we concentrate on the nature of the liar paradox asa cognitive entity; a consistently testable configuration of properties. We elaborate further on a quantum mechanical model (Aerts, Broekaert and Smets, 1999) that has been proposed to analyze the dynamics involved, and we focus on the interpretation and concomitant philosophical picture. Some conclusions we draw from our model favor an effective realistic interpretation of cognitive reality.

Bringing together powerful new tools from set theory and the philosophy of language, this book proposes a solution to one of the few unresolved paradoxes from antiquity, the Paradox of the Liar. Treating truth as a property of propositions, not sentences, the authors model two distinct conceptions of propositions: one based on the standard notion used by Bertrand Russell, among others, and the other based on J.L. Austin's work on truth. Comparing these two accounts, the authors show that while (...) the Russellian conception of the relation between sentences, propositions, and truth is crucially flawed in limiting cases, the Austinian perspective has fruitful applications to the analysis of semantic paradox. In the course of their study of a language admitting circular reference and containing its own truth predicate, Barwise and Etchemendy also develop a wide range of model-theoretic techniques--based on a new set-theoretic tool, Peter Aczel's theory of hypersets--that open up new avenues in logical and formal semantics. (shrink)

Some in the recent literature have claimed that a connection exists between the Liar paradox and _semantic relativism_: the view that the truth values of certain occurrences of sentences depend on the contexts at which they are assessed. Sagi (Erkenntnis 82(4):913–928, 2017) argues that contextualist accounts of the Liar paradox are committed to relativism, and Rudnicki and Łukowski (Synthese 1–20, 2019) propose a new account that they classify as relativist. I argue that a full understanding of how relativism (...) is conceived within theories of natural language shows that neither of the purported connections can be maintained. There is no reason why a solution to the Liar paradox needs to accept relativism. (shrink)

The purpose of this note is to present a strong form of the liar paradox. It is strong because the logical resources needed to generate the paradox are weak, in each of two senses. First, few expressive resources required: conjunction, negation, and identity. In particular, this form of the liar does not need to make any use of the conditional. Second, few inferential resources are required. These are: (i) conjunction introduction; (ii) substitution of identicals; and (iii) the inference: (...) From ¬(p ∧ p), infer ¬ p. It is, interestingly enough, also essential to the argument that the ‘strong’ form of the diagonal lemma be used: the one that delivers a term λ such that we can prove: λ = ¬ T(⌈λ⌉); rather than just a sentence Λ for which we can prove: Λ ≡ ¬T(⌈Λ⌉). The truth-theoretic principles used to generate the paradox are these: ¬(S ∧ T(⌈¬S⌉); and ¬(¬S ∧ ¬T(⌈¬S⌉). These are classically equivalent to the two directions of the T-scheme, but they are intuitively weaker. The lesson I would like to draw is: There can be no consistent solution to the Liar paradox that does not involve abandoning truth-theoretic principles that should be every bit as dear to our hearts as the T-scheme. So we shall have to learn to live with the Liar, one way or another. (shrink)

A semantic solution to the liar paradox (“This statement is not true”) is presented in this article. Since the liar paradox seems to evince a contradiction, the principle of non-contradiction is preliminarily discussed, in order to determine whether dismissing this principle may be reason enough to stop considering the liar paradox a problem. No conclusive outcome with respect to the value of this principle is aspired to here, so that the inquiry is not concluded at this point (...) and the option to explore an alternative, semantic, solution remains open. This proposed solution is focused on what the liar paradox expresses and what it fails to express. (shrink)

It is often said that in a purely formal perspective, intuitionistic logic has no obvious advantage to deal with the liar-type paradoxes. In this paper, we will argue that the standard intuitionistic natural deduction systems are vulnerable to the liar-type paradoxes in the sense that the acceptance of the liar-type sentences results in inference to absurdity (⊥). The result shows that the restriction of the Double Negation Elimination (DNE) fails to block the inference to ⊥. It is, (...) however, not the problem of the intuitionistic approaches to the liar-type paradoxes but the lack of expressive power of the standard intuitionistic natural deduction system. We introduce a meta-level negation for a given system and a meta-level absurdity, ⋏, to the intuitionistic system. We shall show that in the system, the inference to ⊥ is not given without the assumption that the system is complete. Moreover, we consider the Double Meta-Level Negation Elimination rules (DMNE) which implicitly assume the completeness of the system. Then, the restriction of DMNE can rule out the inference to ⊥. (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)

This article shows that there is a liar-like paradox that arises for rational credence that relies only on very weak logical and credal principles. The paradox depends on a weak rational reflection principle, logical principles governing conjunction, and principles governing the relationship between rational credence and proof. To respond to this paradox, we must either reject even very weak rational reflection principles or reject some highly plausible logical or credal principle.

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 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. 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 can be constructed. Yaqub concludes by introducing a logic of truth that further demonstrates the adequacy of the revision theory. (shrink)

This paper describes the ways in which trolls and bots impede the acquisition of knowledge online. I distinguish between three ways in which trolls and bots can impede knowledge acquisition, namely, by deceiving, by encouraging misplaced skepticism, and by interfering with the acquisition of warrant concerning persons and content encountered online. I argue that these threats are difficult to resist simultaneously. I argue, further, that the threat that trolls and bots pose to knowledge acquisition goes beyond the mere threat of (...) online misinformation, or the more familiar threat posed by liars offline. Trolls and bots are, in effect, fake persons. Consequently, trolls and bots can systemically interfere with knowledge acquisition by manipulating the signals whereby individuals acquire knowledge from one another online. I conclude with a brief discussion of some possible remedies for the problem of fake persons. (shrink)

The Liar Paradox is an argument that arrives at a contradiction by reasoning about a Liar Sentence. The classical Liar Sentence is the self-referential sentence “This sentence is false.”.

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)

Contextualist approaches to the Liar Paradox postulate the occurrence of a context shift in the course of the Liar reasoning. In particular, according to the contextualist proposal advanced by Charles Parsons and Michael Glanzberg, the Liar sentence L doesn’t express a true proposition in the initial context of reasoning c, but expresses a true one in a new, richer context c', where more propositions are available for expression. On the further assumption that Liar sentences involve propositional (...) quantifiers whose domains may vary with context, the Liar reasoning is blocked. But why should context shift? We argue that the paradox involves principles of contextualist reflection that explain, by analogy with well-known reflection principles for arithmetic, why context must shift from c to c' in the course of the Liar reasoning. This provides a diagnosis of the Liar Paradox—one that equally applies to two revenge arguments against contextualist approaches, one recently advanced by Andrew Bacon, the other mentioned by Charles Parsons and more recently revived by Cory Juhl. (shrink)

Most discussions frame the Liar Paradox as a formal logical-linguistic puzzle. Attempts to resolve the paradox have focused very little so far on aspects of cognitive psychology and processing, because semantic and cognitive-psychological issues are generally assumed to be disjunct. I provide a motivation and carry out a cognitive-computational treatment of the liar paradox based on a model of language and conceptual knowledge within the Predictive Processing framework. I suggest that the paradox arises as a failure of synchronization (...) between two ways of generating the liar situation in two different PP sub-models, one corresponding to language processing and the other to the processing of meaning and world-knowledge. In this way, I put forward the claim that the liar sentence is meaningless but has an air of meaningfulness. I address the possible objection that the proposal violates the Principle of Unrestricted Compositionality, which purportedly regulates the conceptual competence of thinkers. (shrink)

A relativized version of Tarski's T-scheme is introduced as a new principle of the truth predicate. Under the relativized T-scheme, the paradoxical objects, such as the Liar sentence and Jourdain's card sequence, are found to have certain relative contradictoriness. That is, they are contradictory only in some frames in the sense that any valuation admissible for them in these frames will lead to a contradiction. It is proved that for any positive integer n, the n-jump liar sentence is (...) contradictory in and only in those frames containing at least an n-jump odd cycle. In particular, the Liar sentence is contradictory in and only in those frames containing at least an odd cycle. The Liar sentence is also proved to be less contradictory than Jourdain's card sequence: the latter must be contradictory in those frames where the former is so, but not vice versa. Generally, the relative contradictoriness is the common characteristic of the paradoxical objects, but different paradoxical objects may have different relative contradictoriness. (shrink)

We have good reason to condemn lying more strongly than misleading and to condemn bullshit assertion less harshly than lying but more harshly than misleading. We each have good reason to mislead rather than make bullshit assertions, but to make bullshit assertions rather than lie. This is because these forms of deception damage credibility in different ways. We can trust the misleader to assert only what they believe to be true. We can trust the bullshitter not to assert what they (...) believe to be false. We cannot trust the liar at all. (shrink)

Semantic pathology is most widely recognized in the liar paradox, where an apparent inconsistency arises in ‘‘liar sentences’’ and their ilk. But the phenomenon of semantic pathology also manifests a sibling symptom—an apparent indeterminacy—which, while not largely discussed (save for the occasional nod to ‘‘truthteller sentences’’), is just as pervasive as, and exactly parallels, the symptom of inconsistency. Moreover, certain ‘‘dual symptom’’ cases, which we call naysayers, exhibit both inconsistency and indeterminacy and also manifest a higher-order indeterminacy between (...) them. In this paper, we explore and lay out the full, broader extent of semantic pathology. We then turn to the best-known attempts to diagnose and treat the phenomenon: consistentist approaches, proposed by Alfred Tarski and Saul Kripke, and an inconsistentist approach, originally presented by Graham Priest and dubbed ‘‘dialetheism’’. We explain the basic elements of each view and argue that each fails to provide an adequate way of dealing with the full extent of semantic pathology. We conclude that a new kind of approach is required and briefly sketch the pretense-based view that we favor. (shrink)

We define a liar-type paradox as a consistent proposition in propositional modal logic which is obtained by attaching boxes to several subformulas of an inconsistent proposition in classical propositional logic, and show several famous paradoxes are liar-type. Then we show that we can generate a liar-type paradox from any inconsistent proposition in classical propositional logic and that undecidable sentences in arithmetic can be obtained from the existence of a liar-type paradox. We extend these results to predicate (...) logic and discuss Yablo’s Paradox in this framework. Furthermore, we define explicit and implicit self-reference in paradoxes in the incompleteness phenomena. (shrink)

We argue that it would seem to be a mistake to blame Liar-like paradox on certain features of the object language, since the effect can be created with very minimal object languages that contain none of the usual suspects (truth-like predicates, reference to their own truth-bearers, negation, etc.).

In their (2008) article Liar-Like Paradox and Object Language Features C.S. Jenkins and Daniel Nolan (henceforth, JN) argue that it is possible to construct Liar-like paradox in a metalanguage even though its object language is not semantically closed. I do not take issue with this claim. I find fault though with the following points contained in JN’s article: First, that it is possible to construct Liar-like paradox in a metalanguage, even though this metalanguage is not semantically closed. (...) Second, that the presented examples of Liar-like paradox are supposed to be counterexamples to Tarski’s diagnosis of the classic Liar paradox. Third, that JN fail to notice Tarski’s postulate. And finally, that JN fail to recognize that the world they are pondering is not among the possible worlds. (shrink)

Here I present a new objection to the material or "hook" analysis of indicative conditionals - the thesis that an indicative conditional 'If A then C' has the truth-conditions of the so-called material conditional - based on Liar-like reasoning. This objection seems invulnerable to any Grice-Lewis-Jackson-inspired pragmatic rejoinder.

This article examines the various Liar paradoxes and their near kin, Grelling’s paradox and Gödel’s Incompleteness Theorem with its self-referential Gödel sentence. It finds the family of paradoxes to be generated by circular definition–whether of statements, predicates, or sentences–a manoeuvre that generates pseudo-statements afflicted with the Liar syndrome: semantic vacuity, semantic incoherence, and predicative catalepsy. Such statements, e.g., the self-referential Liar statement, are meaningless, and hence fail to say anything, a point that invalidates the reasoning on which (...) the various paradoxes rest. The seeming plausibility of the paradoxes is due to the fact that often the sentence used to make the pseudo-statement is ambiguous in that it may also be used to make a genuine statement about the pseudo-statement. Hence, if a formal system is to avoid ambiguity and consequent paradox and contradiction, it must distinguish between the two statements the sentence may be used to make. Gödel’s Theorem presents a further complication in that the self-reference involved is sentential rather than statemental. Nevertheless, on the intended interpretation of the system as a formalization of arithmetic, the self-referential Gödel sentence can only be an ambiguous statement, one that is both a pseudo-statement and its genuine double. Consequently, the conclusions commonly drawn from Gödel’s theorem must be deemed unwarranted. Arithmetic might well be formalized in a proper system that either excludes circular definition or introduces disambiguators. (shrink)

Semantic and soritical paradoxes challenge entrenched, fundamental principles about language - principles about truth, denotation, quantification, and, among others, 'tolerance'. Study of the paradoxes helps us determine which logical principles are correct. So it is that they serve not only as a topic of philosophical inquiry but also as a constraint on such inquiry: they often dictate the semantic and logical limits of discourse in general. Sixteen specially written essays by leading figures in the field offer new thoughts and arguments (...) about the paradoxes. (shrink)

My aim in this paper is to amend the Stalnakerian view of context in such a way that it can allow for an adequate treatment of a contextualist position regarding the Liar Paradox. I discuss Glanzberg’s contextualism and the reason why his position cannot be encompassed by the Stalnakerian view, as it is normally construed. Finally, I introduce the phenomenon I call “semantic dissonance”, followed by a mechanism accommodating the Stalnakerian view to the demands of Glanzberg’s contextualism.

Here is the liar paradox. We have a sentence, (L), which somehow says of itself that it is false. Suppose (L) is true. Then things are as (L) says they are. (For it would appear to be a mere platitude that if a sentence is true, then things are as the sentence says they are.) (L) says that (L) is false. So, (L) is false. Since the supposition that (L) is true leads to contradiction, we can assert that (L) (...) is false. But since this is just what (L) says, (L) is then true. (For it would appear to be a mere platitude that if things are as a given sentence says they are, the sentence is true.) So (L) is true. So (L) is both true and false. Contradiction. (shrink)

The Liar Paradox is a philosophical bogyman. It refuses to die, despite everything that philosophers have done to kill it. Sometimes the attacks on it seem little more than expressions of positivist petulance, as when the Liar sentence is said to be nonsense or meaningless. Sometimes the attacks are based on administering to the Liar sentence arbitrary if not unfair tests for admitting of truth or falsity that seem designed expressly to keep it from qualifying. Some philosophers (...) have despaired of ever beating the Liar; so concerned have they been about the threat posed by the Liar that they have introduced legislation to exclude the Liar sentence and anything like it. (shrink)

ABSTRACTTwo rival scholars from Shiraz in Persia, Dawānī and Dashtakī engaged in a bitter and extended dispute over a range of metaphysical and logical issues. One of these was the liar paradox. Their debate on this point marked the most extensive scrutiny of the paradox in Arabic until that time. Dashtakī’s solution was to deny that the statement ‘What I say is false’ is true or false, on the ground that there is one statement and one application of the (...) falsity predicate. Given that – ex hypothesi – there is no other statement, there is no basis for a reiteration of the truth or falsity predicate and describing the statement itself as true or false. Dawānī’s solution was to deny that ‘What I say is false’ is a statement at all, and he argued that it is instead akin to a performative utterance such as ‘I hereby sell you this’. (shrink)

Most discussions frame the Liar Paradox as a formal logical-linguistic puzzle. Attempts to resolve the paradox have focused very little so far on aspects of cognitive psychology and processing, because semantic and cognitive-psychological issues are generally assumed to be disjunct. I provide a motivation and carry out a cognitive-computational treatment of the liar paradox based on a cognitive-computational model of language and conceptual knowledge within the Predictive Processing framework. I suggest that the paradox arises as a failure of (...) synchronization between two ways of generating the liar situation in two different PP sub-models, one corresponding to language processing and the other to the processing of meaning and world-knowledge. In this way, I put forward the claim that the liar sentence is meaningless but has an air of meaningfulness. I address the possible objection that the proposal violates the Principle of Unrestricted Compositionality, which purportedly regulates the conceptual competence of thinkers. (shrink)

The Liar paradox raises foundational questions about logic, language, and truth (and semantic notions in general). A simple Liar sentence like 'This sentence is false' appears to be both true and false if it is either true or false. For if the sentence is true, then what it says is the case; but what it says is that it is false, hence it must be false. On the other hand, if the statement is false, then it is true, (...) since it says (only) that it is false. -/- How, then, should we classify Liar sentences? Are they true or false? A natural suggestion would be that Liars are neither true nor false; that is, they fall into a category beyond truth and falsity. This solution might resolve the initial problem, but it beckons the Liar's revenge. A sentence that says of itself only that it is false or beyond truth and falsity will, in effect, bring back the initial problem. The Liar's revenge is a witness to the hydra-like nature of Liars: in dealing with one Liar you often bring about another. -/- JC Beall presents fourteen new essays and an extensive introduction, which examine the nature of the Liar paradox and its resistance to any attempt to solve it. Written by some of the world's leading experts in the field, the papers in this volume will be an important resource for those working in truth studies, philosophical logic, and philosophy of language, as well as those with an interest in formal semantics and metaphysics. (shrink)

Most discussions frame the Liar Paradox as a formal logical-linguistic puzzle. Attempts to resolve the paradox have focused very little so far on aspects of cognitive psychology and processing, because semantic and cognitive-psychological issues are generally assumed to be disjunct. I provide a motivation and carry out a cognitive-computational treatment of the liar paradox based on a model of language and conceptual knowledge within thePredictive Processing(PP) framework. I suggest that the paradox arises as a failure of synchronization between (...) two ways of generating the liar situation in two different (idealized) PP sub-models, one corresponding to language processing and the other to the processing of meaning and world-knowledge. In this way, I put forward the claim that the liar sentence is meaningless but has an air of meaningfulness. I address the possible objection that the proposal violates thePrinciple of Unrestricted Compositionality, which purportedly regulates the conceptual competence of thinkers. (shrink)

This article is about self-referential arguments that are akin to the paradox of the liar. They make reference to their own validity, invalidity, soundness, unsoundness, or to the truth or falsity of their own premises or conclusions. Several very puzzling examples of such arguments are considered and their paradoxicality is defended against objections.

First, language and axioms of Church's paper 'Comparison of Russell's Resolution of the Semantical Antinomies with that of Tarski' are slightly modified and a version of the Liar paradox tentatively reconstructed. An obvious natural solution of the paradox leads to a hierarchy of truth predicates which is of a different kind from the one defined by Church: it depends on the enlargement of the semantical vocabulary and its levels do not differ in the ramified-type-theoretical sense. Second, two attempts are (...) made in order to justify the Russellian, and perhaps Churchian, idea that language should not be fragmented beyond what is required by type distinctions. After all, because of reducibility, which seems to allow a semantics without propositions, this comes out to be possible only at the cost of resorting to two disputable theses. (shrink)

The Liar paradox arises when we consider a sentence that says of itself that it is not true. If such self-referential sentences exist? and examples like?This sentence is not true? certainly suggest this?, then our logic and standard notion of truth allow to infer a contradiction: The Liar sentence is true and not true. What has gone wrong? Must we revise our notion of truth and our logic? Or can we dispel the common conviction that there are such (...) self-referential sentences? The present study explores the second path.0After comparing the Liar reasoning in formal and informal logic and showing that there are no Gödelian Liar sentences, the study moves on from the semantics of self-reference to the metaphysics of expressions and proposes a novel solution to the Liar paradox: Meaningful expressions are distinct from their syntactic bases and exist only relative to contexts. Detailed semantico-metaphysical arguments show that in this dynamic setting, an object can be referred to only after it has started to exist. Hence the circular reference needed in the Liar paradox cannot occur, after all. As this solution is contextualist, it evades the expressibility problems of other proposals. (shrink)

John Barker, in two recent essays, raises a variety of intriguing criticisms to challenge my interpretation of the liar paradox and the type of solution I proposein ‘Denying the Liar’ and ‘Denying the Liar Reaffirmed.’ Barker continues to believe that I have misunderstood the logical structure of the liar sentence and itsexpression, and that as a result my solution misfires. I shall try to show that on the contrary my analysis is correct, and that Barker does (...) not properly grasp what mysolution to the liar paradox involves. Additionally, I argue that Barker makes fundamental errors in the explanation of liar sentence formulations in intensional contexts and in the classical metatheory he invokes to support his criticisms. (shrink)

Kripke’s theory of truth succeeded in providing a trivalent semantics for a language that contains its own truth predicate and means of self-reference; but it did so by radically restricting the expressive power of the logic. In Kripke’s analysis, the Liar (e.g. This very sentence is not true) receives the indeterminate truth value; but the logic cannot express the fact that the Liar is something other than true: in order to do so, a weak negation not* would be (...) needed, but it would also make the logic inconsistent (because the ‘Super Liar’ This very sentence is not* true could not be assigned any truth value). Taking a hint from the quantificational form of the problematic sentences (… is something other than true), we define a hierarchy of negations which each quantifies over a domain of truth values, assimilated to ordinals. The resulting logic has as many negations and truth values as there are ordinals. Unlike Kripke’s logic, it enjoys a form of expressive completeness. And although the logic is not monotonic, we show that under broad conditions we can construct a variety of fixed points; one of them emulates Kripke’s ‘least fixed point’, while another one assigns a different truth value to each Super Liar. (shrink)

Can one extend crisp Peano arithmetic PA by a possibly many-valued predicate Tr(x) saying "x is true" and satisfying the "dequotation schema" $\varphi \equiv \text{Tr}(\bar{\varphi})$ for all sentences φ? This problem is investigated in the frame of Lukasiewicz infinitely valued logic.

If knowledge is the norm of practical reasoning, then we should be able to alter people's behavior by affecting their knowledge as well as by affecting their beliefs. Thus, as Roy Sorensen (2010) suggests, we should expect to find people telling lies that target knowledge rather than just lies that target beliefs. In this paper, however, I argue that Sorensen's discovery of “knowledge-lies” does not support the claim that knowledge is the norm of practical reasoning. First, I use a Bayesian (...) framework to show that in each of Sorensen's examples, knowledge-lies alter people's behavior by affecting their beliefs. Second, I show that while we can imagine lies that target knowledge without targeting beliefs, they cannot alter people's behavior. In other words, knowledge-lies actually work (i.e., manipulate behavior) by targeting beliefs or they do not work at all. (shrink)

The standard reliabilist line on defeat is open to counterexamples regarding its necessity and sufficiency. In this paper, I present three problems for the standard reliabilist line from the recent literature on defeat before arguing that reliabilists can solve those problems by adopting an account of justification that ties defeat to the evidence possessed by the relevant agent. In doing so, I show that there is a conception of having evidence that reliabilists can adopt without giving up on the core (...) commitments of their research program, namely the reduction of epistemic facts and having a psychologically realistic account of justification. My account of defeat draws on the account of propositional justification, transglobal evidentialism, defended by David Henderson, Terry Horgan, and Matjaž Potrč. (shrink)