Synthese 197 (2):887-913 (2020)

Ming Hsiung
Zhongshan University
This paper gives a definition of self-reference on the basis of the dependence relation given by Leitgeb :155–192, 2005), and the dependence digraph by Beringer and Schindler. 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 :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.
Keywords No keywords specified (fix it)
Categories No categories specified
(categorize this paper)
DOI 10.1007/s11229-018-1748-1
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 50,118
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

A Remark on Hereditarily Nonparadoxical Sets.Péter Komjáth - 2016 - Archive for Mathematical Logic 55 (1-2):165-175.
Cofinality of the Laver Ideal.Miroslav Repický - 2016 - Archive for Mathematical Logic 55 (7-8):1025-1036.
Isomorphic and Strongly Connected Components.Miloš S. Kurilić - 2015 - Archive for Mathematical Logic 54 (1-2):35-48.
Models of Weak Theories of Truth.Mateusz Łełyk & Bartosz Wcisło - 2017 - Archive for Mathematical Logic 56 (5-6):453-474.
Set Theory Without Choice: Not Everything on Cofinality is Possible.Saharon Shelah - 1997 - Archive for Mathematical Logic 36 (2):81-125.
$$I_0$$ I 0 and Combinatorics at $$\Lambda ^+$$ Λ +.Nam Trang & Xianghui Shi - 2017 - Archive for Mathematical Logic 56 (1-2):131-154.
Σ1-Wellorders Without Collapsing.Peter Holy - 2015 - Archive for Mathematical Logic 54 (3-4):453-462.
Square Principles with Tail-End Agreement.William Chen & Itay Neeman - 2015 - Archive for Mathematical Logic 54 (3-4):439-452.


Added to PP index

Total views
1 ( #1,409,974 of 2,324,595 )

Recent downloads (6 months)
1 ( #679,828 of 2,324,595 )

How can I increase my downloads?


Sorry, there are not enough data points to plot this chart.

My notes