Does ZFC Imply the Power Set of Naturals?

mpitluk
Messages
25
Reaction score
0
Is it true that for every standard formulation T of ZFC, T ⊢ the power set of {naturals}?

After all, the empty set axiom and the pairing axiom are in T, and so we get N. Then by the power set axiom we get P(N).
 
Physics news on Phys.org


The existence of the empty set and the pairing axiom does not give us the existence of the natural numbers. Indeed: all natural numbers may exist that way, but perhaps they will not be contained in a set!
For the existence of a set of natural numbers, ZFC has included a special axioms that gives us that: the existence of an infinite set. Together with that, we can prove that the natural numbers exist. And by the power set axiom, also P(N) exists. So the answer to your question is yes.
 


So Infinity, Empty-Set and Pairing are jointly sufficient and individually necessary for P(N)?
 


mpitluk said:
So Infinity, Empty-Set and Pairing are jointly sufficient and individually necessary for P(N)?

And the power set axiom, of course.
 


Whoops. Right, thanks.
 


One thing to note here is that the power set P(\mathbb{N}) might not be the same in all models, some may contain only some of the subsets.

(indeed, it's also possible to create models where \mathbb{N} is different, but that's much less common)
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.

Similar threads

Back
Top