A constructive Knaster-Tarski proof of the uncountability of the reals · HackerPapers discussionshttps://hackerpaper.kaipfister.de/p/1902.07366/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMTA constructive Knaster-Tarski proof of the uncountability of the reals — mentioned by scapphttps://news.ycombinator.com/item?id=27847752urn:hackerpapers:mention:1902.07366:27847752Thu, 15 Jul 2021 17:55:14 GMT<p>You sound like you need to read this [0] answer to the question &quot;Are real numbers countable in constructive mathematics?&quot;. &gt; You are using the word &quot;constructive&quot; in an unusual way. It is true that, in ZFC, the set of computable real numbers is countable, but that is not directly a statement about constructive mathematics. &gt; Not every school of constructive mathematics identifies real numbers with algorithms; that&#x27;s a characteristic of the &quot;Russian&quot; school as I understand it. In other schools of constructivism that I am more familiar with, real numbers are coded by elements of 2^ω, or by a…</p><p><a href="https://hackerpaper.kaipfister.de/p/1902.07366/">Paper and discussion history</a>. A mention is not an endorsement.</p>math.HO