2025/04/14 by Karl Schlechta, Schlechta, Karl
Mathematics · #Advanced Operator Algebra Research #Advanced Topology and Set Theory #Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Logic in Computer Science (cs.LO) #Mathematical Dynamics and Fractals
paper · pdf · doi:10.48550/arxiv.2504.10370
openalex publication_date 2025/04/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.