A Formal Proof of the Independence of the Continuum Hypothesis — mentioned by ttctciyf

Wed, 28 May 2025 23:26:49 GMT

> Are these two meanings of "undecidable" related I can't claim to answer this, but you might like to look at A Relatively Small Turing Machine Whose Behavior Is Independent of Set Theory[0] which (amongst other interesting things) does discuss the proposition "ZFC is consistent", which is independent from ZFC, in terms of a Turing Machine which enumerates all possible proofs in ZFC and halts when it finds a contradiction (e.g. a proof of 0=1). But I don't think there's a simple equivalence here, all the same. The logician's undecidable is always relative to a set of axioms, whereas the…

Paper and discussion history. A mention is not an endorsement.

A Formal Proof of the Independence of the Continuum Hypothesis — HN submission

Mon, 08 Feb 2021 23:01:04 GMT

Formal [Lean] Proof of the Independence of the Continuum Hypothesis (2021)

2 points; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.

A Formal Proof of the Independence of the Continuum Hypothesis · HackerPapers discussions

A Formal Proof of the Independence of the Continuum Hypothesis — mentioned by ttctciyf

A Formal Proof of the Independence of the Continuum Hypothesis — HN submission