This paper explores the liar paradox and its implications for logic and philosophical reasoning. It analyzes the paradox using classical logic principles and paraphrases it as "affirmation of the falsity of the very affirmation." The study draws connections between the liar paradox and Hegel's speculative sentence and suggests it functions as a "quasi-speculative sentence." Additionally, it examines parallels with the logocentric predicament and the determinist's assertion, highlighting their paradoxical nature. Through these analyses, the paper aims (...) to illuminate the fundamental paradoxes in our reasoning and logic. (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)

Al-Taftāzānī introduces the Liar Paradox, in a commentary on al-Rāzī, in a short passage that is part of a polemic against the ethical rationalism of the Muʿtazila. In this essay, we consider his remarks and their place in the history of the Liar Paradox in Arabic Logic. In the passage, al-Taftāzānī introduces Liar Cycles into the tradition, gives the paradox a puzzling name—the fallacy of the “irrational root” —which became standard, and suggests a connection (...) between the paradox and what it tells us about truth and falsehood, and arguments for divine voluntarism and what they tell us about the nature of goodness and badness. On this last point, we also discuss a passage from al-Rāzī, which suggests similar connections. (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)

The liar paradox is still an open philosophical problem. Most contemporary answers to the paradox target the logical principles underlying the reasoning from the liar sentence to the paradoxical conclusion that the liar sentence is both true and false. In contrast to these answers, Buddhist epistemology offers resources to devise a distinctively epistemological approach to the liar paradox. In this paper, I mobilise these resources and argue that the liar sentence is what (...) Buddhist epistemologists call a contradiction with one’s own words. I situate my argument in the works of Dignāga and Dharmakīrti and show how Buddhist epistemology answers the paradox. (shrink)

The present paper investigates whether strictly classical inferences contribute to the formalization of (genuine) paradoxes within natural deduction. Tennant's criterion for paradoxicality relies on the generation of an infinite reduction sequence, which distinguishes genuine paradoxes from mere inconsistencies. His methodological conjecture posits that genuine paradoxes are never strictly classical and can be derived without classical inferences such as the Law of Excluded Middle, Dilemma, Classical Reductio, and Double Negation Elimination. -/- It appears that there were two reasons for Tennant's proposal (...) of the methodological conjecture. The one is that strictly classical inferences hinder the generation of an infinite reduction sequence and the other is that strictly classical inferences have no role in the formalization of genuine paradoxes. -/- This paper raises questions about these two reasons. Focusing on the liar paradox, it will be argued that strictly classical inferences do not interfere with the generation of an infinite reduction sequence and that the liar sentence may implicitly entail strictly classical inferences. Should this analysis hold, it would call into question not only Tennant’s motivation for advancing the methodological conjecture, but also challenge his contention that genuine paradoxes—exemplified by the liar paradox—are never constructed with reliance on strictly classical inferences. (shrink)

One recently proposed solution to the Liar paradox is the contextual theory of truth. Tyler Burge (1979) argues that truth is an indexical notion and that the extension of the truth predicate shifts during Liar reasoning. A Liar sentence might be true in one context and false in another. To many, contextualism seems to capture our pre-theoretic intuitions about the semantic paradoxes; this is especially due to its reliance on the so-called Revenge phenomenon. I, however, show (...) that Super-Liar sentences (where a Super-Liar sentence is a sentence which says of itself that it is not true in any context) generate a significant problem for Burge’s contextual theory of truth. (shrink)

A reply to two responses to an earlier paper, "A Liar Paradox".

Confronting the Liar Paradox is commonly viewed as a prerequisite for developing a theory of truth. In this paper I turn the tables on this traditional conception of the relation between the two. The theorist of truth need not constrain his search for a “material” theory of truth, i.e., a theory of the philosophical nature of truth, by committing himself to one solution or another to the Liar Paradox. If he focuses on the nature of truth (...) (leaving issues of formal consistency for a later stage), he can arrive at material principles that prevent the Liar Paradox from arising in the first place. I argue for this point both on general methodological grounds and by example. The example is based on a substantivist theory of truth that emphasizes the role of truth in human cognition. The key point is that truth requires a certain complementarity of “immanence” and “transcendence”, and this means that some hierarchical structure is inherent in truth. Approaching the Liar Paradox from this perspective throws new light on its existent solutions: their differences and commonalities, their purported ad-hocness, and the relevance of natural language and bivalence to truth and the Liar. (shrink)

This paper decomposes the Liar Paradox into its semantic atoms using Meaning Postulates (1952) provided by Rudolf Carnap. Formalizing truth values of propositions as Boolean properties of these propositions is a key new insight. This new insight divides the translation of a declarative sentence into its equivalent mathematical proposition into three separate steps. When each of these steps are separately examined the logical error of the Liar Paradox is unequivocally shown.

