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)

This paper gives a definition of self-reference on the basis of the dependence relation given by Leitgeb (J Philos Logic 34(2):155–192, 2005), and the dependence digraph by Beringer and Schindler (Reference graphs and semantic paradox, 2015. https://www.academia.edu/19234872/reference_graphs_and_semantic_paradox). 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 (Logic J IGPL 22(1):24–38, 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 ∀∃\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\forall \exists $$\end{document}-unwinding variant are non-self-referential, and neither McGee’s paradox nor the ω\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\omega $$\end{document}-cycle liar has circularity dependence. (shrink)

I lay out the framework for my theory of sensory imagination in “Imagining as a guide to possibility.” Sensory imagining involves mental imagery , and crucially, in describing the content of imagining, I distinguish between qualitative content and assigned content. Qualitative content derives from the mental image itself; for visual imaginings, it is what is “pictured.” For example, visually imagine the Philadelphia Eagles defeating the Pittsburgh Steelers to win their first Super Bowl. You picture the greenness of the field and (...) the football’s brown oblong shape. Some of what you imagine isn’t explicitly pictured, however. That it is Sunday, that it is the Super Bowl: these facts are assigned. (shrink)

According to the revision theory of truth, the paradoxical sentences have certain revision periods in their valuations with respect to the stages of revision sequences. We find that the revision periods play a key role in characterizing the degrees of paradoxicality for Boolean paradoxes. We prove that a Boolean paradox is paradoxical in a digraph, iff this digraph contains a closed walk whose height is not any revision period of this paradox. And for any finitely many numbers greater than 1, (...) if any of them is not divisible by any other, we can construct a Boolean paradox whose primary revision periods are just these numbers. Consequently, the degrees of Boolean paradoxes form an unbounded dense lattice. The area of Boolean paradoxes is proved to be rich in mathematical structures and properties. (shrink)

According to the revision theory of truth, the binary sequences generated by the paradoxical sentences in revision sequence are always unstable. In this paper, we work backwards, trying to reconstruct the paradoxical sentences from some of their binary sequences. We give a general procedure of constructing paradoxes with specific binary sequences through some typical examples. Particularly, we construct what Herzberger called “unstable statements with unpredictably complicated variations in truth value.” Besides, we also construct those paradoxes with infinitely many finite primary (...) periods but without any infinite primary period, those with an infinite critical point but without any finite primary period, and so on. This is the first formal appearance of these paradoxes. Our construction demonstrates that the binary sequences generated by a paradoxical sentence are something like genes from which we can even rebuild the original sentence itself. (shrink)

Imagination is celebrated as our vehicle for escape from the mundane here and now. It transports us to distant lands of magic and make-believe, and provides us with diversions during boring meetings or long bus rides. Yet the focus on imagination as a means of escape from the real world minimizes the fact that imagination seems also to furnish us with knowledge about it. Imagination seems an essential component in our endeavor to learn about the world in which we live--whether (...) we're planning for the future, aiming to understand other people, or figuring out whether two puzzle pieces fit together. But how can the same mental power that allows us to escape the world as it currently is also inform us about the world as it currently is? Ten original essays grapple with this neglected question; in doing so, they present a diverse array of positions ranging from cautious optimism to deep-seated pessimism. Blending perspectives from philosophy of mind, cognitive science, epistemology, aesthetics, and ethics, Knowledge Through Imagination sheds new light on the epistemic role of imagination. (shrink)

It is proved that Yablo’s paradox and the Liar paradox are equiparadoxical, in the sense that their paradoxicality is based upon exactly the same circularity condition—for any frame ${\mathcal{K}}$ , the following are equivalent: (1) Yablo’s sequence leads to a paradox in ${\mathcal{K}}$ ; (2) the Liar sentence leads to a paradox in ${\mathcal{K}}$ ; (3) ${\mathcal{K}}$ contains odd cycles. This result does not conflict with Yablo’s claim that his sequence is non-self-referential. Rather, it gives Yablo’s paradox a new significance: (...) his construction contributes a method by which we can eliminate the self-reference of a paradox without changing its circularity condition. (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)

Lenin, the great teacher of the proletariat, was deeply concerned with both the development of socialist literature and the problem of the correct critical acceptance of the literary heritage by the proletariat. Lenin frequently spoke of the works of Pushkin, Lermontov, Gogol, Tolstoy, Turgenev, Nekrasov, Shchedrin, Chekov, and others. Among the western European classical authors he particularly respected Shakespeare, Goethe, Heine, Hugo, Dickens, and Zola. In the brilliant classical writings which Lenin has left us he frequently made use of artistic (...) images, first molded in classical literary works, with which the people were familiar in order to expound problems of a theoretical nature. Furthermore he used them as tools for carrying on ideological education for the people. For example, in his writings Materialism and Empiriocriticism, and "The Marxist Critics and the Land Question," he used the image of Voroshilov, the false man of learning in Turgenev's novel Smoke, to elucidate a problem; he used the satirical images of bourgeois liberals from Shchedrin to reveal the basic nature of the enslavement and oppression of the people by the reactionary party, and so on. In addition, Lenin has left us in his works many incisive views directly related to the problem of the critical acceptance of the literacy heritage. They constitute an indivisible part of Lenin's theoretical estate. To study new Lenin's theories on the problem of the critical acceptance of the literacy heritage can be of great help to us today for our own correct treatment of the classical literacy heritage. (shrink)

The unwinding that Cook, 767–774 2004) proposed is a simple but powerful method of generating new paradoxes from known ones. This paper extends Cook’s unwinding to a larger class of paradoxes and studies further the basic properties of the unwinding. The unwinding we study is a procedure, by which when inputting a Boolean modal net together with a definable digraph, we get a set of sentences in which we have a ‘counterpart’ for each sentence of the Boolean modal net and (...) each point of the digraph. What is more, whenever a sentence of the Boolean modal net says another sentence is necessary, then the counterpart of the first sentence at a point correspondingly says the counterparts of the second one at all accessible points of that point are all true. The output of the procedure is called ‘the unwinding of a Boolean modal net on a definable digraph’. We prove that the unwinding procedure preserves paradoxicality: a Boolean modal net is paradoxical on a definable digraph, iff the unwinding of it on this digraph is also paradoxical. Besides, the dependence digraph for the unwinding of a Boolean modal net on a definable digraph is proved to be isomorphic to the unwinding of the dependence digraph for the Boolean modal net on the previous definable digraph. So the unwinding of a Boolean modal net on a digraph is self-referential, iff the Boolean modal net is self-referential and the digraph is cyclic. Thus, on the one hand, the unwinding of any Boolean modal net on an acyclic digraph is non-self-referential. In particular, the unwinding of any Boolean modal net on \ is non-self-referential. On the other hand, if a Boolean modal net is paradoxical on a locally finite digraph, the unwinding of it on that digraph must be self-referential. Hence, starting from a Boolean modal paradox, the unwinding can output a non-self-referential paradox only if the digraph is not locally finite. (shrink)

