# Tagged Questions

**5**

votes

**1**answer

142 views

### Function Approximation in c.c.c Forcings without AC in Ground Model

Consider the following basic theorem.
Theorem. If $M$ is a c.t.m of ZFC and $\mathbb{P}$ a c.c.c forcing notion in $M$ and $G$ a $\mathbb{P}$ - generic filter on $M$ then for all $A,B$ in $M$ and for ...

**6**

votes

**1**answer

123 views

### Intermediate submodels which do not satisfy AC

The following is known:
Theorem. Suppose $V[G]$ is a generic extension of $V$ by a set forcing, and let $N$ be a model of $ZFC$ with $V\subseteq N\subseteq V[G].$ Then $N$ is a generic extension of ...

**4**

votes

**0**answers

130 views

### What is the meaning of restricting a Boolean value to a subalgebra?

$\require{AMScd}$
I am studying the proof that the ordering principle does not imply the axiom of choice in Jech's book "The Axiom of Choice" (Section 5.5). Let $P$ be the set of finite partial ...

**5**

votes

**1**answer

179 views

### A question about the first Cohen model

Consider the first Cohen model, i.e. let $M$ be a countable transitive model of ZFC + $V=L$, let $\mathbb P$ be the poset consisting of finite partial functions from $\omega\times\omega$ to $2$, let ...

**2**

votes

**1**answer

540 views

### Subsets of Real Numbers (Edited & Revised Version)

Question 1: Is it consistent with $\text{ZF}$ that only countable subsets of $\mathbb{R}$ are well-orderable?
Question 2: Is it consistent that for some $\lambda$, $\aleph_0 < \lambda < ...

**4**

votes

**3**answers

318 views

### Minimal Generalized Continuum Hypothesis & Axiom of Choice

It is well known that working in the frame of $\text{ZF}$, the Generalized Continuum Hypothesis ($\text{GCH}$) implies the Axiom of Choice ($\text{AC}$), i.e. $\text{ZF}+\text{GCH}\vdash \text{AC}$.
...

**6**

votes

**2**answers

222 views

### Possible Choices for Cofinality of $\aleph_n$ without Choice

$\text{ZFC}$ proves that each $\aleph_{n}$ for $n\in \omega$ is a regular cardinal. But it seems without the Axiom of Choice there are many consistent possible choices for cofinality of such ...

**7**

votes

**2**answers

230 views

### How to make countably closed forcing “nice” without choice

When working over a model $V$ of $ZFC$, countably closed forcings are extremely nice:
If $\mathbb{P}$ is countably closed, then $V[G]$ has no new $\omega$-sequences of elements of $V$. In ...

**3**

votes

**0**answers

227 views

### On Successive Regular Cardinals With No Ladders

Definition: Let $\kappa$ be an $\aleph$ cardinal, we say that $\langle f_\alpha\colon\alpha\to\kappa\mid\alpha<\kappa^+\rangle$ is a ladder if every $f_\alpha$ is injective.
Equivalently this is ...

**6**

votes

**0**answers

257 views

### What are these sets in Freyd's model?

Recall Freyd's model of $ZF +\neg AC$ (as recounted in MacLane and Moerdijk's book Sheaves in Geometry and Logic): it arises as the Fourman interpretation of the topos of sheaves on a particular ...

**5**

votes

**2**answers

465 views

### Forcing the nonexistence of a certain set

I have a certain set-theoretic axiom (WISC) which follows from Choice (this is a nuking a fly BTW), but which I suspect is independent of ZF. To show this I need to show that a certain set does not ...

**3**

votes

**1**answer

222 views

### Is the ordering principle preserved in generic extensions?

The ordering principle says that every set can be linearly ordered.
In a previous question Why are some axioms preserved in generic extensions? Asaf Karagila asked which axioms are preserved in ...

**5**

votes

**2**answers

641 views

### Why are some axioms preserved in generic extensions?

It is a known theorem that for a model of $ZF$, $M$, if $M\models AC$ and $G$ is a $P$-generic filter over $M$, for some $P\in M$, then $M[G]\models AC$.
On the other hand, it is long known that ...

**10**

votes

**4**answers

836 views

### Forcing over models without the axiom of choice

In the vast majority of papers forcing is always developed over ZFC.
Not surprisingly too, since infintary combinatorial principles are often used to prove results based on properties such as chain ...

**6**

votes

**1**answer

344 views

### Symmetric extensions and class forcing

Suppose $V\models ZFC$ and $P\in V$ is a poset of forcing conditions.
It is a basic theorem in forcing that $V[G]\models ZFC$ for any generic extension by a $V$-generic filter $G$.
It is also known ...