It seems that the most common strategy to solve the liar paradox is to argue that liar sentences are meaningless and, consequently, truth-valueless. The other main option that has grown in recent years is the dialetheist view that treats liar sentences as meaningful, truth-apt and true. In this paper I will offer a new approach that does not belong in either camp. I hope to show that liar sentences can be interpreted as meaningful, truth-apt and (...) false, but without engendering any contradiction. This seemingly impossible task can be accomplished once the semantic structure of the liar sentence is unpacked by a quantified analysis. The paper will be divided in two sections. In the first section, I present the independent reasons that motivate the quantificational strategy and how it works in the liar sentence. In the second section, I explain how this quantificational analysis allows us to explain the truth teller sentence and a counter-example advanced against truthmaker maximalism, and deal with some potential objections. (shrink)

We describe the earliest occurrences of the Liar Paradox in the Arabic tradition. e early Mutakallimūn claim the Liar Sentence is both true and false; they also associate the Liar with problems concerning plural subjects, which is somewhat puzzling. Abharī (1200-1265) ascribes an unsatisfiable truth condition to the Liar Sentence—as he puts it, its being true is the conjunction of its being true and false—and so concludes that the sentence is not true. Tūsī (1201-1274) argues (...) that self-referential sentences, like the Liar, are not truth-apt, and defends this claim by appealing to a correspondence theory of truth. Translations of the texts are provided as an appendix. (shrink)

I have read many recent discussions of the limits of computation and the universe as computer, hoping to find some comments on the amazing work of polymath physicist and decision theorist David Wolpert but have not found a single citation and so I present this very brief summary. Wolpert proved some stunning impossibility or incompleteness theorems (1992 to 2008-see arxiv.org) on the limits to inference (computation) that are so general they are independent of the device doing the computation, and even (...) independent of the laws of physics, so they apply across computers, physics, and human behavior. They make use of Cantor's diagonalization, the liar paradox and worldlines to provide what may be the ultimate theorem in Turing Machine Theory, and seemingly provide insights into impossibility,incompleteness, the limits of computation,and the universe as computer, in all possible universes and all beings or mechanisms, generating, among other things,a non-quantum mechanical uncertainty principle and a proof of monotheism. (shrink)

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)

Section 1 reviews Strawson’s logic of presuppositions. Strawson’s justification is critiqued and a new justification proposed. Section 2 extends the logic of presuppositions to cases when the subject class is necessarily empty, such as (x)((Px & ~Px) → Qx) . The strong similarity of the resulting logic with Richard Diaz’s truth-relevant logic is pointed out. Section 3 further extends the logic of presuppositions to sentences with many variables, and a certain valuation is proposed. It is noted that, given this valuation, (...) Gödel’s sentence becomes neither true nor false. The similarity of this outcome with Goldstein and Gaifman’s solution of the Liar paradox, which is discussed in section 4, is emphasized. Section 5 returns to the definition of meaningfulness; the meaninglessness of certain sentences with empty subjects and of the Liar sentence is discussed. The objective of this paper is to show how all of the above-mentioned concepts are interrelated. (shrink)

The truth-functional hypothesis states that indicative conditional sentences and the material implication have the same truth conditions. Haze (2011) has rejected this hypothesis. He claims that a self-referential conditional, coupled with a plausible assumption about its truth-values and the assumption that the truth-functional hypothesis is true, lead to a liar’s paradox. Given that neither the self-referential conditional nor the assumption about its truth-values are problematic, the culprit of the paradox must be the truth-functional hypothesis. Therefore, we should (...) reject it. In this paper I argue that, contrary to what Haze thinks, the truth-functional hypothesis is not to blame. In fact, no liar’s paradox emerges when the truth-functional hypothesis is true; it emerges only if it is false. (shrink)

