Skip to main content

All Questions

Filter by
Sorted by
Tagged with
12 votes
1 answer
642 views

Posets preserving stationary subsets of $\omega_1$ and no new $\text{cof}(\omega)$ ordinals, but without countable covering property

What are some examples of posets $\mathbb{P}$ which have the following properties? It's OK if the definition uses large cardinals or some other hypothesis. $\mathbb{P}$ preserves stationary subsets ...
Sean Cox's user avatar
  • 2,231
10 votes
1 answer
707 views

Does "antichain" mean something different in set-forcing than in lattice theory?

On page 3 of Introduction to Lattices and Order, Davey and Priestley define an antichain in a poset $\langle P,\leq\rangle$ as a set of pairwise incomparable elements: The ordered set P is an ...
Adam's user avatar
  • 3,267
9 votes
0 answers
250 views

Distributivity of certain infinite products

Suppose we have a sequence of posets $\{\mathbb P_n : n\in\omega\}$ such that for each $n$, $\mathbb P_{n+1}$ is $|\mathbb P_n|^+$-distributive. Is $\prod_{n>0} \mathbb P_n$ necessarily $|\mathbb ...
Monroe Eskew's user avatar
  • 18.6k
8 votes
1 answer
232 views

Introducing meets while preserving directed closure

A poset $\mathbb{P}$ is called well-met iff every pair of compatible conditions in $\mathbb{P}$ has a greatest lower bound. Question: Suppose $\mathbb{P}$ is a separative partial order which is $\...
Sean Cox's user avatar
  • 2,231
7 votes
3 answers
1k views

Characterizing forcings that don't add any dominating reals

Regarding reals as functions from $\omega$ to $\omega$, let's say a real $f$ eventually dominates $g$ iff $(\exists n)(\forall m > n)[ f(m) > g(m)]$. Let's say that a (non-trivial separative) ...
Amit Kumar Gupta's user avatar
7 votes
2 answers
845 views

Statements forced by one condition of a poset, but not the whole thing

In order to get the relative consistency of some statement, it suffices to find a notion of forcing, and a condition $p$ in that forcing, such that $p$ forces the desired statement. It seems to be ...
Amit Kumar Gupta's user avatar
7 votes
1 answer
357 views

Forcing axiom for a single poset

Let $FA_\kappa (\mathbb{P})$ be the claim that for every family $\mathscr{D}$ of dense sets in the poset $\mathbb{P}$ with $\vert \mathscr{D} \vert = \kappa $ there is a filter $G$ such that for all $...
Matteo Casarosa's user avatar
7 votes
1 answer
195 views

Bounding and domination numbers for relation $\leq$ modulo $\omega$-nullsets

We say that $A\subseteq \omega$ is a nullset if $$\lim\sup_{n\to \infty} \frac{|A\cap n|}{n+1} = 0.$$ Let $\omega^\omega$ denote the set of functions $f:\omega\to\omega$. We define a pre-ordering ...
Dominic van der Zypen's user avatar
7 votes
1 answer
368 views

Which of these relations on partial orders allows us to identify forcing equivalence?

Background This question was inspired by Justin Palumbo's excellent question Cantor Bernstein for notions of forcing. In his question, Justin considers a relation $\lhd$ on partial orders (defined ...
jonasreitz's user avatar
  • 1,146
6 votes
2 answers
702 views

A sequence of generic filters that does not come from an iteration

Fix a countable transitive model $M$ of ZFC. In my answer to this question I indicated that there are forcing iterations $((Q_\alpha:\alpha\leq\omega),(\dot P_\alpha:\alpha<\omega))$ in $M$ and ...
Stefan Geschke's user avatar
5 votes
1 answer
215 views

Cofinal well-founded subset in mod finite order

The mod finite order on ${}^\omega \omega$ is defined as $f \leq^\ast g$ if and only if $f(n) \leq g(n)$ except for finitely many $n \in \omega$. My question is: can we always extract a cofinal well-...
Matteo Casarosa's user avatar
4 votes
1 answer
286 views

About subposet of Levy collapse

Let $\lambda>\kappa$ and $\operatorname{Coll}(\kappa, \lambda)$ be the poset collapsing $\lambda$ to $\kappa$. Pick a subposet $P$ which is $\lt\kappa$-closed and of size $\lambda$. Can we say that ...
user avatar
3 votes
2 answers
689 views

A problem about posets similar to Suslin's problem

Suslin's problem is: Given a complete dense linear order without endpoints, if it has the ccc must it be isomorphic to $\mathbb{R}$? The answer is that it's independent of ZFC. The related ...
Amit Kumar Gupta's user avatar