If $A$ satisfies this condition , it must be infinite. Adding an element does then not change the cardinality. — Peter2 days ago
@Peter That's not true. See DanielWainfleet answer. — jjagmath2 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 Schweber9 hours ago
@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.
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:
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...
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
@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.
Over 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}$ ...
@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.