I have read many recent discussions of the limits of computation and the universe as computer, hoping to find some comments on the amazing work of polymath physicist and decision theorist David Wolpert but have not found a single citation and so I present this very brief summary. Wolpert proved some stunning impossibility or incompleteness theorems (1992 to 2008-see arxiv dot org) on the limits to inference (computation) that are so general they are independent of the device doing the computation, (...) and even independent of the laws of physics, so they apply across computers, physics, and human behavior. They make use of Cantor's diagonalization, the liar paradox and worldlines to provide what may be the ultimate theorem in Turing Machine Theory, and seemingly provide insights into impossibility, incompleteness, the limits of computation, and the universe as computer, in all possible universes and all beings or mechanisms, generating, among other things, a non- quantum mechanical uncertainty principle and a proof of monotheism. There are obvious connections to the classic work of Chaitin, Solomonoff, Komolgarov and Wittgenstein and to the notion that no program (and thus no device) can generate a sequence (or device) with greater complexity than it possesses. One might say this body of work implies atheism since there cannot be any entity more complex than the physical universe and from the Wittgensteinian viewpoint, ‘more complex’ is meaningless (has no conditions of satisfaction, i.e., truth-maker or test). Even a ‘God’ (i.e., a ‘device’with limitless time/space and energy) cannot determine whether a given ‘number’ is ‘random’, nor find a certain way to show that a given ‘formula’, ‘theorem’ or ‘sentence’ or ‘device’ (all these being complex language games) is part of a particular ‘system’. -/- Those wishing a comprehensive up to date framework for human behavior from the modern two systems view may consult my book ‘The Logical Structure of Philosophy, Psychology, Mind and Language in Ludwig Wittgenstein and John Searle’ 2nd ed (2019). Those interested in more of my writings may see ‘Talking Monkeys--Philosophy, Psychology, Science, Religion and Politics on a Doomed Planet--Articles and Reviews 2006-2019 2nd ed (2019) and Suicidal Utopian Delusions in the 21st Century 4th ed (2019) . (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.

我最近读过许多关于计算极限和宇宙作为计算机的讨论,希望找到一些关于多面体物理学家和决策理论家大卫·沃尔珀特的惊人工作的评论,但没有发现一个引文,所以我提出这个非常简短的总结。Wolpert 证明了一些惊人的不可能或不完整的定理(1992-2008-见arxiv dot org)对推理(计算)的限制,这些极限非常一般,它们独立于执行计算的设备,甚至独立于物理定律,因此,它们适用于计算机、物理和人类行为。他们利用Cantor的对角线、骗子悖论和世界线来提供图灵机器理论的 终极定理,并似乎提供了对不可能、不完整、计算极限和宇宙的见解。计算机,在所有可能的宇宙和所有生物或机制,产生,除其他外,非量子力学不确定性原理和一神论的证明。与柴廷、所罗门诺夫、科莫尔加罗夫和维特根斯 坦的经典作品以及任何程序(因此没有设备)能够生成比它拥有的更大复杂性的序列(或设备)的概念有着明显的联系。有人可能会说,这一工作意味着无政府主义,因为没有比物质宇宙更复杂的实体,从维特根斯坦的观点来看 ,"更复杂的"是毫无意义的(没有满足的条件,即真理制造者或测试)。即使是"上帝"(即具有无限时间/空间和能量的"设备")也无法确定给定的&q uot;数字"是否为"随机",也无法找到某种方式来显示给定的"公式"、"定理"或"句子"或"设备&q uot;(所有这些语言都是复杂的语言)游戏)是特定"系统"的一部分。 那些希望从现代两个系统的观点来看为人类行为建立一个全面的最新框架的人,可以查阅我的书《路德维希的哲学、心理学、Mind 和语言的逻辑结构》维特根斯坦和约翰·西尔的《第二部》(2019年)。那些对我更多的作品感兴趣的人可能会看到《会说话的猴子——一个末日星球上的哲学、心理学、科学、宗教和政治——文章和评论2006-201 9年第二次(2019年)》和《自杀乌托邦幻想》第21篇世纪4日 (2019).

In this paper, we do two things. First, we provide some support for adopting a version of the meaningless strategy with respect to the liar paradox, and, second, we extend that strategy, by providing, albeit tentatively, a solution to that paradox—one that is semantic, rather than logical.

ABSTRACT: This chapter offers a revenge-free solution to the liar paradox (at the centre of which is the notion of Gestalt shift) and presents a formal representation of truth in, or for, a natural language like English, which proposes to show both why -- and how -- truth is coherent and how it appears to be incoherent, while preserving classical logic and most principles that some philosophers have taken to be central to the concept of truth and our (...) use of that notion. The chapter argues that, by using a truth operator rather than truth predicate, it is possible to provide a coherent, model-theoretic representation of truth with various desirable features. After investigating what features of liar sentences are responsible for their paradoxicality, the chapter identifies the logic as the normal modal logic KT4M (= S4M). Drawing on the structure of KT4M (=S4M), the author proposes that, pace deflationism, truth has content, that the content of truth is bivalence, and that the notions of both truth and bivalence are semideterminable. (shrink)

This is the original English version of a paper that has been published only in Chinese translation. (For the published, Chinese version, see "透視悖論說謊者的幽默指南", in page 37-44 on 拒絕再Hea──真理與意義的追尋) The paper was originally written as a lecture given at the University of Macau in April 2010. The paper argues that humor is essentially a form of paradoxical deception.

