forcing, large cardinals, descriptive set theory, infinite combinatorics, cardinal characteristics, forcing axioms, ultrapowers, measures, reflection, pcf theory, models of set theory, axioms of set theory, independence, axiom of choice, continuum hypothesis, determinacy, Borel equivalence ...

learn more… | top users | synonyms

8
votes
1answer
343 views

If $\kappa$ is weakly inaccessible and $A\subset\kappa$, can $L[A]$ violate $\kappa^{\lt\kappa}=\kappa$?

In some current work, my co-authors and I had wanted in a certain argument to appeal to $\kappa^{\lt\kappa}=\kappa$ in $L[A]$, in a situation where $A\subset\kappa$ and $\kappa$ was weakly ...
6
votes
1answer
187 views

Surjective (strong) reducibility of Borel equivalence relations

Suppose $E$ and $F$ are Borel equivalence relations on Polish spaces $X$, $Y$, resp. Say that $E$ is surjectively Borel reducible to $F$ iff there is a Borel surjection $f:X \to Y$ such that $xEy$ iff ...
4
votes
1answer
335 views

Inaccessible cardinal and $\Sigma_1$ reflection

A theorem of A. Levy says that, if $\kappa$ is an inaccessible cardinal, then $V_\kappa\prec_{\Sigma_1}V$ namely $V_\kappa$ is an elementary submodel when considering only $\Sigma_1$ formulas. Where ...
7
votes
2answers
555 views

Independence of the countable axiom of choice

How does one proove that the Countable axiom of choice is not provable in ZF?Is there any brief proof?Does the Independence of the countable axiom of choice implies the independence of the axiom of ...
4
votes
1answer
130 views

$\mathfrak{p}=\mathfrak{b}=\mathfrak{a}=\aleph_1$ and $\mathfrak{d}=\mathfrak{c}=\kappa$

Asumme tha in $M$, $CH$ holds and $\kappa>\aleph_0$ and $\kappa^{\aleph_0}=\kappa$. Let $K$ be $Fn(\kappa,2)$-generic over $M$. Question: Then we can say in $M[K]$ that: $(i)$ ...
3
votes
1answer
233 views

Hamkins infinite time Turing machines: dovetailing ordinal time

It is claimed in the Hamkins and Lewis founding article "Infinite time Turing machines" (proof of the gap existence theorem 3.4) that for $\omega$ steps of a computation of a machine performing a ...
7
votes
0answers
125 views

$\kappa$-impediments (according to Shelah, Nash-Williams, Aharoni)

Let $\Gamma = (M, W, K)$ be a bipartite graph, that is $M, W$ are sets and $K\subseteq M\times W$. If there is an injective function $f:M\to W$ such that $f\subseteq K$ we say $f$ is an espousal and ...
2
votes
0answers
294 views

A query on how to climb inaccessibles in £

I am investigating to what extent extensions of the librationist property or set theory £ may support relative inaccessible sets; see Librationist Closures of the Paradoxes and Elements of ...
2
votes
1answer
115 views

“Namba forcing adds reals” independent of $ZFC + \neg CH$?

I know that, in the presence of $CH$, Namba forcing does not add reals. But when $CH$ fails, is it consistent that it still does not add reals?
14
votes
2answers
614 views

Scott-Solovay unpublished paper on ``Boolean valued models of set theory''

I have read some papers from 1970$^{th}$, and in some of them, the paper of Scott and Solovay on ``Boolean valued models of set theory'' is given as a main reference, with many references to the ...
6
votes
3answers
266 views

Borel cross section

It is known from metric space topology that a closed equivalence relation on a Polish space has either countably many or $\mathfrak{c}$ many equivalence classes. A short elementary proof is given in ...
3
votes
3answers
862 views

Reverse Skolem's paradox

By using the Löwenheim–Skolem theorem & Mostowski collapse, in every model $V$ of $ZF+Con(ZF)$ there is a countable transitive set $M$ such that $(M,\in_M) \models ZF$. Is the following "converse" ...
17
votes
2answers
1k views

Philosophical arguments in defense (or against) large cardinals

The question is essentially what is asked in the title. I split it into two parts (A) (Arguments supporting the existence of large cardinals) What are the main philosophical arguments in defense ...
5
votes
1answer
207 views

Are Sharps in Countable Models Really Sharps?

Suppose $M$ is a countable transitive model of $\mathsf{ZFC}$ (maybe more). Suppose $x, y \in {}^\omega\omega \cap M$ and $M \models y = x^\sharp$. Is it true (possible with additional assumptions), ...
8
votes
2answers
247 views

Is there a version of Miller forcing “guided by” an ultrafilter?

It’s well known that Mathias forcing factors as a two-step iteration $P(\omega)/\mathrm{fin}\ast \mathbb{M}_{\dot U}$, where $\mathbb{M}_{\dot U}$ is Mathias forcing guided by the generic ultrafilter ...
11
votes
1answer
489 views

Continuous functions and 2-bushy trees

