« first day (2822 days earlier)   

3:35 AM
If $A$ satisfies this condition , it must be infinite. Adding an element does then not change the cardinality. — Peter 2 days ago
@Peter That's not true. See DanielWainfleet answer. — jjagmath 2 days ago
@Peter The issue is your claim "Adding an element does then not change the cardinality." In the absence of (a weak form of) the axiom of choice, adding a single element to an infinite set can change its cardinality. — Noah Schweber 9 hours ago
 
3:54 AM
@JadeVanadium: I always find it amusing that ZF, despite being immeasurably stronger than ACA0, has trouble with infinite sets without AC, whereas ACA0 has no trouble just because it already stipulates that every set is a subset of ℕ. Just for reference, here is the proof. Take any S⊆ℕ such that ∀k∈ℕ ( S does not biject with ℕ[<k] ). Let F = { ⟨k,m⟩ : k∈ℕ ∧ m∈S ∧ ℕ[<k] bijects with S[<m] }. Note that to get F within ACA0, we need to code ( ℕ[<k] bijects with S[<m] ). Then F bijects ℕ with S.
This is easy by induction. Clearly 0∈dom(F) since S ≠ ∅ so ⟨0,min(S)⟩∈F. And for any k∈dom(F), we have some m∈S such that ℕ[<k] bijects with S[<m], so letting n be min of S[≥m], we get ℕ[<k+1] bijects with S[<n] and hence k+1∈dom(F).
To be clear, ( ℕ[<k] bijects with S[<m] ) can be coded as ( there is a finite sequence x of length k such that i is an item in x iff i∈S[<m] ).
 
@user21820 It's definitely very silly. To be honest though, I think it's equally silly that ZFC still has so much trouble assigning cardinalities to uncountable sets, in the sense that CH and GCH are undecidable.
 
Hahaha.. that's if you believe in those monsters. =P
 
Aleph[1] stole my wife
 
LOL.
That statement has an implicit existential of "your wife". =P
 
I regret to confess that it is an implicit universal
 
4:09 AM
Hahaha.. actually I'm not sure what native English speakers would interpret it as.
I am a native speaker, but I am still not sure.
 
Definitely implicit existential
 
I'm talking about a different ambiguity now. Does "X stole my Y" mean "There is some Z that I call my Y and X stole Z.", or does it mean "There is some Z that I used to call my Y and X stole Z."?
Like, did Aleph[1] steal your wife and hence make her no longer yours? XD
By the way, I would personally say that CH has multiple variants, depending on which notion of countable you use:
Jul 26, 2023 at 5:01, by user21820
S is countable iff ∃f∈func(S,nat) ∀x,y∈S ( f(x) ≠ f(y) ).
Jul 26, 2023 at 5:01, by user21820
S is enumerable iff ∃g∈func(nat,S) ∀x∈S ∃k∈nat ( g(k) = x ).
Jul 26, 2023 at 5:01, by user21820
S is weak-enumerable iff ∃g∈proc(nat,S) ∀x∈S ∃k∈nat ( g(k) = x ).
I am certain that the 1st and 3rd are distinct notions, and I believe the 1st and 2nd are equivalent for non-empty S. Either way, we have at least 2 choices for each side of CH, so we have 4 different variants...
As I mentioned to you before:
Jul 26, 2023 at 5:06, by user21820
My intended model of my system (i.e. the one in my intuition) is weak-enumerable. In ZFC, this automatically implies enumerable and hence countable. But of course in my system itself it doesn't... So there is no Skolem's paradox!
In particular, (ℕ→ℕ) is also weak-enumerable...
I have to go for a while now. Back later!
If you think about all 4 variants of CH, let me know what you think! =D
 
4:30 AM
@JadeVanadium: I'm back!
 
 
2 hours later…
6:14 AM
@user21820 I think when someone says "stole my Y", the implication is that the speaker still consider Y to be 'theirs'. In the case of property, a thing being stolen doesn't legally change the fact that it's your property. Obviously people are not property though (ideally...), so something like "stole my wife" doesn't actually make sense when taken literally. The implication is that the speaker still considers her to be 'theirs' romantically, despite that the marriage is evidently dysfunctional.
 
7:14 AM
XD
@JadeVanadium: I was away again, and am back again.
I didn't know the wife-stealing linguistics question was more interesting than the CH question. =P
 
7:51 AM
Sorry I'm already focused on another math thing hahah
I'm about to post a question about whether the theory of (Ord, <) is decidable
 
Hahaha..
 
I think it is but I couldn't figure out a simple proof
 
Post the link here when you're done!
 
8:51 AM
0
Q: Is the theory of $(\operatorname{Ord}, <)$ decidable?

Jade VanadiumOver a sufficiently strong second-order theory (such as Morse-Kelley set theory), it's possible to define the truth of all first-order formulae in the language of sets. This allows us to construct the set of true sentences about the structure $(\operatorname{Ord}, <)$, where $\operatorname{Ord}$ ...

 
Is there some copy of δ1 = ω1^CK that does compute the k-th jump for any k < δ1? — user21820 7 mins ago
@JadeVanadium: I'm surprised. This is your first post on MO!
 
Hahah yeah. I guess that website is just weirdly intimidating
 
9:07 AM
@JadeVanadium Ironically enough, it's also the website that is most likely to outlive the rest of SE-related sites if the SE management botches something even bigger, because MO moderators made some kind of agreement that they can at any time break off from SE and retain control over MO.
 
"if", more like "when"
 
I don't know the details, and it can't be easy to DIY, but the option is a little bit comforting.
@JadeVanadium HAHA. Please don't ask for it. XD
 
 
4 hours later…
1:14 PM
@JadeVanadium Looks like Emil answered it already.
XD
It didn't last as long as I thought. =P
 
Indeed. I didn't think it would take long, honestly
Although I'm not sure why they answered in a comment instead of posting an actual answer
I'm still reading through the article they referenced
 

« first day (2822 days earlier)