Skip to main content

All Questions

Filter by
Sorted by
Tagged with
2 votes
0 answers
53 views

Consistency of Sigma-V-2 uniformization with AD

Is ZF + AD consistent with: For every real $r$, every true $Σ^V_2(r)$ statement has a $Δ^V_2(r)$ example? DC is provable in ZF + every true $Σ^V_2$ statement has a $Δ^V_2$ example (i.e. witness). ...
Dmytro Taranovsky's user avatar
4 votes
0 answers
107 views

Partial uniformization under AD

Under ZF + AD, and especially $\text{AD}^+$, even if uniformization fails for reals, in some ways it must almost hold. For a notion of small, we say that uniformization holds on a co-small set of ...
Dmytro Taranovsky's user avatar
7 votes
0 answers
259 views

A version of determinacy for all sets

Under ZF + AD, some games are undetermined because of lack of choice. In fact, the axiom of choice is equivalent to determinacy of games of length 2. However, we can ask whether the lack of choice ...
Dmytro Taranovsky's user avatar
4 votes
0 answers
205 views

Fine structure without choice

In set theory, are there approaches to fine structure that give fine-structural models that do not satisfy the axiom of choice? We can build fine-structural models above a given set (such as $\mathbb ...
Dmytro Taranovsky's user avatar
4 votes
1 answer
238 views

AD and simultaneous well-orderability principle

Is the axiom of determinacy (AD) consistent with the following choice principle, and if yes, does it hold in $L(ℝ)$ under AD: Simultaneous well-orderability: For every function $f:P(Ord)→\text{...
Dmytro Taranovsky's user avatar
10 votes
2 answers
564 views

Cardinal arithmetic under determinacy

Work in a reasonable theory of determinacy such as $\mathsf{ZF+DC+AD}$. Which of the following identities are true for arbitrary infinite sets? $|A^2|=|A^3|$ (motivated by an MSE question that asks ...
n901's user avatar
  • 667
3 votes
0 answers
212 views

Periodicity in the cumulative hierarchy

Under Reinhardt cardinals in ZF, the cumulative hierarchy exhibits a periodicity in that for large enough $λ$, certain properties of $V_λ$ depend on whether $λ$ is even vs odd. See Periodicity in the ...
Dmytro Taranovsky's user avatar
2 votes
0 answers
118 views

Uniformization and functions on Turing degrees

Assuming Martin's Conjecture on functions between Turing degrees, is AD + DC consistent with existence of an $f:\mathcal{D}_t → \mathcal{D}_t$ of rank $Θ$ ? $\mathcal{D}_t$ is the set of Turing ...
Dmytro Taranovsky's user avatar
6 votes
0 answers
125 views

From HODs to corresponding models of AD

If $M$ is HOD of a model $N$ of $\text{AD}^+ + V=L(P(ℝ))$, what kind of forcing construction in $M$ gives back such an $N$? HODs for $\text{AD}^+ + V=L(P(ℝ))$ are conjectured (and under anti-large ...
Dmytro Taranovsky's user avatar
6 votes
0 answers
185 views

Complexity of transfinite 5-in-a-row and other games

Suppose that 5-in-a-row is played on an infinite board, and after an infinite number of moves, if no one won yet and there is an empty square, the game just continues. At limit steps, it is the first ...
Dmytro Taranovsky's user avatar
7 votes
0 answers
198 views

Strengthening Determinacy in constructive set theory?

Recall how games work. Let $X$ be a set (the "game space") and $\alpha$ an ordinal (the "game clock"). Alice and Bob take turns naming elements of $X$. We write them down in order ...
Tim Campion's user avatar
  • 63.9k
10 votes
1 answer
255 views

How much of second-order arithmetic do you need for $\mathbf{\Sigma}^1_1$-determinacy to give you countable transitive models of $\mathsf{ZFC}$?

This is in some sense a follow-up to this question. The answer there says that over $\mathsf{Z}_2$ (second-order arithmetic), (boldface) $\mathbf{\Sigma}^1_1$-determinacy is enough to entail the ...
James E Hanson's user avatar
13 votes
1 answer
524 views

How much determinacy do you need for second order arithmetic to be as strong as ZFC?

From Wikipedia (I couldn't find the original source): $\text{ZFC} + \{\text{there are $n$ Woodin cardinals: $n$ is a natural number}\}$ is conservative over $\text{Z}_2$ with projective determinacy. ...
Christopher King's user avatar
2 votes
0 answers
267 views

Is determinacy of (some) very long open games consistent?

For $\varphi$ a first-order sentence in the language of set theory and $\kappa$ an ordinal, let $G_\varphi^{\kappa}$ be the game of length $\kappa$ in which players $1$ and $2$ alternately play ...
Noah Schweber's user avatar
7 votes
0 answers
258 views

Is this determinacy principle consistent?

Let $\mathsf{ODet}_{\omega_1}(L(\mathbb{R}))$ be the following principle ("determinacy for simple open length-$\omega_1$ games"): If $\kappa$ is any ordinal and $X\subseteq \kappa^{<\...
Noah Schweber's user avatar
8 votes
0 answers
169 views

Upper-bounding determinacy

While the converse of Borel determinacy ("If a set of reals is determined, then it is Borel") is boringly disprovable, I'm curious if there is a sense in which something like it is ...
Noah Schweber's user avatar
5 votes
1 answer
149 views

Can these alternating series games be undetermined?

To each pair $(S,\mathcal{X})$ where $S=(s_i)_{i\in\mathbb{N}}$ is a decreasing sequence of positive real numbers and $\mathcal{X}\subseteq\mathbb{R}$, we can associate the alternation game $A_S(\...
Noah Schweber's user avatar
9 votes
0 answers
251 views

Another determinacy-related cardinal characteristic

This question is a kind of "dual" to an earlier one of mine. Although I don't know a reference for this, it's easy to show the following result: Suppose $G$ is a game in which neither ...
Noah Schweber's user avatar
9 votes
0 answers
178 views

Does determinacy imply unravellability for the Borel sets (over a weak base theory)?

As far as I know, the only way we currently know how to prove Borel determinacy in $\mathsf{ZFC}$ is to go through unravelability (a rather technical property whose definition can be found in Martin's ...
Noah Schweber's user avatar
9 votes
0 answers
242 views

Is this cardinal characteristic trivial? (Number of strategies needed to guarantee at least one win)

(Previously asked at MSE.) Let the determinacy number, $\mathfrak{g}$ (for "game"), be the smallest cardinal such that for every (two-player, perfect-information, length-$\omega$) game on $\...
Noah Schweber's user avatar
2 votes
0 answers
140 views

Weakening of open determinacy for uncountably long games

For a cardinal $\kappa$ I'll use the phrase "$(\kappa,\kappa)$-game" to mean "two-player, perfect-information, deterministic game on $\kappa$ of length $\kappa$." Say that a ...
Noah Schweber's user avatar
11 votes
0 answers
374 views

A game of harmonic series(s)

Given a set $A\subseteq\mathbb{R}_{>0}$, consider the following (two-player, perfect-information, length-$\omega$) game $H_A$: Players $1$ and $2$ alternately play strictly increasing natural ...
Noah Schweber's user avatar
5 votes
1 answer
1k views

I can't believe it's not Replacement!

(I feel like I might have to apologise in advance for this question, but oh well..) I just rediscovered a comment from Asaf K here on MO that states that full Replacement is not needed for Borel ...
David Roberts's user avatar
  • 35.4k
7 votes
0 answers
231 views

Determinacy of symmetric games

Is it consistent that for all ordinals $α$ and $λ$ and infinite regular cardinals $κ$, games on $V_λ$ with game length $κα$ and $\mathrm{OD}(\mathrm{On}^κ)$ payoff that depends only on the set of all ...
Dmytro Taranovsky's user avatar
12 votes
0 answers
505 views

Can a generic $\mathbb{R}$ have a new cardinality?

This question was asked and bountied at MSE, without success. My main question is whether, starting with a model of determinacy, a "generic $\mathbb{R}$" could be different in cardinality ...
Noah Schweber's user avatar
12 votes
1 answer
448 views

Comparing generic versions of $\mathbb{R}$

This question was previously asked and bountied at MSE, unsuccessfully. I'm currently interested in the behavior of cardinalities in generic extensions of models of $\mathsf{ZF+\neg AC}$, and ...
Noah Schweber's user avatar
14 votes
1 answer
840 views

Is there a minimal inner model for determinacy?

Assume $\sf ZF+AD$. Is there some inner model $M$ containing all the ordinals such that $M\models\sf ZF+AD$ as well? What if we require $\omega_1$ and/or $\omega_2$ to be computed correctly? Can we ...
Asaf Karagila's user avatar
  • 39.7k
3 votes
1 answer
301 views

Pointwise definable models of determinacy

Suppose that the Axiom of Determinacy (AD) holds in $L(ℝ)$, and for some statement φ, $α$ is minimal such that $L_α(ℝ)⊨φ$. Do definable (in $L_α(ℝ)$) elements of $L_α(ℝ)$ form an elementary ...
Dmytro Taranovsky's user avatar
5 votes
0 answers
246 views

Forcing absoluteness in the setting of second-order arithmetic

There are some results about (set-size) forcing absoluteness for first-order properties in $L(\mathbb{R})$ and for $\mathbf{\Pi}^1_{\infty}$ properties when one works over $\mathsf{ZFC}$. My question ...
Fedor Pakhomov's user avatar
0 votes
0 answers
160 views

Strength of $Δ^1_{2n}$ determinacy

According to Lightface mice with finitely many Woodin cardinals from optimal determinacy hypotheses by Yizheng Zhu, theorem 1.1, over $\mathbf{Σ^1_{2n+1}}$ determinacy, $Δ^1_{2n+2}$ determinacy is ...
Dmytro Taranovsky's user avatar
4 votes
1 answer
236 views

Strong partition property + DC + existence of non-principal ultrafilter on $\omega$

It was mentioned after Theorem 30.27 in Kanamori's Higher Infinite that Woodin constructed a model of $DC$ + there exists unboundedly many many $\kappa<\Theta$ such that $\kappa \to (\kappa)^\...
Jing Zhang's user avatar
  • 3,038
2 votes
1 answer
331 views

Is $Z_3+{\rm AD}$ equiconsistent with $\text{ZFC+AD}^{L(\mathbb{R})}$

Let $Z_2$ and $Z_3$ be second and third order arithmetics respectively. In $Z_2$'s language, $\text{AD}$ (the axiom of determinacy) and $\text{PD}$ (projective determinacy) are stated the same way (...
Julian Barathieu's user avatar
11 votes
1 answer
686 views

The Axiom of Determinacy and the Banach-Mazur game

The Wikipedia article on the Axiom of Determinacy (AD) claims: Equivalent to the axiom of determinacy is the statement that for every subspace X of the real numbers, the Banach–Mazur game BM(X) is ...
Alex Kruckman's user avatar
9 votes
0 answers
256 views

A bi-modal logic related to determinacy

The short version of my question is as follows. There is a natural (I hope!) way to associate a bimodal theory to a game (two-player, perfect-information, length-$\omega$, on $\omega$); are there "...
Noah Schweber's user avatar
9 votes
1 answer
739 views

Can the Turing degrees be linearly ordered?

Assuming the axiom of choice, every set can be linearly (indeed, well-) ordered. However, without choice this can fail, as witnessed most drastically by the consistency of amorphous sets. More ...
Noah Schweber's user avatar
12 votes
0 answers
357 views

Undetermined copy/diagonalize games without CH

This question was the motivation behind an earlier question of mine; having thought about it some more, that question seems nontrivial and the connection is actually pretty tenuous anyways, so I've ...
Noah Schweber's user avatar
26 votes
3 answers
2k views

Does ZF+AD settle the original Suslin hypothesis?

Everyone knows that the real line $\langle\mathbb{R},<\rangle$ is the unique endless complete dense linear order with a countable dense set. Suslin's hypothesis is the question whether we can ...
Joel David Hamkins's user avatar
12 votes
1 answer
477 views

Is there a natural inner model of AD$_\mathbb{R}$?

The question is as in the title, but let me explain a bit. Assuming a proper class of Woodin cardinals, $L(\mathbb{R})$ satisfies AD (and DC). And $L(\mathbb{R})$ is a very natural inner model. I'm ...
Noah Schweber's user avatar
11 votes
1 answer
581 views

Is determinacy on an infinite Dedekind finite set consistent?

Consider $\mathrm{AD}_X$, determinacy for games where players pick moves from $X$. We know that it is consistent for $X = \omega$ or $\mathbb{R}$ (under large cardinal assumptions), but inconsistent ...
Ben E's user avatar
  • 643
6 votes
1 answer
402 views

How much real determinacy can live in $L(\mathbb{R})$?

It's well-known that AD$_\mathbb{R}$ fails in $L(\mathbb{R})$, provably in ZFC. This is because: AD$^{L(\mathbb{R})}$ implies DC$^{L(\mathbb{R})}$. Over ZF+DC, AD + "Every set of reals has a scale" ...
Noah Schweber's user avatar
5 votes
0 answers
192 views

The club filter in definable preorders

So this is an embarrassing question. Call a preorder $\mathbb{P}$ good if it has the following properties: Every countable chain in $\mathbb{P}$ has a least upper bound. $\mathbb{P}$ is directed (any ...
Noah Schweber's user avatar
5 votes
1 answer
231 views

Spreading sets - especially without choice

For what follows, I work in ZF+AD+DC. However, the questions below are not obviously trivial in ZFC, so I'm also interested in results in that system. Suppose I have a set $X\subseteq \mathbb{R}$. ...
Noah Schweber's user avatar
5 votes
1 answer
471 views

Comparing the sizes of uncountable sets of reals under AD

Working in ZF+AD, let $$\theta_0(X)=\min\{\alpha\in ON: \not\exists f: X\rightarrow \alpha\mbox{ surjective and OD}\}$$ be the least ordinal onto which $X$ does not surject in an OD way, for $X\...
Noah Schweber's user avatar
6 votes
1 answer
302 views

Ordinal-definable witnesses to the perfect set property?

This possibly a very basic descriptive set-theory question; if it is too basic for MO, feel free to migrate. Throughout we work in ZF+AD. My question is: If $A$ is an uncountable OD set of reals, ...
Noah Schweber's user avatar
10 votes
0 answers
306 views

The Chang model after collapsing an inaccessible limit of Woodins

If $\kappa$ is an inaccessible cardinal and $G \subset \operatorname{Col}(\omega,\mathord{<}\kappa)$ is a $V$-generic filter, then in $V[G]$ the Chang model $L(\text{Ord}^\omega)$ satisfies "every ...
Trevor Wilson's user avatar
7 votes
0 answers
239 views

Countable choice in $L(\mathbb{R}^*_G)$

Let $\lambda$ be a singular strong limit cardinal and let $G \subset \text{Col}(\omega,\mathord{<}\lambda)$ be a $V$-generic filter. Let $\mathbb{R}^*_G = \bigcup_{\alpha < \lambda} \mathbb{R}^{...
Trevor Wilson's user avatar
9 votes
0 answers
271 views

Which forcing types preserve the axiom of determinacy?

Do we have some rudimentary understanding of some properties that a forcing can have in order to guarantee that it doesn't violate the axiom of determinacy? To be more specific, in Which forcings ...
Asaf Karagila's user avatar
  • 39.7k
5 votes
1 answer
500 views

What axioms (other than choice) have a taming effect on the ordering of cardinalities?

Axiom of choice arranges all cardinalities into a well-ordered chain but without it their ordering can be wild in general ZF models, e.g. two cardinalities may not even have inf or sup. However, ...
Conifold's user avatar
  • 1,731
9 votes
1 answer
229 views

n odd: $\bf\Delta^1_n$ wadge degrees are $< \bf\delta^1_{n+1}$

My adviser is out of town and there is a comment in the Van Wesep paper "wadge degrees and descriptive set theory" that I can't figure out. Work in ZF+AD throughout. As stated in the title, the ...
Cody Dance's user avatar
8 votes
1 answer
412 views

Universal $(\Sigma^2_1)^{\text{Hom}_{\mathord{<}\lambda}}$ set

Does anyone know of a reference for the fact that if $\lambda$ is a limit of Woodin cardinals, then the pointclass $(\Sigma^2_1)^{\text{Hom}_{\mathord{<}\lambda}}$ is $\omega$-parameterized? By ...
Trevor Wilson's user avatar