A Why Can't the Continuum Hypothesis Be Decided Using Standard Real Number Models?

lavinia
Science Advisor
Messages
3,362
Reaction score
749
I know that there are several models of the real numbers, some where the Continuum Hypothesis holds, others where it does not. I would like to understand why the usual definition of the reals, limits of Cauchy sequences of rational numbers under the usual absolute value norm, isn't one of these models and why then one can not decide the Continuum Hypothesis for it in particular.
 
Last edited:
Physics news on Phys.org
Because the system of axioms and derived theorems leads to the undecidabity of the CH?
 
I've just yesterday looked into Hewitt, Stromberg, Real and Abstract Analysis, on the search for hints or ideas on one of @micromass' analysis challenges. Their entire first chapter deals with set theoretical basics, starting with the proof of the various equivalences for AC and ending with the construction of ##\mathbb{C}## as the algebraic closure of ##\mathbb{R}## as Cauchy-sequences modulo null-sequences. (Dedekind cuts are an exercise there.)

It also contains some considerations like, e.g. "For all cardinals ##\mathfrak{a}## with ##2 \leq \mathfrak{a} \leq \mathfrak{c}## is ##\mathfrak{a}^{\aleph_0} = \mathfrak{c}## and ##\mathfrak{a}^{\mathfrak{c}} = 2^{\mathfrak{c}}##".

I haven't looked into greater detail, yet, (esp. where they use CH and where not), but if you have the chance, it might be a good reference for this.
 
Last edited:
AgentCachat said:
Because the system of axioms and derived theorems leads to the undecidabity of the CH?

To be more precise CH is undecidable in ZFC. We construct the rationals from the integers, which is constructed from naturals (Peano) which in turn can be constructed from ZFC.
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.
Back
Top