Tarski's theorem essentially says that the Liar paradox is paradoxical in the minimal reflexive frame. We generalise this result to the Liar-like paradox $\lambda^\alpha$ for all ordinal $\alpha\geq 1$. The main result is that for any positive integer $n = 2^i(2j+1)$, the paradox $\lambda^n$ is paradoxical in a frame iff this frame contains at least a cycle the depth of which is not divisible by $2^{i+1}$; and for any ordinal $\alpha \geq \omega$, the paradox $\lambda^\alpha$ is paradoxical in a frame (...) iff this frame contains at least an infinite walk which has an arbitrarily large depth. We thus get that $\lambda^n$ has a degree of paradoxicality no more than $\lambda^m$ iff the multiplicity of 2 in the (unique) prime factorisation of $n$ is no more than that in the prime factorisation of $m$; and all tranfinite $\lambda^\alpha$ has the same degree of paradoxcality but has a higher degree of paradoxicality than any $\lambda^n$. (shrink)

This article is a lecture note I wrote for my philosophy of mathematics course. Its main task is to explain the main ideas of Gupta's acceptable model proposed in his paper [J. Philos. Logic 11(1), 1–60, 1982]. I aim to provide detailed information on a result established by Gupta. On the one hand, I hope this explanation can be helpful for those who are learning Gupta's acceptable model, and on the other hand, I also hope to provide a guide for (...) beginners to interpret literature. (shrink)

