At some step in proving the Liar Paradox in natural language, a sentence is derived that seems overdetermined with respect to its semantic value. This is complemented by Tarski’s Theorem that a formal language cannot consistently contain a naive truth predicate given the laws of logic used in proving the Liar paradox. I argue that proofs of the Eubulidean Liar either use a principle of truth with non-canonical names in a fallacious way or make a fallacious use of substitution of (...) identicals. Tarski never committed the first fallacy and may have himself considered it fallacious. Nevertheless, I clarify that it is fallacious. I then argue substitution of identicals needs to be restricted within the scope of the truth predicate. A logic for truth implementing this restriction is a monotonic extension of a classical first order logic, or indeed a formalizable fragment of natural language. Proofs of Tarski’s Indefinability of Truth theorem are invalid in this logic. This approach generalizes to invalidate proofs of Liar-like paradoxes, particularly the predicate form of the Knower paradox. Consequently, such a logic can be further extended in a way that avoids Montague’s theorem for such a system. Yet, the semantic status of a Liar sentence is not fully resolved. It is no longer overdetermined; it is now underdetermined. (shrink)

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

Throughout this paper, we are trying to show how and why our Mathematical frame-work seems inappropriate to solve problems in Theory of Computation. More exactly, the concept of turning back in time in paradoxes causes inconsistency in modeling of the concept of Time in some semantic situations. As we see in the first chapter, by introducing a version of “Unexpected Hanging Paradox”,first we attempt to open a new explanation for some paradoxes. In the second step, by applying this paradox, it (...) is demonstrated that any formalized system for the Theory of Computation based on Classical Logic and Turing Model of Computation leads us to a contradiction. We conclude that our mathematical frame work is inappropriate for Theory of Computation. Furthermore, the result provides us a reason that many problems in Complexity Theory resist to be solved.(This work is completed in 2017 -5- 2, it is in vixra in 2017-5-14, presented in Unilog 2018, Vichy). (shrink)

The sentences employed in semantic paradoxes display a wide range of semantic behaviours. However, the main theories of truth currently available either fail to provide a theory of paradox altogether, or can only account for some paradoxical phenomena by resorting to multiple interpretations of the language. In this paper, I explore the wide range of semantic behaviours displayed by paradoxical sentences, and I develop a unified theory of truth and paradox, that is a theory of truth that also provides a (...) unified account of paradoxical sentences. The theory I propose here yields a threefold classification of paradoxical sentences – liar-like sentences, truth-teller-like sentences, and revenge sentences. Unlike existing treatments of semantic paradox, the theory put forward in this paper yields a way of interpreting all three kinds of paradoxical sentences, as well as unparadoxical sentences, within a single model. (shrink)

Infectious logics are systems that have a truth-value that is assigned to a compound formula whenever it is assigned to one of its components. This paper studies four-valued infectious logics as the basis of transparent theories of truth. This take is motivated as a way to treat different pathological sentences differently, namely, by allowing some of them to be truth-value gluts and some others to be truth-value gaps and as a way to treat the semantic pathology suffered by at least (...) some of these sentences as infectious. This leads us to consider four distinct four-valued logics: one where truth-value gaps are infectious, but gluts are not; one where truth-value gluts are infectious, but gaps are not; and two logics where both gluts and gaps are infectious, in some sense. Additionally, we focus on the proof theory of these systems, by offering a discussion of two related topics. On the one hand, we prove some limitations regarding the possibility of providing standard Gentzen sequent calculi for these systems, by dualizing and extending some recent results for infectious logics. On the other hand, we provide sound and complete four-sided sequent calculi, arguing that the most important technical and philosophical features taken into account to usually prefer standard calculi are, indeed, enjoyed by the four-sided systems. (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)

Many philosophers recognize that, as a matter of psychological fact, one can believe something valuable without valuing it. I argue that it is also possible to value something without believing it valuable. Agents can genuinely value things that they neither believe disvaluable nor believe valuable along a scale of impersonal value.

We prove Yablo’s paradox without the diagonal lemma or the recursion theorem. Only a disquotation schema and axioms for a serial and transitive ordering are used in the proof. The consequences for the discussion on whether Yablo’s paradox is circular or involves self-reference are evaluated.

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