Skip to main content
Joel David Hamkins's user avatar
Joel David Hamkins's user avatar
Joel David Hamkins's user avatar
Joel David Hamkins
  • Member for 15 years, 1 month
  • Last seen this week
revised
Loading…
revised
Loading…
comment
Turing degrees of lim infs of computable functions
In the first sentence, you should say that $f_k$ is computable, and indeed, uniformly so.
Loading…
comment
Is there an elementary proof of a better result for the finite guessing-box puzzle?
Thanks very much for this, Elliot! +1. But could you provide somewhat fuller details, even for your initial elementary argument?
awarded
comment
Maximal Ramsey families
Does the empty function count as constant?
comment
What are some reasonable-sounding statements that are independent of ZFC?
Meanwhile, in my recent paper on CH, I propose another thought experiment showing how the CH and even the GCH could have been fundamental. riviste.fupress.net/index.php/jpm/article/view/2936 Your axiom would thereby become a theorem.
comment
What are some reasonable-sounding statements that are independent of ZFC?
@DanielAsimov In my paper on the set-theoretic multiverse, I make a thought experiment about the Powerset-size axiom (your axiom) and whether it might be accepted as a fundamental axiom, with a reference to this MO answer. But currently, it is not considered a candidate. The GCH is even stronger, and is sometimes mentioned, and set theorists find it worthwhile to study, but few are willing to add it once and for all as a fundamental principle.
comment
Weakly compact cardinals in $L$: how long do branches take to appear?
I haven't heard that, but it makes sense, in light of arguments I've heard from Philip.
comment
Weakly compact cardinals in $L$: how long do branches take to appear?
And this argument has an affinity with the argument in my result with Enayat, where a similar underlying order is used.
comment
Resource request (probability theory, computability theory, algebra)
The question seems fine to me. Not sure why people are objecting.
Loading…
awarded
comment
Weakly compact cardinals in $L$: how long do branches take to appear?
Very nice question! My result with Enayat is about definable class trees and definable paths, so it only rules out $\lambda=\kappa+1$ as not large enough. It could be that the paths come right away after that, or perhaps one must wait a long time, but I'm just not sure.
awarded
awarded
awarded
Loading…
comment
Are there models of ZF in which all uncountable sets are super/hyper/ultra-singular?
I just meant that if $|A|=|\cup x|$, meaning they are equinumerous, then $A$ is equinumerous with $\cup x$, and so we can replace $x$ with $x'$ where $A=\cup x'$. So that part of your change didn't actually change anything. Meanwhile, the rest of my answer here does use that $\omega_1$ is well-orderable, so that all the cardinals below it are also well-orderable, and this is how I concluded that $x$ must be countable and that the elements of $x$ must be countable as well, and indeed finite for the hypersingular case.
1
5 6
7
8 9
790