Many topics have not been covered, in most cases because I don't know quite what to say about them. Would it be possible to add a decidability predicate to the language? What about stronger connectives, like exclusion negation or Lukasiewicz implication? Would an expanded language do better at expressing its own semantics? Would it contain new and more terrible paradoxes? Can the account be supplemented with a workable notion of inherent truth (see note 36)? In what sense does stage semantics (...) lie “between” fixed point and stability semantics? In what sense, exactly, are our semantical rules inconsistent? In what sense, if any, does their inconsistency resolve the problem of the paradoxes?The ideals of strength, grounding, and closure together define an intuitively appealing conception of truth. Nothing would be gained by insisting that it was the intuitive conception of truth, and in fact recent developments make me wonder whether such a thing exists. However that may be, until the alternatives are better understood it would be foolish to attempt to decide between them. Truth gives up her secrets slowly and grudgingly, and loves to confound our presumptions. (shrink)

This paper expands upon a way in which we might rationally doubt that there are multiple sizes of infinity. The argument draws its inspiration from recent work in the philosophy of truth and philosophy of set theory. More specifically, elements of contextualist theories of truth and multiverse accounts of set theory are brought together in an effort to make sense of Cantor’s troubling theorem. The resultant theory provides an alternative philosophical perspective on the transfinite, but has limited impact on everyday (...) mathematical practice. (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 aim of this dissertation is to offer and defend a correspondence theory of truth. I begin by critically examining the coherence, pragmatic, simple, redundancy, disquotational, minimal, and prosentential theories of truth. Special attention is paid to several versions of disquotationalism, whose plausibility has led to its fairly constant support since the pioneering work of Alfred Tarski, through that by W. V. Quine, and recently in the work of Paul Horwich. I argue that none of these theories meets the correspondence (...) intuition---that a true sentence or proposition in some way corresponds to reality---despite the explicit claims by each to capture this intuition. I distinguish six versions of the correspondence theory, and defend two against traditional objections, standardly taken as decisive against them, and show, plainly, that these two theories capture the correspondence intuition. Due to the importance of meeting this intuition, only these two theories stands a chance of being a satisfactory theory of truth. I argue that the version of the correspondence theory incorporating a simple semantic representation relation is preferable to its rival, for which the representation relation is complex. I present and argue for a novel version of this correspondence theory according to which truth is a correspondence property sensitive to semantic context. One consequence of this context-sensitivity is that an ungrounded sentence does not express a proposition. In addition to accounting for the similarity between the Liar and Truth-Teller sentences, this theory of truth is immune to the Liar Paradox, including empirical versions. It is argued that the Liar Paradox is devastating to all of the other theories above, and even formal theories of truth designed to solve it, such as the revision and vagueness theories. Customized versions of the Liar Paradox besetting this theory are handled by its context-sensitivity, and by enforcing the distinction between truth and truth value. This same pair of considerations also yields solutions to Lob's Paradox and Grelling's Paradox. Arguments similar to those given to defend this correspondence theory show that with one minor alteration, Kripke's fixed point theory may be used to model this correspondence notion of truth. (shrink)