Neil Tennant was the first to propose a proof-theoretic criterion for paradoxicality, a framework in which a paradox, formalized through natural deduction, is derived from an unacceptable conclusion that employs a certain form of id est inferences and generates an infinite reduction sequence. Tennant hypothesized that any derivation in natural deduction that formalizes a genuine paradox would meet this criterion, and he argued that while the liar paradox is genuine, Russell's paradox is not. -/- The (...) present paper delves into Tennant's conjecture for genuine paradoxes and suggests that to validate the conjecture, one of two issues must be addressed. The first issue is the need for a philosophical consensus on the identification of a genuine paradox in an informal sense. The second issue is the requirement for a uniform approach to formalize paradoxes in natural deduction. If either of these issues is addressed, the conjecture could be validated, or at the very least, it could hold philosophical importance in delineating the proof-theoretic features of paradoxicality. (shrink)

In his article, Vsevolod Ladov poses an important question – might paradoxes admit of a uniform solution? As an answer, I propose looking at an approach in which it is argued that we must recognize the truth predicate as merely analogous to a vague predicate. The proponents of this approach (V. McGee, J. Tappenden, H. Field, G. Priest and D. Hyde) insist that there is a structural relation between sorites paradoxes and self-reference paradoxes and that they should have a unified (...) solution. (shrink)

One well known approach to the soritical paradoxes is epistemicism, the view that propositions involving vague notions have definite truth values, though it is impossible in principle to know what they are. Recently, Paul Horwich has extended this approach to the liar paradox, arguing that the liar proposition has a truth value, though it is impossible to know which one it is. The main virtue of the epistemicist approach is that it need not reject classical logic, and (...) in particular the unrestricted acceptance of the principle of bivalence and law of excluded middle. Regardless of its success in solving the soritical paradoxes, the epistemicist approach faces a number of independent objections when it is applied to the liar paradox. I argue that the approach does not offer a satisfying, stable response to the paradoxes—not in general, and not for a minimalist about truth like Horwich. (shrink)

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)

This paper gives a definition of self-reference on the basis of the dependence relation given by Leitgeb (2005), and the dependence digraph by Beringer & Schindler (2015). Unlike the usual discussion about self-reference of paradoxes centering around Yablo's paradox and its variants, I focus on the paradoxes of finitary characteristic, which are given again by use of Leitgeb's dependence relation. They are called 'locally finite paradoxes', satisfying that any sentence in these paradoxes can depend on finitely many sentences. I (...) prove that all locally finite paradoxes are self-referential in the sense that there is a directed cycle in their dependence digraphs. This paper also studies the 'circularity dependence' of paradoxes, which was introduced by Hsiung (2014). I prove that the locally finite paradoxes have circularity dependence in the sense that they are paradoxical only in the digraph containing a proper cycle. The proofs of the two results are based directly on König's infinity lemma. In contrast, this paper also shows that Yablo's paradox and its nested variant are non-self-referential, and neither McGee's paradox nor the omega-cycle liar paradox has circularity dependence. (shrink)

Pluralists maintain that there is more than one truth property in virtue of which bearers are true. Unfortunately, it is not yet clear how they diagnose the liar paradox or what resources they have available to treat it. This chapter considers one recent attempt by Cotnoir (2013b) to treat the Liar. It argues that pluralists should reject the version of pluralism that Cotnoir assumes, discourse pluralism, in favor of a more naturalized approach to truth predication in real (...) languages, which should be a desideratum on any successful pluralist conception. Appealing to determination pluralism instead, which focuses on truth properties, it then proposes an alternative treatment to the Liar that shows liar sentences to be undecidable. (shrink)

By pooling together exhaustive analyses of certain philosophical paradoxes, we can prove a series of fascinating results regarding philosophical progress, agreement on substantive philosophical claims, knockdown arguments in philosophy, the wisdom of philosophical belief, the epistemic status of metaphysics, and the power of philosophy to refute common sense. As examples, this Element examines the Sorites Paradox, the Liar Paradox, and the Problem of the Many – although many other paradoxes can do the trick too.

Stephen Barker presents a novel approach to solving semantic paradoxes, including the Liar and its variants and Curry’s paradox. His approach is based around the concept of alethic undecidability. His approach, if successful, renders futile all attempts to assign semantic properties to the paradoxical sentences, whilst leaving classical logic fully intact. And, according to Barker, even the T-scheme remains valid, for validity is not undermined by undecidable instances. Barker’s approach is innovative and worthy of further consideration, particularly by (...) those of us who aim to find a solution without logical revisionism. As it stands, however, the approach is unsuccessful, as I shall demonstrate below. (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)