This paper aims to explore the relationship between the necessity predicate and the truth predicate by comparing two possible-world interpretations. The first interpretation, proposed by Halbach et al. (J Philos Log 32(2):179–223, 2003), is for the necessity predicate, and the second, proposed by Hsiung (Stud Log 91(2):239–271, 2009), is for the truth predicate. To achieve this goal, we examine the connections and differences between paradoxical sentences that involve either the necessity predicate or the truth predicate. A primary connection is (...) established through two translations that change only one of the predicates to the other while keeping everything else unchanged. We prove that in bijective frames, a set of sentences that contains one of the two semantic predicates has the same paradoxicality as the corresponding set of sentences that contains the other predicate obtained through translation. However, there are substantial differences as well. First, the necessity predicate and the truth predicate, under the two interpretations, cannot be defined by each other. Moreover, for sentences that involve only the truth predicate, their paradoxicality is preserved under the homomorphisms of frames. For sentences containing the necessity predicate, their paradoxicality is preserved under bounded morphisms, but none of these sentences can have their paradoxicality preserved under the extension of frames. Finally, we also show that paradoxical sentences involving the necessity predicate and those involving the truth predicate differ significantly in terms of mirror symmetry, circularity dependence, and frame compactness. (shrink)

Cook regards Sorenson’s so-called ‘the no-no paradox’ as only a kind of ‘meta-paradox’ or ‘quasi-paradox’ because the symmetry principle that Sorenson imposes on the paradox is meta-theoretic. He rebuilds this paradox at the object-language level by replacing the symmetry principle with some ‘background principles governing the truth predicate’. He thus argues that the no-no paradox is a ‘new type of paradox’ in that its paradoxicality depends on these principles. This paper shows that any theory is inconsistent with the T-schema instances (...) for the no-no sentences, plus the T-schema instance for a Curry sentence associated with the symmetry of the no-no sentences. It turns out that the no-no paradox still depends on the problematic instances of the T-schema in a way that the liar paradox does. What distinguishes the no-no paradox is the T-schema instance for the above Curry sentence, which encodes Sorensen’s symmetry principle at the object-language level. (shrink)

Recently in epistemology a number of authors have mounted Bayesian objections to dogmatism. These objections depend on a Bayesian principle of evidential confirmation: Evidence E confirms hypothesis H just in case Pr(H|E) > Pr(H). I argue using Keynes' and Knight's distinction between risk and uncertainty that the Bayesian principle fails to accommodate the intuitive notion of having no reason to believe. Consider as an example an unfamiliar card game: at first, since you're unfamiliar with the game, you assign credences based (...) on the indifference principle. Later you learn how the game works and discover that the odds dictate you assign the very same credences. Examples like this show that if you initially have no reason to believe H, then intuitively E can give you reason to believe H even though Pr(H|E) ≤ Pr(H). I show that without the principle, the objections to dogmatism fail. (shrink)

Chinese culture is a lively and active organism. If we are to get to the real image of Chinese culture, we should take as a starting point the first passage of the Chung-yung [Doctrine of the Mean], which expounds its basic principles: "That which Heaven has decreed is called Nature, to follow that Nature is called tao [way] and to cultivate the tao is called instruction." This passage uses three phrases and one breath; these three phrases have a unified nature (...) which cannot be separated and which constitute one long sentence. Because of this, the words as a whole lead people to think of a richly vital and great tree which has the will of Heaven as its roots, human nature as its shoots, the tao as its trunk, and cultural instruction as its branches, leaves, and blossoms. As for the fruit, in terms of the individual, it is the achievement of a completely beautiful character, and in terms of the masses of the people, it is the ordering of the country and the pacification of the realm, the progression from the era of peace under the ancient kings to the age of the Grand Unity [ta-t'ung]. (shrink)