This is a defense and extension of Stephen Yablo's claim that self-reference is completely inessential to the liar paradox. An infinite sequence of sentences of the form 'None of these subsequent sentences are true' generates the same instability in assigning truth values. I argue Yablo's technique of substituting infinity for self-reference applies to all so-called 'self-referential' paradoxes. A representative sample is provided which includes counterparts of the preface paradox, Pseudo-Scotus's validity paradox, the Knower, and other enigmas of the genre. I (...) rebut objections that Yablo's paradox is not a genuine liar by constructing a sequence of liars that blend into Yablo's paradox. I rebut objections that Yablo's liar has hidden self-reference with a distinction between attributive and referential self-reference and appeals to Gregory Chaitin's algorithmic information theory. The paper concludes with comments on the mystique of self-reference. (shrink)

The book provides a historical and systematic exposition of the semantic theory of truth formulated by Alfred Tarski in the 1930s. This theory became famous very soon and inspired logicians and philosophers. It has two different, but interconnected aspects: formal-logical and philosophical. The book deals with both, but it is intended mostly as a philosophical monograph. It explains Tarski’s motivation and presents discussions about his ideas as well as points out various applications of the semantic theory of truth to philosophical (...) problems. (shrink)

Stratified properties such as ‘happy unhappiness’, ‘ungrounded ground’, ‘fortunate misfortune’, and evidently ‘true falsity’ may generate dialetheias (true contradictions). The aim of the article is to show that if this is the case, then we will have a special, conjunctive, kind of dialetheia: a true state description of the form ‘Fa and not Fa’ (for some property F and object a), wherein the two conjuncts, separately taken, are to be held untrue. The particular focus of the article is on happy (...) unhappiness: people suffering from (or enjoying) happy unhappiness (if there is some situation or state of mind of this kind) cannot be truly said ‘happy’ or ‘unhappy’, but we can say they are both. In the first section three cases of conjunctive stratification are presented; in the second section the logic of stratified contradictions is explored. The last section focuses on eudemonistic ascriptions: stated that a is happy to be unhappy (or unhappy to be happy), should we say a is happy? unhappy? both? neither? (shrink)

John Searle distinguished between weak and strong artificial intelligence (AI). This essay discusses a third alternative, mild AI, according to which a machine may be capable of possessing a species of mentality. Using James Fetzer's conception of minds as semiotic systems, the possibility of what might be called ``mild AI'' receives consideration. Fetzer argues against strong AI by contending that digital machines lack the ground relationship required of semiotic systems. In this essay, the implementational nature of semiotic processes posited by (...) Charles S. Peirce's triadic sign relation is re-examined in terms of the underlying dispositional processes and the ontological levels they would span in an inanimate machine. This suggests that, if non-human mentality can be replicated rather than merely simulated in a digital machine, the direction to pursue appears to be that of mild AI. (shrink)

It is well understood and appreciated that Gödel’s Incompleteness Theorems apply to sufficiently strong, formal deductive systems. In particular, the theorems apply to systems which are adequate for conventional number theory. Less well known is that there exist algorithms which can be applied to such a system to generate a gödel-sentence for that system. Although the generation of a sentence is not equivalent to proving its truth, the present paper argues that the existence of these algorithms, when conjoined with Gödel’s (...) results and accepted theorems of recursion theory, does provide the basis for an apparent paradox. The difficulty arises when such an algorithm is embedded within a computer program of sufficient arithmetic power. The required computer program (an AI system) is described herein, and the paradox is derived. A solution to the paradox is proposed, which, it is argued, illuminates the truth status of axioms in formal models of programs and Turing machines. (shrink)

In this article I present HYPER-REF, a model to determine the referent of any given expression in First-Order Logic. I also explain how this model can be used to determine the referent of a first-order theory such as First-Order Arithmetic. By reference or referent I mean the non-empty set of objects that the syntactical terms of a well-formed formula pick out given a particular interpretation of the language. To do so, I will first draw on previous work to make explicit (...) the notion of reference and its hyperintensional features. Then I present HYPER-REF and offer a heuristic method for determining the reference of any formula. Then I discuss some of the benefits and most salient features of HYPER-REF, including some remarks on the nature of self-reference in formal languages. (shrink)