Paradoxes and their Resolutions is a ‘thematic compilation’ by Avi Sion. It collects in one volume the essays that he has written in the past (over a period of some 27 years) on this subject. It comprises expositions and resolutions of many (though not all) ancient and modern paradoxes, including: the Protagoras-Euathlus paradox (Athens, 5th Cent. BCE), the Liar paradox and the Sorites paradox (both attributed to Eubulides of Miletus, 4th Cent. BCE), Russell’s paradox (UK, (...) 1901) and its derivatives the Barber paradox and the Master Catalogue paradox (also by Russell), Grelling’s paradox (Germany, 1908), Hempel's paradox of confirmation (USA, 1940s), and Goodman’s paradox of prediction (USA, 1955). This volume also presents and comments on some of the antinomic discourse found in some Buddhist texts (namely, in Nagarjuna, India, 2nd Cent. CE; and in the Diamond Sutra, date unknown, but probably in an early century CE). (shrink)

This paper offers an analysis of a hitherto neglected text on insoluble propositions dating from the late XiVth century and puts it into perspective within the context of the contemporary debate concerning semantic paradoxes. The author of the text is the italian logician Peter of Mantua (d. 1399/1400). The treatise is relevant both from a theoretical and from a historical standpoint. By appealing to a distinction between two senses in which propositions are said to be true, it offers an unusual (...) solution to the paradox, but in a traditional spirit that contrasts a number of trends prevailing in the XiVth century. It also counts as a remarkable piece of evidence for the reconstruction of the reception of English logic in italy, as it is inspired by the views of John Wyclif. Three approaches addressing the Liar paradox (Albert of Saxony, William Heytesbury and a version of strong restrictionism) are first criticised by Peter of Mantua, before he presents his own alternative solution. The latter seems to have a prima facie intuitive justification, but is in fact acceptable only on a very restricted understanding, since its generalisation is subject to the so-called revenge problem. (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)

In a series of articles, Dan Lopez De Sa and Elia Zardini argue that several theorists have recently employed instances of paradoxical reasoning, while failing to see its problematic nature because it does not immediately (or obviously) yield inconsistency. In contrast, Lopez De Sa and Zardini claim that resultant inconsistency is not a necessary condition for paradoxicality. It is our contention that, even given their broader understanding of paradox, their arguments fail to undermine the instances of reasoning they attack, (...) either because they fail to see everything that is at work in that reasoning, or because they misunderstand what it is that the reasoning aims to show. (shrink)

This is one of those "fun" examples of a semantic paradox, written for undergraduates.

According to Aristotle if a universal proposition (for example: “All men are white”) is true, its contrary proposition (“All men are not white”) must be false; and, according to Aristotle, if a universal proposition (for example: “All men are white”) is true, its contradictory proposition (“Not all men are white”) must be false. I agree with what Aristotle wrote about universal propositions, but there are universal propositions which have no contrary proposition and have no contradictory proposition. The proposition X “All (...) the propositions that contradict this proposition are true” does not have the contrary proposition and does not have the contradictory proposition. In fact: FEX “All the propositions that contradict this proposition are not true” has a different subject: the subject of the proposition X is constituted by all the propositions that contradict the proposition X; by contrast, the subject of the proposition FEX is constituted by all the propositions that contradict the proposition FEX. And FOX “Not all the propositions that contradict this proposition are true” has a different subject: the subject of the proposition X is constituted by the propositions that contradict the proposition X; by contrast, the subject of the proposition FOX is constituted by the propositions that contradict the proposition FOX. According to Aristotle, a singular proposition (in his example: "Socrates is white") which is true must have its negative proposition ("Socrates is not white") which is false. I agree with Aristotle, but there are singular propositions which do not have the corresponding negative proposition. The proposition (or, rather, the pseudo-proposition) L “This same statement is not true” does not have the negative proposition because the proposition FNL “This same statement is true” has a different subject from the subject of the proposition L: the subject of the proposition L is the proposition L; by contrast, the subject of the proposition FNL is the proposition FNL. L and FNL cannot have the same subject. By contrast, the proposition M “This mount is entirely in Swiss territory” and the proposition NM “This mount is not entirely in Swiss territory” can have the same subject (for example, the Mount Eiger): in case the subject of the proposition M and the subject of the proposition NM is the same, M and NM are opposite propositions, NM is the negative proposition of M. By contrast, the proposition (or, rather, the pseudo-proposition) L "This same statement is not true" cannot have the corresponding negative proposition because FNL "This same statement is true" has a different subject: the subject of L is L ; by contrast, the subject of FNL is FNL. Then the paper continues by analyzing some variants of the liar’s paradox: L1 “The statement L1 is not true”; the so-called liar cycle; and the so-called Yablo’s paradox. (shrink)

