Meta Theory when studying Set Theory

Solution 1:

There are generally two accepted approaches:

  1. You can use some arithmetical theory, e.g. $\sf PA$, or even a fragment which is sufficient to develop first-order logic and syntactic manipulation of proofs. Then one can define the language of set theory, write the axioms and proofs and so on. In fact $\rm Con(\sf ZFC)$ is in fact a statement about natural numbers rather than a statement about sets and models.

    This is even true if one wants to introduce forcing. And I ran into a recent masters thesis in which this (usually folklore, I believe?) result is given in details.

  2. You can use $\sf ZFC$ itself. Then you have some universe of set theory (usually $\sf ZFC+\rm Con(\sf ZFC)$ and even more), but you are in fact working inside a set model of set theory within that universe. In that case you are free to use all sort of fun model theoretical tools, and forcing is done directly and so on.

However in many many instances we in fact omit the meta theory, and we just care about it sufficient to develop first-order logic. We often work within the universe. So there is no real model of set theory, there is a universe and we work with that. We can do forcing using the universe because we can define Boolean-valued models and prove independence results using that, and so on.

Let me quote from a Ph.D. thesis written by VanLiere,

Since these questions all have to do with first-order provability, we could take as our metatheory some very weak theory (such as Peano arithmetic) which is sufficient for formalizing first-order logic. However, as is customary in treatises about set theory, we take as our metatheory $\sf ZF$ plus the Axiom of choice in order to have at our disposal the infinitary tools of model theory. We will also use locutions such as ... which are only really justifiable in some even stronger metatheory with the understanding that they could be eliminated through the use of Boolean-valued models or some other device.

This sums up quite nicely, I think, the very utilitarian approach to set theory. We really just need a weak theory sufficient for first-order logic, but it's easier and nicer to work with much stronger metatheories because they make our life so much easier.


About the second part, we often take the universe to have the same integers as the metatheory. This has some serious implications, e.g. the validity of $\rm Con(\sf ZFC)$ is inherited from the meta-theory. This is not always the case, and sometimes it is worth looking at non-standard models, or even models which do not agree on the integers with the universe or with the metatheory.

However whenever you see the term "transitive model" then you immediately know that the model and the universe agree on the integers, which has some strong implications on the truth values of some statements in the model. This is why arguing about transitive model is not enough to invoke the completeness theorem and have provability; but it is enough to establish independence.

This is again a utilitarian point. Transitive models are nice, and they have very nice properties that they inherit from the universe. When we are interested in independence, then working with transitive models is generally enough. So we do that, because we are utilitarians.

I should probably add another thing about utilitarianism here. Of course one can make all sort of crazy assumptions "because they would make life easier", but philosophically one is likely to agree that the consistency of $\sf ZFC$ is true if one is interested in investigating $\sf ZFC$ and its consequences, and so it's reasonable to add this assumptions to your list of axioms in the metatheory, and even more. Even if you end up working just with $\sf ZFC$ itself.

As the quote points out, some assumptions that we often use can only be justified by much stronger theories, but they are "philosophically sound" (i.e. working with $\sf ZFC+\lnot\rm Con(\sf ZFC)$ as a metatheory for investigating $\sf ZFC$ is really weird), and we can remove these extraneous assumptions by using slightly more complicated devices anyway.