# What does the Concordant constructible universe model?

Define a ranking function $$\cal R$$ as:

$$\mathcal{R}: V \to ON; \,\mathcal {R}(x)= \min \alpha \, \forall y \in x: \alpha > \mathcal {R}(y)$$

Now the constructible rank $$\mathcal R^c$$ of a set $$X$$ in $$L$$ is the ordinal index of the first constructible stage $$X$$ appears as an element of.

Accordingly for some set $$X$$ we may have $$\mathcal {R^c}(X) > \mathcal {R} (X) +1$$

Now define: $$concordant(X) \equiv_{df} \mathcal {R^c}(X) = \mathcal {R}(X) + 1$$; otherwise, $$X$$ is discordant.

Let $$[Cc]$$ be the class of all concordant sets. Let $$L[Cc]$$ be defined as $$L[Cc] = \bigcup L_\alpha[Cc]$$

Where each $$L_{\alpha+1} [Cc]$$ is the set of all concordant subsets of $$L_\alpha [Cc]$$ that are definable after formulas with parameters and quantifiers restricted $$L_\alpha [Cc]$$; with limit stages being unions of all prior stages.

Now $$L[Cc]$$ is a proper subclass of $$L$$ so it cannot be a model of $$\sf ZFC$$.

Now what sentences $$L[Cc]$$ satisfy? In particualr does $$L`[Cc]$$ satisfy set union?

• It seems you can always pump up the rank artificially simply by adding all the ordinals as elements, and then working as usual with non-ordinal sets. In this sense, you won't really be missing much. Apr 23 at 11:20
• @JoelDavidHamkins, yes possibly the height of the hierarchy won't change (not sure of that) but, what about sets contained in each stage, for example all subsets of a stage must belong to the next stage, they cannot appear later, since this would be discordant. It is expected that we'd find hard times with maintaining impredicative constructability statements (with respect to type theory (which can be captured with constructible ranks)) since those are responsible for subsets of lower stages appearing high up in the hierarchy. I'd like to see if in particular set unions can be preserved. Apr 23 at 12:02
• My point is that they can in effect appear later, provided that they are accompanied by a suitable ordinal at that stage. So the entirety of L will be there, in this weird coded manner, where every set also contains the ordinals up to the stage it was added. Apr 23 at 12:33
• @JoelDavidHamkins, hmmm..., that's nice. I would like to know the details of that trick. Apr 23 at 13:03
• Your notation "$L_\alpha[Cc]$" clashes with the existing relative constructibility notation (according to which we trivially have $L_\alpha[Cc]\supseteq L_\alpha$ and $L[Cc]=L$); I suggest a different notation. Apr 23 at 16:00

We assume we are working in ZF. We assume that the definition of concordant is $$concordant(X) \equiv_{df} \mathcal {R^c}(X) = \mathcal {R}(X)$$+1(without the "+1", no set is concordant).

We will show that union does not hold in πΏβ[πΆπ]. For simplicity we will use Quine ordered pairs so that if x and y are in πΏπΌβ[πΆπ], and πΌ is infinite, then (x,y) is in πΏπΌβ[πΆπ]. We will construe

formulas as elements of Ο. We can express that a formula holds in πΏπΌβ[πΆπ], in πΏ(πΌ+1)β[πΆπ]. Let QX be the one element subsets of X. Let A be the set of elements of πΏ(Ο+1)β[πΆπ], given by

(f,p)βA<-->("f is a formula with two free variable holds" ,pβπΏ(Ο+1)β[πΆπ], and "f(p,(f,p)) does not hold in πΏ(Ο+1)β[πΆπ]"). We note that there is an infinte p and an f such that

"f is a formula with 2 free variables" holds, and (f,p)βA.(For instance let f be the formula corresponding to r=rβ§sβ s and let p=Ο. Then p=pβ§(f,p)β (f,p) does not hold in πΏ(Ο+1)β[πΆπ].)

Then AβπΏ(Ο+2)β[πΆπ], but QQAβπΏ(Ο+4)β[πΆπ]. If QAβπΏ(Ο+3)β[πΆπ], then QA is an example of a set whose union does not exist in πΏβ[πΆπ]. If QAβπΏ(Ο+3)β[πΆπ], then QQA is an example of a set whose union does not exist in πΏβ[πΆπ].

• I didn't finish examining your argument, but I've noticed that your proof contains a non-stratified piece of information that is f(p,(f,p)). Do you have a stratified version of your argument? Apr 27 at 16:02
• No............. Apr 27 at 16:57