On Yablo's Construction.

We analyse Yablo’s coding of the liar paradox by infinite acyclic graphs, [6], and show that his construction is in a certain way minimal. This leads to a very limited representation result. We then argue that the “right” level of description of more complicated constructions is probably the level of paths, and not of single arrows. We also look at more complicated cells of basic contradiction ("diamonds"), and show that, at least under certain conditions, they fail to achieve Yablo’s result.

Authors

• Karl Schlechta

Keywords

No keywords are indexed for this paper.