<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Inconsistency of the Zermelo-Fraenkel set theory with the axiom of choice and its effects on the computational complexity · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1203.0494/</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/1203.0494/feed.xml" rel="self" type="application/rss+xml" /><item><title>Inconsistency of the Zermelo-Fraenkel set theory with the axiom of choice and its effects on the computational complexity — mentioned by pmoriarty</title><link>https://news.ycombinator.com/item?id=20734029</link><guid isPermaLink="false">urn:hackerpapers:mention:1203.0494:20734029</guid><pubDate>Mon, 19 Aug 2019 00:55:26 GMT</pubDate><description>&lt;p&gt;Although I am starting to get out of my depth, my impression was that ZFC itself is (per Godel&amp;#x27;s results) inconsistent or incomplete. Here is some research to this effect: If this is indeed the case (as it seems to my unprofessional first glance to be) then mathematics does not in fact have a solid foundation, despite its appeal to ZFC. I&amp;#x27;d love to hear a professional logician weigh in on this, if there are any on here. [1] - https://www.researchgate.net/profile/Costas_Drossos/post/Is_... [2] - https://arxiv.org/abs/1203.0494&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1203.0494/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LO</category></item></channel></rss>
