Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | https://arxiv.org/abs/2504.10370 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866914622313857024 |
|---|---|
| author | Schlechta, Karl |
| author_facet | Schlechta, Karl |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_10370 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Further Comments on Yablo's Construction Schlechta, Karl Combinatorics Logic in Computer Science 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. |
| title | Further Comments on Yablo's Construction |
| topic | Combinatorics Logic in Computer Science |
| url | https://arxiv.org/abs/2504.10370 |