According to Emma Borg, minimalism is (roughly) the view that natural language sentences have truth conditions, and that these truth conditions are fully determined by syntactic structure and lexical content. A principal motivation for her brand of minimalism is that it coheres well with the popular view that semantic competence is underpinned by the cognition of a minimal semantic theory. In this paper, I argue that the liar paradox presents a serious problem for this principal motivation. Two lines (...) of response to the problem are discussed, and difficulties facing those responses are raised. I close by issuing a challenge: to construe the principal motivation for BM in such a way so as to avoid the problem of paradox. (shrink)

The article critically examines the heuristic capacity and methods of using separate tools of Wittgenstein’s philosophical grammar to treat various semantic pathologies (paradoxes of Liar, Truth-Teller, etc.). According to Wittgenstein, philosophical confusion associated with the analysis of such semantic pathologies arises on the grounds of our intuitive faith that we are able to express in language any property that interests us. For instance, we believe that the property “to have a length of exactly one metre” can be meaningfully attributed (...) to any extended object. However, such a faith is fundamentally wrong, since an object like a standard metre, which plays an exclusive role as the criterion of length in our measuring practices based on the metric system, is an example of an extended object about which one can say neither that it is one metre long, nor that it is not one metre long. A correct understanding of the language-game concept shows that the criterion by which we form a set of objects that meet the standards established by the criterion cannot be described in the same way as objects of this set. Language-games using predicates of truth and falsehood are similar to our practice of measuring length using the metric system. In cases of Liar and Truth-Teller sentences, we encounter resembling examples of philosophical confusion. Beyond the context of their usage, “This sentence is false” and “This sentence is true” sentences seem to us paradoxes. But, according to Wittgenstein’s philosophical grammar, a correct method of treating such “paradoxical” sentences demands to find the lack- ing context for their usage, i.e. pay attention to the language-game in which they are emplloyed. Like in the case of the standard metre, we can claim that the sentence “This sentence is false” (“This sentence is true”) is neither false (true), nor not false (true). In an analogous way, Liar and Truth-Teller sentences should be interpreted as peculiar standards of falsehood and truth that we use in our language-games to judge about the truth value of other sentences. (shrink)

This article informally presents a solution to the paradoxes of truth and shows how the solution solves classical paradoxes (such as the original Liar) as well as the paradoxes that were invented as counterarguments for various proposed solutions (“the revenge of the Liar”). This solution complements the classical procedure of determining the truth values of sentences by its own failure and, when the procedure fails, through an appropriate semantic shift allows us to express the failure in a classical (...) two-valued language. Formally speaking, the solution is a language with one meaning of symbols and two valuations of the truth values of sentences. The primary valuation is a classical valuation that is partial in the presence of the truth predicate. It enables us to determine the classical truth value of a sentence or leads to the failure of that determination. The language with the primary valuation is precisely the largest intrinsic fixed point of the strong Kleene three-valued semantics (LIFPSK3). The semantic shift that allows us to express the failure of the primary valuation is precisely the classical closure of LIFPSK3: it extends LIFPSK3 to a classical language in parts where LIFPSK3 is undetermined. Thus, this article provides an argumentation, which has not been present in contemporary debates so far, for the choice of LIFPSK3 and its classical closure as the right model for the truth predicate. In the end, an erroneous critique of Kripke-Feferman axiomatic theory of truth, which is present in contemporary literature, is pointed out. (shrink)

$${{{\mathcal {F}}}}$$ -systems are useful digraphs to model sentences that predicate the falsity of other sentences. Paradoxes like the Liar and the one of Yablo can be analyzed with that tool to find graph-theoretic patterns. In this paper we studied this general model consisting of a set of sentences and the binary relation ‘ $$\ldots $$ affirms the falsity of $$\ldots $$ ’ among them. The possible existence of non-referential sentences was also considered. To model the sets of all (...) the sentences that can jointly be valued as true we introduced the notion of conglomerate, the existence of which guarantees the absence of paradox. Conglomerates also enabled us to characterize referential contradictions, i.e., sentences that can only be false under a classical valuation due to the interactions with other sentences in the model. A Kripke-style fixed-point characterization of groundedness was offered, and complete (meaning that every sentence is deemed either true or false) and consistent (meaning that no sentence is deemed true and false) fixed points were put in correspondence with conglomerates. Furthermore, argumentation frameworks are special cases of $$\mathcal{F}$$ -systems. We showed the relation between local conglomerates and admissible sets of arguments and argued about the usefulness of the concept for the argumentation theory. (shrink)

