Further Comments on Yablo's Construction
Combinatorics
2026-03-27 v7 Logic in Computer Science
Abstract
We continue our analysis of Yablo's coding of the liar paradox by infinite acyclic graphs. The present notes are based on and continue the author's previous results on the problem. In particular, our approach is often more systematic than before.
Cite
@article{arxiv.2504.10370,
title = {Further Comments on Yablo's Construction},
author = {Karl Schlechta},
journal= {arXiv preprint arXiv:2504.10370},
year = {2026}
}