Does ZFC Imply the Power Set of Naturals?

AI Thread Summary
The discussion confirms that for any standard formulation of ZFC, the power set of the natural numbers, P(N), can indeed be derived. The existence of the empty set and the pairing axiom allows for the construction of the natural numbers, but additional axioms like Infinity are necessary for their existence as a set. The power set axiom then guarantees the existence of P(N). However, it's noted that P(N) may vary across different models of set theory, potentially containing only some subsets of the natural numbers. Overall, the existence of P(N) is affirmed within the context of ZFC axioms.
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)
 
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...

Similar threads

Back
Top