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)

Spinoza’s geometrical approach to his masterwork, the Ethics, can be represented by a digraph, a mathematical object whose properties have been extensively studied. The paper describes a project that developed a series of computer programs to analyze the Ethics as a digraph. The paper presents a statistical analysis of the distribution of the elements of the Ethics. It applies a network statistic, betweenness, to analyze the relative importance to Spinoza’s argument of the individual propositions. The paper finds that (...) a small percentage of the propositions greatly exceed the majority in this importance. The paper then describes two logical structures that appear respectively in the Ethics and argues that they result in redundancy in the sense that about ten percent of the propositions could have been eliminated. The appendices list these structures and describes how the resources of the study can be made available to readers. (shrink)

We can classify the (truth-theoretic) paradoxes according to their degrees of paradoxicality. Roughly speaking, two paradoxes have the same degrees of paradoxicality, if they lead to a contradiction under the same conditions, and one paradox has a (non-strictly) lower degree of paradoxicality than another, if whenever the former leads to a contradiction under a condition, the latter does so under the same condition. In this paper, we outline some results and questions around the degrees of paradoxicality and summarize recent progress.