Given any proposition, is it possible to have rationally acceptable attitudes towards it? Absent reasons to the contrary, one would probably think that this should be possible. In this paper I provide a reason to the contrary. There is a proposition such that, if one has any opinions about it at all, one will have a rationally unacceptable set of propositional attitudes—or if one doesn’t, one will end up being cognitively imperfect in some other manner. The proposition I am concerned (...) with is a self-referential propositional attitude ascription involving the propositional attitude of rejection. Given a basic assumption about what constitutes irrationality, and a few assumptions about the nature of cognitively ideal agents, a paradox results. This paradox is superficially like the Liar, but it is importantly different in that no alethic notions are involved at all. As such, it stands independent of the Liar and is not a ‘revenge’ version of it. After setting out the paradox I discuss possible responses. After considering several I argue that one is best off simply accepting that the paradox shows us something surprising and interesting about rationality: that some cognitive shortfall is unavoidable even for ideal agents. I argue that nothing disastrous follows from accepting this conclusion. (shrink)

In this paper, I start by describing and examining the main results about the option of formalizing the Yablo Paradox in arithmetic. As it is known, although it is natural to assume that there is a right representation of that paradox in first order arithmetic, there are some technical results that give rise to doubts about this possibility. Then, I present some arguments that have challenged that Yablo’s construction is non-circular. Just like that, Priest (1997) has argued that (...) such formalization shows that Yablo’s Paradox involves implicit circularity. In the same direction, Beall (2001) has introduced epistemic factors in this discussion. Even more, Priest has also argued that the introduction of infinitary reasoning would be of little help. Finally, one could reject definitions of circularity in term of fixed-point adopting non-well-founded set theory. Then, one could hold that the Yablo paradox and the Liar paradox share the same non-well-founded structure. So, if the latter is circular, the first is too. In all such cases, I survey Cook’s approach (2006, forthcoming) on those arguments for the charge of circularity. In the end, I present my position and summarize the discussion involved in this volume. En este artículo, describo y examino los principales resultados vinculados a la formalización de la paradoja de Yablo en la aritmética. Aunque es natural suponer que hay una representación correcta de la paradoja en la aritmética de primer orden, hay algunos resultados técnicos que hacen surgir dudas acerca de esta posibilidad. Más aún, presento algunos argumentos que han cuestionado que la construcción de Yablo no sea circular. Así, Priest (1997) ha argumentado que la formalización de la paradoja de Yablo en la aritmética de primer orden muestra que la misma involucra implícitamente circularidad. En la misma dirección, Beall (2001) ha introducido factores epistémicos en esta discusión. Más aún, Priest ha también argumentado que la introducción de razonamiento infinitario como complemento de la formalización en la aritmética sería de poca ayuda. Finalmente, se podría rechazar todo intento de dar definiciones de circularidad en términos de puntos fijos adoptando teoría de conjuntos infundados. Entonces, se podría sostener que la paradoja de Yablo y la del mentiroso comparten la misma estructura infundada. Por eso, si la última es circular, también lo es la primera. En todos los casos, presento el enfoque de Roy Cook (2006, en prensa) sobre estos argumentos que atribuyen circularidad a la construcción de Yablo. En el final, presento mi posición y un breve resumen de la discusión involucrada en este volumen. (shrink)

Most work on the semantic paradoxes within classical logic has centered around what this essay calls “linguistic” accounts of the paradoxes: they attribute to sentences or utterances of sentences some property that is supposed to explain their paradoxical or nonparadoxical status. “No proposition” views are paradigm examples of linguistic theories, although practically all accounts of the paradoxes subscribe to some kind of linguistic theory. This essay shows that linguistic accounts of the paradoxes endorsing classical logic are subject to a particularly (...) acute form of the revenge paradox: that there is no exhaustive classification of sentences into “good” and “bad” such that the T-schema holds when restricted to the “good” sentences unless it is also possible to prove some “bad” sentences. The foundations for an alternative classical nonlinguistic approach is outlined that is not subject to the same kinds of problems. Although revenge paradoxes of different strengths can be formulated, they are found to be indeterminate at higher orders and not inconsistent. (shrink)

Two semantic paradoxes, the Liar and Curry’s paradox, are analysed using a newly developed conception of procedural semantics (semantics according to which the truth of propositions is determined algorithmically), whose main characteristic is its departure from methodological realism. Rather than determining pre-existing facts, procedures are constitutive of them. Of this semantics, two versions are considered: closed (where the halting of procedures is presumed) and open (without this presumption). To this end, a procedural approach to deductive reasoning is developed, (...) based on the idea of simulation. As is shown, closed semantics supports classical logic, but cannot in any straightforward way accommodate the concept of truth. In open semantics, where paradoxical propositions naturally ‘belong’, they cease to be paradoxical; yet, it is concluded that the natural choice—for logicians and common people alike—is to stick to closed semantics, pragmatically circumventing problematic utterances. (shrink)