The following problem was asked by Joe Miller in the fall of 2010 at a bar in Madison. A subtree $T \subseteq 4^{< \omega}$ is $2$-bushy if for some node $\sigma \in T$, every node above $\sigma$ ...
16
votes
6answers
883 views

Application of Fraïssé construction in set theory

As you know Fraïssé limit construction and its generalization, Hrushovski's construction, have many applications in model theory to build models with interesting property. Now I would like to know ...
7
votes
0answers
237 views

Quasi-disjoint subsets of an infinite set and $\neg \mathsf{AC}$

Is it consistent with $\mathsf{ZF}$ (without $\mathsf{AC}$) that there is an infinite set $X$ and a subset $S\subseteq\mathcal P(X)$ of the same cardinality as $\mathcal P(X)$ with the property that ...
13
votes
2answers
1k views

Do the real numbers “know” that they are countable in a larger model?

(This was first posted to math.stackexchange but had no answers there after several days): Let ${\mathbb R}$ be the set of real numbers in whatever is your favorite model of $ZFC$. Then (by Levy ...
8
votes
0answers
169 views

History of preservation theorems in forcing theory

For my honours thesis, I am studying a general preservation theorem using a framework provided by Shelah. I am mainly concerned about revised countable support iteration of $\dot{S}$-semiproper ...
1
vote
1answer
125 views

Questions about a possible way of representing construcive ordinal numbers

Let $K$ be the set of all total recursive functions of non-negative integers having only non-negative integers as values. Let $L$ be any well-ordered subset of $K$ in which the ordering $<$ is ...
6
votes
1answer
457 views

Adding sets not containing arithmetic progressions of length three by forcing

Consider the following forcing notion: conditions in $\mathbb{P}$ are pairs $(s, N),$ where: 1) $s\in 2^{<\omega}$, 2) $N\in \mathbb{N}$, 3) (by identifying $s$ with a subset of $lh(s)$) $s$ ...
6
votes
0answers
200 views

Tree property and singular strong limit cardinals

I heard that the following theorem is proved recently by Foreman-Magidor, which answers a famous old open question: Theorem. It is consistent, relative to the existence of large cardinals, that ...
9
votes
2answers
479 views

Non-Forcing and Independence

I asked this question about two weeks ago on MSE and haven't gotten an answer, so I thought I would post the question here. Do there exists sentences which are independent of ZFC, cannot be shown to ...
8
votes
1answer
242 views

Translates of meager sets

Does there exist a meager set of reals M such that every meager set can be covered by countably many translates of M? This is the category analogue of the following.
-2
votes
1answer
201 views

Forcing and $\mathbb{P}$-name [closed]

If $\mathbb{P}$ be a poset, $\dot{Q}$ a $\mathbb{P}$-name and $\mu$ an infinite cardinal such that $\Vdash 0<|\dot{Q}|\leq\mu$. $(a)$ Exist names $\langle \dot{q}_\alpha\rangle_{\alpha<\mu}$ ...
1
vote
1answer
245 views

Confusion with proof about a fact $\mathbb{P}$-name [closed]

Let $\mathbb{P}$ be poset. Let $B$ be a set. We say that a $\mathbb{P}$-name $\dot{b}$ is a nice name for member of $B$ if there is a maximal antichain $A\subseteq\mathbb{P}$ and a function ...
2
votes
2answers
259 views

Zorn's lemma via Zermelo theorem [closed]

Is there a way to deduce Zorn's lemma from Zermelo theorem (that any set may be well ordered), which is essentially shorter then deduction of Zorn's lemma from the usual form of Axiom of Choice?
31
votes
2answers
810 views

Translates of null sets

Does there exist a null set of reals $N$ such that every null set is covered by countably many translations of $N$?
3
votes
1answer
144 views

Ore's theorem for countable graphs

Ore's theorem states that in a finite graph $G$ with $|V(G)|=n$, there is a Hamiltonian path, provided that the sums of the degrees of 2 distinct, non-adjacent vertices is $\geq n$. For countable ...
6
votes
1answer
296 views

Axiom of choice and the equality between second-order constructible universe and HOD

I try to prove $L_{SO}=\mathrm{HOD}$, where $L_{SO}$ is second-order constructible universe which has similar definition with $L$ but it uses second-order definability rather than the first-order ...
4
votes
1answer
147 views

presaturated ideals

In this paper, Gitik and Shelah make the following claim (part of Proposition 1.5): Claim (Gitik-Shelah): Suppose $\kappa < \lambda$ are regular, $2^\lambda = \lambda^+$, and $D$ is a normal ...
5
votes
2answers
545 views

A specific Model of ZFC

In his paper "Some Second Order Set Theory", Joel Hamkins asked whether there is a model of set theory $V$ that is elementary equivalent to $V[G]$, Whenever $G$ is $V$-generic for the collapse of a ...
4
votes
2answers
261 views

Proving results about complete Boolean algebras in ZFC using Boolean valued models

