Yablo's paradox as a theorem of modal logic

Thomas Forster; Rajeev Goré

doi:10.2143/LEA.235.0.3170108

Yablo's paradox as a theorem of modal logic

Thomas Forster, Rajeev Goré

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

Abstract

We (further) demystify Yablo's paradox by showing that it can be thought of as the fact that the formula □ (p → □ ¬p) is unsatisfiable in the modal logic KD4 characterised by frames that are strict partial orders without maximal elements. This modal treatment also unifies the two versions of Yablo's paradox, the original version and its dual.

Original language	English
Pages (from-to)	265-271
Number of pages	7
Journal	Logique et Analyse
Volume	59
Issue number	235
DOIs	https://doi.org/10.2143/LEA.235.0.3170108
Publication status	Published - Sept 2016

Access to Document

10.2143/LEA.235.0.3170108

Cite this

@article{47073958af7f47158991bbf15626abd5,

title = "Yablo's paradox as a theorem of modal logic",

abstract = "We (further) demystify Yablo's paradox by showing that it can be thought of as the fact that the formula □ (p → □ ¬p) is unsatisfiable in the modal logic KD4 characterised by frames that are strict partial orders without maximal elements. This modal treatment also unifies the two versions of Yablo's paradox, the original version and its dual.",

author = "Thomas Forster and Rajeev Gor{\'e}",

year = "2016",

month = sep,

doi = "10.2143/LEA.235.0.3170108",

language = "English",

volume = "59",

pages = "265--271",

journal = "Logique et Analyse",

issn = "0024-5836",

publisher = "Nationaal Centrum voor Navorsingen in de Logica (Centre National Belge de Recherche de Logique)",

number = "235",

}

TY - JOUR

T1 - Yablo's paradox as a theorem of modal logic

AU - Forster, Thomas

AU - Goré, Rajeev

PY - 2016/9

Y1 - 2016/9

N2 - We (further) demystify Yablo's paradox by showing that it can be thought of as the fact that the formula □ (p → □ ¬p) is unsatisfiable in the modal logic KD4 characterised by frames that are strict partial orders without maximal elements. This modal treatment also unifies the two versions of Yablo's paradox, the original version and its dual.

AB - We (further) demystify Yablo's paradox by showing that it can be thought of as the fact that the formula □ (p → □ ¬p) is unsatisfiable in the modal logic KD4 characterised by frames that are strict partial orders without maximal elements. This modal treatment also unifies the two versions of Yablo's paradox, the original version and its dual.

UR - http://www.scopus.com/inward/record.url?scp=85009110122&partnerID=8YFLogxK

U2 - 10.2143/LEA.235.0.3170108

DO - 10.2143/LEA.235.0.3170108

M3 - Article

SN - 0024-5836

VL - 59

SP - 265

EP - 271

JO - Logique et Analyse

JF - Logique et Analyse

IS - 235

ER -

Yablo's paradox as a theorem of modal logic

Abstract

Access to Document

Other files and links

Fingerprint

Cite this