Unwinding Modal Paradoxes on Digraphs

Journal of Philosophical Logic 50 (2):319-362 (2020)
  Copy   BIBTEX

Abstract

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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,616

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Boolean Paradoxes and Revision Periods.Ming Hsiung - 2017 - Studia Logica 105 (5):881-914.
What paradoxes depend on.Ming Hsiung - 2020 - Synthese 197 (2):887-913.
What Paradoxes Depend on.Ming Hsiung - 2018 - Synthese:1-27.
Hyperboolean Algebras and Hyperboolean Modal Logic.Valentin Goranko & Dimiter Vakarelov - 1999 - Journal of Applied Non-Classical Logics 9 (2):345-368.
On a four-valued modal logic with deductive implication.Marcelo E. Coniglio & Martín Figallo - 2014 - Bulletin of the Section of Logic 43 (1/2):1-18.
Bisimulations and Boolean Vectors.Melvin Fitting - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 97-125.
Digraph Competitions and Cooperative Games.René van Den Brink & Peter Borm - 2002 - Theory and Decision 53 (4):327-342.

Analytics

Added to PP
2020-08-18

Downloads
37 (#375,012)

6 months
3 (#447,120)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Ming Hsiung
Zhongshan University

References found in this work

Paradox without Self-Reference.Stephen Yablo - 1993 - Analysis 53 (4):251-252.
Vagueness and contradiction.Roy A. Sorensen - 2001 - New York: Oxford University Press.
Axiomatic Theories of Truth.Volker Halbach - 2010 - Cambridge, England: Cambridge University Press.

View all 39 references / Add more references