<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>A Universal Approach to Self-Referential Paradoxes, Incompleteness and Fixed Points · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/math_0305282/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/math_0305282/feed.xml" rel="self" type="application/rss+xml" /><item><title>A Universal Approach to Self-Referential Paradoxes, Incompleteness and Fixed Points — HN submission</title><link>https://news.ycombinator.com/item?id=48105330</link><guid isPermaLink="false">urn:hackerpapers:submission:math_0305282:48105330</guid><pubDate>Tue, 12 May 2026 07:36:36 GMT</pubDate><description>&lt;p&gt;Universal Approach to Self-Referential Paradoxes (2003)&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/math_0305282/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>math.LO</category></item><item><title>A Universal Approach to Self-Referential Paradoxes, Incompleteness and Fixed Points — HN submission</title><link>https://news.ycombinator.com/item?id=43238905</link><guid isPermaLink="false">urn:hackerpapers:submission:math_0305282:43238905</guid><pubDate>Mon, 03 Mar 2025 06:29:26 GMT</pubDate><description>&lt;p&gt;A Universal Approach to Self-Referential Paradoxes - Noson S. Yanofsky [2003]&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/math_0305282/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>math.LO</category></item><item><title>A Universal Approach to Self-Referential Paradoxes, Incompleteness and Fixed Points — mentioned by doomrobo</title><link>https://news.ycombinator.com/item?id=37414031</link><guid isPermaLink="false">urn:hackerpapers:mention:math_0305282:37414031</guid><pubDate>Thu, 07 Sep 2023 02:30:43 GMT</pubDate><description>&lt;p&gt;It turns out that these are all kind of the same, the Liar&amp;#x27;s Paradox, Russell&amp;#x27;s Paradox, the Halting Problem, etc. And indeed the they rely on a &amp;quot;diagonal map&amp;quot; i.e., a map x -&amp;gt; (x, x) in the construction. This was a great read, if you want a mathematical take on it, and some generalization too. https://arxiv.org/abs/math/0305282v1&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/math_0305282/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.LO</category></item><item><title>A Universal Approach to Self-Referential Paradoxes, Incompleteness and Fixed Points — mentioned by zozbot234</title><link>https://news.ycombinator.com/item?id=36378175</link><guid isPermaLink="false">urn:hackerpapers:mention:math_0305282:36378175</guid><pubDate>Sun, 18 Jun 2023 07:51:45 GMT</pubDate><description>&lt;p&gt;It is a formalization of Cantor&amp;#x27;s diagonal argument - in fact, of &amp;quot;diagonal arguments&amp;quot; more generally. See http://arxiv.org/abs/math/0305282 for an expository treatment.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/math_0305282/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.LO</category></item><item><title>A Universal Approach to Self-Referential Paradoxes, Incompleteness and Fixed Points — mentioned by myWindoonn</title><link>https://news.ycombinator.com/item?id=27851829</link><guid isPermaLink="false">urn:hackerpapers:mention:math_0305282:27851829</guid><pubDate>Fri, 16 Jul 2021 00:34:50 GMT</pubDate><description>&lt;p&gt;Hi, Lawvere pummelled your position into the ground a while ago: http://tac.mta.ca/tac/reprints/articles/15/tr15.pdf Your critique involves repeatedly crossing the boundary between the inside and outside of the system in question; Lawvere works entirely inside the system, and shows that the paradoxes of self-reference arise from our interpretations. https://arxiv.org/abs/math/0305282v1 explains with many examples. Hi downvoters: Use your words when somebody is wrong. Your downvotes aren&amp;#x27;t helpful here for finding the truth.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/math_0305282/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.LO</category></item><item><title>A Universal Approach to Self-Referential Paradoxes, Incompleteness and Fixed Points — mentioned by ajkjk</title><link>https://news.ycombinator.com/item?id=23186801</link><guid isPermaLink="false">urn:hackerpapers:mention:math_0305282:23186801</guid><pubDate>Thu, 14 May 2020 23:16:35 GMT</pubDate><description>&lt;p&gt;Oh, wow, this is a very stimulating comparison. My summary is that all of these are structurally the same: * programs with recursion that either halts or not -- is there a partial order on states of a recursive algorithm such that some state is eventually terminal? * threads with resource dependencies that either deadlock or not -- is there a partial order on resource acquisition so that eventually some operation is unblocked? * garbage collection of memory references -- is there a partial order on resource ownership such that some element is eventually unowned? * Russell&amp;#x27;s paradox…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/math_0305282/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.LO</category></item><item><title>A Universal Approach to Self-Referential Paradoxes, Incompleteness and Fixed Points — mentioned by lidHanteyk</title><link>https://news.ycombinator.com/item?id=22846066</link><guid isPermaLink="false">urn:hackerpapers:mention:math_0305282:22846066</guid><pubDate>Sun, 12 Apr 2020 04:30:37 GMT</pubDate><description>&lt;p&gt;It isn&amp;#x27;t what you&amp;#x27;re looking for, but perhaps Lawvere&amp;#x27;s generalization of Gödel&amp;#x27;s work is sufficiently geometric for you [0][1][2]. [0] https://ncatlab.org/nlab/show/Lawvere&amp;#x27;s+fixed+point+theorem [1] http://tac.mta.ca/tac/reprints/articles/15/tr15.pdf [2] https://arxiv.org/abs/math/0305282&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/math_0305282/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.LO</category></item><item><title>A Universal Approach to Self-Referential Paradoxes, Incompleteness and Fixed Points — mentioned by throwaway000002</title><link>https://news.ycombinator.com/item?id=10528775</link><guid isPermaLink="false">urn:hackerpapers:mention:math_0305282:10528775</guid><pubDate>Sun, 08 Nov 2015 15:48:10 GMT</pubDate><description>&lt;p&gt;Wow Peter, thanks for that. I like their analysis. It reminded me of a great article I read years ago that dealt with the issue of self-referential paradox. In fact, at the time I tried applying the techniques therein towards the surprise examination, however I didn&amp;#x27;t get anywhere. It&amp;#x27;s a paper by Noson Yanofsky entitled &amp;quot;A Universal Approach to Self-Referential Paradoxes, Incompleteness and Fixed Points&amp;quot; (http://arxiv.org/abs/math/0305282) I think you&amp;#x27;ll enjoy reading it. I read the paper on a long train ride loved working out how given &amp;quot;Ann believes that Bob believes that Ann believes that…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/math_0305282/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.LO</category></item></channel></rss>
