![]() |
![]() |
#1 |
Dec 2003
Hopefully Near M48
6DE16 Posts |
![]()
This question is inspired by an incomplete solution of mine to a final exam problem a few years back.
For Then - - By Compactness + Downward Loweinheim-Skolem, for every Questions - Can we get - Can we get - Anything else interesting to say about |
![]() |
![]() |
![]() |
#2 |
Dec 2012
The Netherlands
1,583 Posts |
![]()
Does PA stand for Peano Arithmetic here?
|
![]() |
![]() |
![]() |
#3 |
Dec 2003
Hopefully Near M48
2×3×293 Posts |
![]()
Yup
|
![]() |
![]() |
![]() |
#4 | |
Romulan Interpreter
Jun 2011
Thailand
3·43·71 Posts |
![]() Quote:
2. is there anything "in between"? I don't know about that. 3. yes, it is cute... ![]() Last fiddled with by LaurV on 2017-06-03 at 13:05 |
|
![]() |
![]() |
![]() |
#5 |
Bamboozled!
"πΊππ·π·π"
May 2003
Down not across
244268 Posts |
![]()
Which would you prefer to have? Choose one and run with it.
The "continuum hypothesis", that there is nothing in between, has been shown to be undecidable in ZFC. You can add it as an axiom, if you wish, or you can add its negation and each choice will lead to a consistent system. Last fiddled with by xilman on 2017-06-03 at 16:15 Reason: Fix tag |
![]() |
![]() |
![]() |
#6 |
Romulan Interpreter
Jun 2011
Thailand
3×43×71 Posts |
![]()
Hmm.. we have to google for this and read the "news" about... First, we don't know the English terms, and then we have a lot of lacunes (why is this red? is it lacunas? or lacunae?) in the math itself. We were once good at these things (set theory) but we feel like few milenia passed since...
|
![]() |
![]() |
![]() |
#7 |
Dec 2003
Hopefully Near M48
2×3×293 Posts |
![]()
1) Well
The only problem with this example? It's not a model of 2) No question about Last fiddled with by jinydu on 2017-06-03 at 20:09 |
![]() |
![]() |
![]() |
#8 |
Romulan Interpreter
Jun 2011
Thailand
3·43·71 Posts |
![]()
That is new for me, and I think is false. According with my (old) memory, countable means \(\aleph_0\). There is a bijection between Q and N, and I still remember my high school teacher, Mrs. Diaconu, paining that diagonal-counting matrix on the blackboard.
|
![]() |
![]() |
![]() |
#9 | |
Aug 2006
3×1,987 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#10 |
Romulan Interpreter
Jun 2011
Thailand
915910 Posts |
![]()
Well, the height, as I understand it, is the cardinal of the longest chain that preserves the order. I may be totally wrong here, but I can't see how I can make a chain in Q that preserves the order and yet, have more elements than Q itself. What I am missing?
|
![]() |
![]() |
![]() |
#11 |
Jan 2017
2×43 Posts |
![]()
Height (as defined in the first post in this thread) is the sup of all the embeddable ordinals. You can't embed a larger cardinality, but you can embed all countable ordinals. Thus the sup is the first ordinal that is NOT countable.
|
![]() |
![]() |