Searcharxiv⌕ Search

arXiv subjects

Victoria Gitman

Publications and source records attributed to Victoria Gitman.

27 records · Page 2Linked to original sources

Incomparable $ω_1$-like models of set theory

We show that the analogues of the Hamkins embedding theorems, proved for the countable models of set theory, do not hold when extended to the uncountable realm of $ω_1$-like models of set theory. Specifically, under the $\diamondsuit$ hypothesis and suitable consistency assumptions, we show that there is a family of $2^{ω_1}$ many $ω_1$-like models of ZFC, all with the same ordinals, that are pairwise incomparable under embeddability; there can be a transitive $ω_1$-like model of ZFC that does not embed into its own constructible universe; and there can be an $ω_1$-like model of PA whose structure of hereditarily finite sets is not universal for the $ω_1$-like models of set theory.

math.LO↗

On ground model definability

Laver, and Woodin independently, showed that models of ${\rm ZFC}$ are uniformly definable in their set-forcing extensions, using a ground model parameter. We investigate ground model definability for models of fragments of ${\rm ZFC}$, particularly of ${\rm ZF}+{\rm DC}_δ$ and of ${\rm ZFC}^-$, and we obtain both positive and negative results. Generalizing the results of Laver and Woodin, we show that models of ${\rm ZF}+{\rm DC}_δ$ are uniformly definable in their set-forcing extensions by posets admitting a gap at $δ$, using a ground model parameter. In particular, this means that models of ${\rm ZF}+{\rm DC}_δ$ are uniformly definable in their forcing extensions by posets of size less than $δ$. We also show that it is consistent for ground model definability to fail for models of ${\rm ZFC}^-$ of the form $H_{κ^+}$. Using forcing, we produce a ${\rm ZFC}$ universe in which there is a cardinal $κ>\!>ω$ such that $H_{κ^+}$ is not definable in its Cohen forcing extension. As a corollary, we show that there is always a countable transitive model of ${\rm ZFC}^-$ violating ground model definability. These results turn out to have a bearing on ground model definability for models of ${\rm ZFC}$. It follows from our proof methods that the hereditary size of the parameter that Woodin used to define a ${\rm ZFC}$ model in its set-forcing extension is best possible.

math.LO↗

Easton's Theorem for Ramsey and Strongly Ramsey cardinals

We show that, assuming GCH, if $κ$ is a Ramsey or a strongly Ramsey cardinal and $F$ is a class function on the regular cardinals having a closure point at $κ$ and obeying the constraints of Easton's theorem, namely, $F(α)\leq F(β)$ for $α\leqβ$ and $α<\cf(F(α))$, then there is a cofinality preserving forcing extension in which $κ$ remains Ramsey or strongly Ramsey respectively and $2^δ=F(δ)$ for every regular cardinal $δ$.

math.LO↗

Inner models with large cardinal features usually obtained by forcing

We construct a variety of inner models exhibiting features usually obtained by forcing over universes with large cardinals. For example, if there is a supercompact cardinal, then there is an inner model with a Laver indestructible supercompact cardinal. If there is a supercompact cardinal, then there is an inner model with a supercompact cardinal κfor which 2^κ=κ^+, another for which 2^κ=κ^++ and another in which the least strongly compact cardinal is supercompact. If there is a strongly compact cardinal, then there is an inner model with a strongly compact cardinal, for which the measurable cardinals are bounded below it and another inner model W with a strongly compact cardinal κ, such that H_{κ^+}^V\subseteq HOD^W. Similar facts hold for supercompact, measurable and strongly Ramsey cardinals. If a cardinal is supercompact up to a weakly iterable cardinal, then there is an inner model of the Proper Forcing Axiom and another inner model with a supercompact cardinal in which GCH+V=HOD holds. Under the same hypothesis, there is an inner model with level by level equivalence between strong compactness and supercompactness, and indeed, another in which there is level by level inequivalence between strong compactness and supercompactness. If a cardinal is strongly compact up to a weakly iterable cardinal, then there is an inner model in which the least measurable cardinal is strongly compact. If there is a weakly iterable limit δof <δ-supercompact cardinals, then there is an inner model with a proper class of Laver-indestructible supercompact cardinals. We describe three general proof methods, which can be used to prove many similar results.

math.LO↗

Ramsey-like cardinals

One of the numerous characterizations of a Ramsey cardinal kappa involves the existence of certain types of elementary embeddings for transitive sets of size κsatisfying a large fragment of ZFC. We introduce new large cardinal axioms generalizing the Ramsey elementary embeddings characterization and show that they form a natural hierarchy between weakly compact cardinals and measurable cardinals. These new axioms serve to further our knowledge about the elementary embedding properties of smaller large cardinals, in particular those still consistent with V=L.

math.LO↗

Ramsey-like cardinals II

This paper continues the study of the Ramsey-like large cardinals. Ramsey-like cardinals are defined by generalizing the characterization of Ramsey cardinals via the existence of elementary embeddings. Ultrafilters derived from such embeddings are fully iterable and so it is natural to ask about large cardinal notions asserting the existence of ultrafilters allowing only $α$-many iterations for some countable ordinal $α$. Here we study such $α$-iterable cardinals. We show that the $α$-iterable cardinals form a strict hierarchy for $α\leqω_1$, that they are downward absolute to $L$ for $α<ω_1^L$, and that the consistency strength of Schindler's remarkable cardinals is strictly between 1-iterable and 2-iterable cardinals.

math.LO↗

Scott's problem for proper Scott sets

I show that assuming PFA, every proper Scott set is the standard system of a model of PA. A Scott set X is proper if it is arithmetically closed and the quotient Boolean algebra X/Fin is a proper partial order.

math.LO↗

Proper and piecewise proper families of reals

I introduced the notions of proper and piecewise proper families of reals to make progress on an open question in the field of models of PA about whether every Scott set is the standard system of a model of PA. A family of reals X is proper if it is arithmetically closed and the quotient Boolean algebra X/fin is a proper poset. A family is piecewise proper if it is the union of a chain of proper families of size $\leqω_1$. Here, I explore the question of the existence of proper and piecewise proper families of reals of different cardinalities.

math.LO↗