加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本