Dangerous reference graphs and semantic paradoxes

Abstract The semantic paradoxes are often associated with self-reference or referential circularity. Yablo (1993), however, has shown that there are infinitary versions of the paradoxes that do not involve this form of circularity. It remains an open question what relations of reference between collections of sentences afford the structure necessary for paradoxicality. In this essay, we lay the groundwork for a general investigation into the nature of reference structures that support the semantic paradoxes and the semantic hypodoxes. We develop a functionally complete infinitary propositional language endowed with a denotation assignment and extract the reference structural information in terms of graph-theoretic properties. We introduce the new concepts of dangerous and precarious reference graphs, which allows us to rigorously define the task: classify the dangerous and precarious directed graphs purely in terms of their graph-theoretic properties. Ungroundedness will be shown to fully characterize the precarious reference graphs and fully characterize the dangerous finite graphs. We prove that an undirected graph has a dangerous orientation if and only if it contains a cycle, providing some support for the traditional idea that cyclic structure is required for paradoxicality. This leaves the task of classifying danger for infinite acyclic reference graphs. We provide some compactness results, which give further necessary conditions on danger in infinite graphs, which in conjunction with a notion of self-containment allows us to prove that dangerous acyclic graphs must have infinitely many vertices with infinite out-degree. But a full characterization of danger remains an open question. In the appendices we relate our results to the results given in Cook (2004) and Yablo (2006) with respect to more restricted sentences systems, which we call F-systems.
Keywords Paradox  Reference structure  Yablo's paradox  Liar paradox  Graph theory  Circularity  self-reference  Danger  Kernel  Yablo
Categories
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 5,701
External links
  •   Try with proxy.
  • Through your library Configure

    Similar books and articles
    O. Bueno & M. Colyvan (2003). Yablo's Paradox and Referring to Infinite Objects. Australasian Journal of Philosophy 81 (3):402 – 412.
    Ming Hsiung (2013). Equiparadoxicality of Yablo's Paradox and the Liar. Journal of Logic, Language and Information 22 (1):23-31.
    J. C. E. Dekker (1981). Twilight Graphs. Journal of Symbolic Logic 46 (3):539-571.
    Stephen Yablo (2004). Circularity and Paradox. In Thomas Bolander, Vincent F. Hendricks & Stig Andur Pedersen (eds.), Self-Reference. Csli Publications.
    Greg Restall (2007). Curry's Revenge: The Costs of Non-Classical Solutions to the Paradoxes of Self-Reference. In J. C. Beall (ed.), Revenge of the Liar: New Essays on the Paradox. Oxford University Press.
    Timothy Williamson (2000). Semantic Paradox and Semantic Change. The Proceedings of the Twentieth World Congress of Philosophy 2000:113-124.

    Analytics

    Monthly downloads

    Added to index

    2012-06-28

    Total downloads

    43 ( #26,191 of 549,124 )

    Recent downloads (6 months)

    4 ( #19,263 of 549,124 )

    How can I increase my downloads?


    My notes
    Sign in to use this feature


    Discussion
    Start a new thread
    Order:
    There  are no threads in this forum
    Nothing in this forum yet.

    Other forums