Reputation
12,242
Next privilege 15,000 Rep.
Protect questions
Badges
1 31 49
Newest
 Yearling
Impact
~189k people reached

Mar
31
revised Unexpected Occurences of the Sierpinski Triangle
added 199 characters in body
Mar
27
revised How long does the slow inefficient algorithm for computing the product in classical Laver tables take?
edited tags
Mar
27
comment How long does the slow inefficient algorithm for computing the product in classical Laver tables take?
I never know whether to include the large cardinals or the set theory tags to Laver tables questions.
Mar
27
asked How long does the slow inefficient algorithm for computing the product in classical Laver tables take?
Mar
20
awarded  Yearling
Mar
19
answered Unexpected Occurences of the Sierpinski Triangle
Mar
14
comment Independence in mathematics
Drike. Community wiki is for questions in which there is no best answer because there are possibly several different good answers. For instance, I answered about independence in Boolean algebras, but someone else could talk about independence in Matroid theory while another person could talk about a certain model theoretic independence.
Mar
14
answered Independence in mathematics
Mar
14
comment Independence in mathematics
We may want to make this question community wiki.
Mar
14
accepted Do strong embeddings always provide all the ultrafilters that exist?
Mar
13
comment Do strong embeddings always provide all the ultrafilters that exist?
This is good. It looks like you started off with a strongness embedding $j_{0}$ and modified it to obtain a strongness embedding $j$ which produces our desired ultrafilter. However, I am interested in whether one can just use the strongness embedding $j_{0}$ that we started off with rather than using another strongness embedding. The fine ultrafilters that one obtains from strongly compact cardinals have this universality property. Therefore, in particular, the supercompactness embeddings have this universality property, so I wonder if strongness embeddings have this universality property.
Mar
12
asked Do strong embeddings always provide all the ultrafilters that exist?
Mar
10
awarded  Necromancer
Mar
9
awarded  Nice Question
Mar
7
answered When is the generalized Cantor space $\kappa$-compact?
Mar
6
revised Countably generated $\sigma$-algebra
added 3 characters in body
Mar
6
answered Countably generated $\sigma$-algebra
Mar
5
revised How long does it take for the action of the braid monoids on Laver tables to become trivial?
added 71 characters in body
Mar
5
asked How long does it take for the action of the braid monoids on Laver tables to become trivial?
Feb
29
awarded  Necromancer