pith. sign in

arxiv: 2504.10370 · v8 · pith:F5DHHG6Enew · submitted 2025-04-14 · 🧮 math.CO · cs.LO

Further Comments on Yablo's Construction

classification 🧮 math.CO cs.LO
keywords continueyabloacyclicanalysisapproachauthorbeforecoding
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.