Journal of Philosophical Logic 42 (5):727-765 (2013)
Authors |
|
Abstract |
The semantic paradoxes are often associated with self-reference or referential circularity. Yablo (Analysis 53(4):251–252, 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 (J Symb Log 69(3):767–774, 2004) and Yablo (2006) with respect to more restricted sentences systems, which we call $\mathcal{F}$ -systems
|
Keywords | Paradox Reference structure Circularity Ungroundedness Yablo’s paradox Liar paradox Graph theory Dangerous Reference graphs |
Categories | (categorize this paper) |
ISBN(s) | |
DOI | 10.1007/s10992-012-9246-2 |
Options |
![]() ![]() ![]() ![]() |
Download options
References found in this work BETA
View all 16 references / Add more references
Citations of this work BETA
Theories of Truth Based on Four-Valued Infectious Logics.Damian Szmuc, Bruno Da Re & Federico Pailos - 2020 - Logic Journal of the IGPL 28 (5):712-746.
Dangerous Reference Graphs and Semantic Paradoxes.Landon Rabern, Brian Rabern & Matthew Macauley - 2013 - Journal of Philosophical Logic 42 (5):727-765.
A Graph-Theoretic Analysis of the Semantic Paradoxes.Timo Beringer & Thomas Schindler - 2017 - Bulletin of Symbolic Logic 23 (4):442-492.
View all 14 citations / Add more citations
Similar books and articles
Yablo's Paradox and Referring to Infinite Objects.O. Bueno & M. Colyvan - 2003 - Australasian Journal of Philosophy 81 (3):402 – 412.
Equiparadoxicality of Yablo’s Paradox and the Liar.Ming Hsiung - 2013 - Journal of Logic, Language and Information 22 (1):23-31.
The Principle of Uniform Solution (of the Paradoxes of Self-Reference).Nicholas J. J. Smith - 2000 - Mind 109 (433):117-122.
Circularity and Paradox.Stephen Yablo - 2006 - In Thomas Bolander, Vincent F. Hendricks & Stig Andur Pedersen (eds.), Self-Reference. CSLI Publications. pp. 139--157.
Curry's Revenge: The Costs of Non-Classical Solutions to the Paradoxes of Self-Reference.Greg Restall - 2007 - In J. C. Beall (ed.), Revenge of the Liar: New Essays on the Paradox. Oxford University Press.
The Inclosure Scheme and the Solution to the Paradoxes of Self-Reference.Jordi Valor Abad - 2008 - Synthese 160 (2):183 - 202.
Semantic Paradox and Semantic Change.Timothy Williamson - 2000 - The Proceedings of the Twentieth World Congress of Philosophy 2000:113-124.
Analytics
Added to PP index
2012-06-28
Total views
356 ( #28,862 of 2,508,046 )
Recent downloads (6 months)
14 ( #55,518 of 2,508,046 )
2012-06-28
Total views
356 ( #28,862 of 2,508,046 )
Recent downloads (6 months)
14 ( #55,518 of 2,508,046 )
How can I increase my downloads?
Downloads