All Questions
8 questions
18
votes
3
answers
2k
views
Taking a proper class as a model for Set Theory
When I am reading through higher Set Theory books I am frequently met with statements such as '$V$ is a model of ZFC' or '$L$ is a model of ZFC' where $V$ is the Von Neumann Universe, and $L$ the ...
17
votes
3
answers
1k
views
Minimum transitive models and V=L
Is there a c.e. theory $T⊢\text{ZFC}$ in the language of set theory such that the minimum transitive model of $T$ exists but does not satisfy $V=L$?
You may assume that ZFC has transitive models. ...
7
votes
1
answer
222
views
Does $\mathit{Aut}(\mathbb{R};+)$ have a copy in $L(\mathbb{R})$ granting large cardinals?
Throughout, work in $\mathsf{ZFC}$ + large cardinals (let's say a proper class of Woodin limits of Woodins but I'm happy to go higher if that would help).
Let $\mathcal{R}=(\mathbb{R};+)$ be the ...
7
votes
0
answers
314
views
Is there a "nice" inner model for $\mathsf{ZF}$ + a Dedekind-finite infinite set of reals?
Below, given a formula $\varphi$ which $\mathsf{ZF}$ proves defines a set of reals and an inner model $W$, I'll write "$\varphi^W$" and "$L(\varphi^W)$" for "$\{x:W\models\...
5
votes
0
answers
192
views
"Very $L$-like" models, part 1: large cardinals
(The original version of this question was much narrower and less natural; but see the edit history if interested.)
Say that a good logic is a regular logic $\mathcal{L}$ containing $\mathsf{FOL}$ ...
3
votes
1
answer
325
views
If we have a class like $L$ but allowing a set number of unbounded quantifiers, is it strict superset of $L$?
The definition of $L$ only permits bounded quantifiers. If we allow a certain number of unbounded quantifiers, does this result in a strict superset of $L$? For example:
$$
\operatorname{Def}^{\...
3
votes
0
answers
152
views
Why are the sharps of sets of big ordinals not in $\mathcal{P}(\omega)$?
In his talk A Condensed History of Condensation, Welch presents the following recursive sharp function, that is total when all sharps exist:
\begin{align*}
\# \colon ON &\to \mathcal{P}(ON) \\
\...
2
votes
0
answers
195
views
"Very $L$-like" models, part 2: combinatorics
Say that a good logic is a regular logic $\mathcal{L}$ containing $\mathsf{FOL}$ and having the finite use property and the strong downward Lowenheim-Skolem property together with, for each finite ...