Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the significance of parameters and the projective level in the Choice and Comprehension axioms

Published 29 Jul 2024 in math.LO | (2407.20098v6)

Abstract: We make use of generalized iterations of Jensen forcing to define a cardinal-preserving generic model of ZF for any $n\ge 1$ and each of the following four Choice hypotheses: (1) $\text{DC}(\mathbf\Pi1_n)\land\neg\text{AC}\omega(\varPi1{n+1})\,;$ (2) $\text{AC}\omega(\text{OD})\land\text{DC}(\varPi1{n+1})\land \neg\text{AC}\omega(\mathbf\Pi1{n+1});$ (3) $\text{AC}\omega\land\text{DC}(\mathbf\Pi1_n)\land\neg\text{DC}(\varPi1{n+1});$ (4) $\text{AC}\omega\land\text{DC}(\varPi1{n+1})\land\neg\text{DC}(\mathbf\Pi1_{n+1}).$ Thus if ZF is consistent and $n\ge1$ then each of these four conjunctions (1)--(4) is consistent with ZF. As for the second main result, let PA$0_2$ be the 2nd-order Peano arithmetic without the Comprehension schema $\text{CA}$. For any $n\ge1$, we define a cardinal-preserving generic model of ZF, and a set $M\subseteq\mathcal P(\omega)$ in this model, such that $\langle\omega, M\rangle$ satisfies (5) PA$0_2$ + $\text{AC}\omega(\varSigma1{\infty})$ + $\text{CA}(\mathbf\Sigma1_{n+1})$ + $\neg\text{CA}(\mathbf\Sigma1_{n+1})$. Thus $\text{CA}(\mathbf\Sigma1_{n+1})$ does not imply $\text{CA}(\mathbf\Sigma1_{n+2})$ in PA$0_2$ even in the presence of the full parameter-free (countable) Choice $\text{AC}\omega(\varSigma1{\infty}).$

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.