I want to know what non-trivial ZFC theorems (not consistency results) about complete Boolean algebras (or more generally of partially ordered sets) one can prove using forcing. I am mainly ...
7
votes
1answer
204 views

$\text{Cont}(X,X)$ and $\neg\mathsf{GCH}$

For a topological space $(X,\tau)$ let $\text{Cont}(X,X)$ denote the set of continuous functions $f:X\to X$. Is it consistent that there a space $(X,\tau)$ such that $$|X| < |\text{Cont}(X,X)| < ...
3
votes
1answer
93 views

The GCH in a reverse Easton support iteration

I am trying to understand the proof that the GCH can first fail at a weakly compact cardinal. We assume the GCH and that there exists a weakly compact cardinal $\kappa$, and we construct a reverse ...
4
votes
4answers
398 views

Topological spaces $(X,\tau)$ where $|\text{Cont}(X,X)| = |X|$

Let $(X,\tau)$ be a topological space. Let $\text{Cont}(X,X)$ denote the set of continuous functions $f:X\to X$. What can be said about spaces $(X,\tau)$ where $|\text{Cont}(X,X)| = |X|$? For ...
4
votes
1answer
299 views

stationary tower forcing

It is known that if $\delta$ is a Woodin cardinal and $\kappa < \delta$, then the stationary tower forcing $\mathbb Q^\kappa_{<\delta}$ preserves cardinals up to $\kappa$ and forces $\delta = ...
6
votes
1answer
232 views

Is there a simple combinatorial characterization for when a direct limit of ultrapowers of $V$ is well-founded?

I want to know if there are fairly simple combinatorial necessary conditions for when a direct limit of ultrapowers of $V$ is well-founded similar to $\sigma$-completeness. By combinatorial, I mean ...
6
votes
0answers
174 views

Singular Jonsson cardinals

Is the consistency of the following well-known: $(*)$: There exists a singular cardinal $\kappa$ such that : (1) $\kappa$ is a Jonsson cardinal, (2) $\kappa$ is not a fixed point of the ...
7
votes
1answer
162 views

$2$-uniformization versus $\omega$-uniformization of ladder systems

Let $S \subseteq \omega_1$ be a stationary set of limit ordinals and let $L = \langle L_\alpha \;|\; \alpha\in S\rangle$ be a ladder system. We say that $L$ has $\kappa$-uniformization if for every ...
12
votes
1answer
559 views

Ordinary mathematics in Chang's model

This question is prompted by a paper by Andre Kornell that just appeared on the arXiv. A large portion of the paper is devoted to showing that a surprising amount of ordinary mathematics can be ...
5
votes
1answer
155 views

Pseudo-Prikry sequences vs Prikry sequences

Definition: Let $V\subseteq W$ be two transitive models of $ZFC$. A pseudo-Prikry sequence, $s$, at a cardinal $\kappa$ for $(V, W)$ is an $\omega$-sequence, cofinal at $\kappa$ such that for every ...
9
votes
0answers
223 views

Proving regularity properties from forcing axioms

It's well known that PFA implies projective determinacy. It's also well known that PD implies that all projective sets are Lebesgue measurable, have the Baire property, etc. Is there a direct proof ...
4
votes
1answer
227 views

Sharps and Every Set is Constructible from a Real

Is it consistent that there is a model of $\mathsf{ZFC}$ (or $\mathsf{ZF}$) with the following properties: (1) For all $x \in {}^\omega 2$, $x^\sharp$ exists (or $\mathbf{\Sigma}_1^1$ determinacy) ...
2
votes
0answers
100 views

May $\Sigma_3$-collection hold below $\Sigma_3$-admissible ordinals for Gödel's L?

Suppose you have a system X=$KP$ + infinity plus $\Sigma_{3}$-collection and $\Delta_{2}$-specification. May $L_{\delta}\vDash X$ for some $\delta$ smaller than all $\Sigma_{3}$ admissible ordinals?
9
votes
1answer
327 views

singularize the least inaccessible?

Is it consistent that there is some partial order $\mathbb P$ and some inaccessible cardinal $\kappa$, which is the least inaccessible, such that $\mathbb P$ forces $\kappa$ to be singular while ...
13
votes
1answer
493 views

Can ZFC prove it cannot derive an inconsistency in $n$ steps?

Let $Con(\mathtt{ZFC}, n)$ denote the statement "$\mathtt{ZFC}$ cannot prove the contradiction within $n$ steps (or better within $n$ symbols) within a given proof system (say a natural deduction to ...
8
votes
1answer
397 views

Adding a real with infinite conditions

Consider the forcing $\Bbb P$ whose conditions are partial functions $p\colon\omega\to2$ with $\operatorname{dom}(p)$ a co-infinite subset of $\omega$, ordered by reverse inclusion. Does $\Bbb P$ ...
7
votes
1answer
198 views

Generic filters of inverse limits

Maybe this doubt is silly, but I do not understand the final step of the proof of Lemma 5.2 in Hamkins' paper Fragile measurability, Journal of Symbolic Logic 59 (1994) 262-282. There, $\mathbb ...