I use the principle of truth-maker maximalism to provide a new solution to the semantic paradoxes. According to the solution, AUS, its undecidable whether paradoxical sentences are grounded or ungrounded. From this it follows that their alethic status is undecidable. We cannot assert, in principle, whether paradoxical sentences are true, false, either true or false, neither true nor false, both true and false, and so on. AUS involves no ad hoc modification of logic, denial of the T-schema's validity, or obvious (...) revenge. (shrink)

A number of `no-proposition' approaches to the liar paradox find themselves implicitly committed to a moderate disquotational principle: the principle that if an utterance of the sentence `$P$' says anything at all, it says that $P$ (with suitable restrictions). I show that this principle alone is responsible for the revenge paradoxes that plague this view. I instead propose a view in which there are several closely related language-world relations playing the `semantic expressing' role, none of which is more (...) central to semantic theorizing than any other. I use this thesis about language and the negative result about disquotation to motivate the view that people do say things with utterances of paradoxical sentences, although they do not say the proposition you'd always expect, as articulated with a disquotational principle. (shrink)

The article makes an analysis of a paraconsistent solution to the liar paradox, namely, Priest’s solution. Paraconsistent logics are characterized, in opposition to classical logic, as rejecting the Principle of Explosion, which says that “from a contradiction everything follows”. Priest, in turn, is a dialetheist, an interpretation of paraconsistency that admits the truth of contradictions. His answer to the liar paradox, therefore, accepts the liar sentence as being a truly paradoxical sentence using LP, the “Logic (...) of Paradox. Then, we propose some critiques of his position. Finally, we evaluate Priest’s solution to the paradox in comparison with Tarski and Kripke canonical solutions. (shrink)

The Common Paradox Resolution Argument presents a systematic approach to addressing some of philosophy’s most enduring paradoxes. By analyzing the logical structure and underlying assumptions of each paradox, this argument proposes unique resolutions that aim to preserve logical consistency while clarifying apparent contradictions. The argument covers well-known paradoxes, including the Liar’s Paradox, the Self-Reference Paradox, and the Complete Knowledge Paradox, among others, each of which is dissected and reinterpreted to reveal insights into language, truth, (...) and self-reference. -/- This approach leverages newly developed logical fallacies—such as the Arbitrary Restriction Fallacy and the Self-Reference Paradox Fallacy—created specifically to address the nuances within these paradoxes. The argument contends that by identifying and naming these fallacies, it becomes possible to resolve paradoxical scenarios by revealing flaws in their foundational premises. Ultimately, the Common Paradox Resolution Argument provides a robust framework for interpreting and resolving paradoxes, contributing to a clearer understanding of logical structures and enhancing philosophical discourse on fundamental questions of truth and self-consistency. (shrink)

Lewis Carroll, both logician and writer, suggested a logical paradox containing furthermore two connotations (connotations or metaphors are inherent in literature rather than in mathematics or logics). The paradox itself refers to implication demonstrating that an intermediate implication can be always inserted in an implication therefore postponing its ultimate conclusion for the next step and those insertions can be iteratively and indefinitely added ad lib, as if ad infinitum. Both connotations clear up links due to the shared formal (...) structure with other well-known mathematical observations: (1) the paradox of Achilles and the Turtle; (2) the transitivity of the relation of equality. Analogically to (1), one can juxtapose the paradox of the Liar (for Lewis Carroll’s paradox) and that of the arrow (for “Achilles and the Turtle”), i.e. a logical paradox, on the one hand, and an aporia of motion, on the other hand, suggesting a shared formal structure of both, which can be called “ontological”, on which basis “motion” studied by physics and “conclusion” studied by logic can be unified being able to bridge logic and physics philosophically in a Hegelian manner: even more, the bridge can be continued to mathematics in virtue of (2), which forces the equality (for its property of transitivity) of any two quantities to be postponed analogically ad lib and ad infinitum. The paper shows that Hilbert arithmetic underlies naturally Lewis Carroll’s paradox admitting at least three interpretations linked to each other by it: mathematical, physical and logical. Thus, it can be considered as both generalization and solution of his paradox therefore naturally unifying the completeness of quantum mechanics (i.e. the absence of hidden variables) and eventual completeness of mathematics as the same and isomorphic to the completeness of propositional logic in relation to set theory as a first-order logic (in the sense of Gödel (1930)’s completeness theorems). (shrink)