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

7
votes
1answer
78 views

What is the maximal number of distinct values of the product of n permuted ordinals

Because addition and multiplication of two order types are non-commutative operations, we have that for every integer n, given n ordinals, there are at most n! distinct possible values for the sum (or ...
4
votes
2answers
272 views

Exponentiation and Dedekind-finite cardinals

It is known that the sum and the product of two Dedekind-finite cardinals are also Dedekind-finite cardinals. What about cardinal exponentiation ? Question: Let A and B be two Dedekind-finite ...
6
votes
0answers
100 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 ...
4
votes
1answer
199 views

Which axioms of ZF are used for finite choice?

Apologies if this is a silly question, not an expert in set theory but just wondering about it. ZF implies finite choice. But let's suppose one wanted to work without it. The thinking here is being ...
3
votes
0answers
107 views

Ultracoproducts of C(X)-algebras

Let $X$ be a metrizable compact topological space, let $\mathcal U$ be an ultrafilter, and denote by $X^{\mathcal U}$ the ultracopower of $X$ with respect to $\mathcal U$. As a C$^*$-algebraist, I ...
5
votes
1answer
120 views

Slim Kurepa tree at a singular strong limit cardinal of uncountable cofinality

For a strong limit cardinal $\kappa$ the notion of $\kappa$-Kurepa tree is trivial: the full binary tree is a $\kappa$-Kurepa tree. Accordingly, we consider the following strengthening: A slim ...
6
votes
0answers
173 views

A question about cardinal numbers when the Axiom of Choice is absent

The Axiom of Choice constrains every set of cardinal numbers which is linearly ordered by size to be well-ordered. By contrast, does ZF-without the Axiom of Choice (but with the Axiom of ...
10
votes
0answers
192 views

Is there a “hereditary” construction for $L$?

Recall that $L$, Godel's constructible universe is constructed by defining the following hierarchy: $L_0=\varnothing$, for a limit ordinal $\delta$, $L_\delta=\bigcup_{\alpha<\delta}L_\alpha$, and ...
1
vote
1answer
147 views

Is any axiom system for sets categorical? [closed]

$ZF$ define membership by conditions demanding the existence of some constructable right-side-terms $M $ ($x \in M$). Is it meaningsful to ask for a categorical axiom system here? Shouldn't it be ...
10
votes
0answers
240 views

Ideas behind Gitik's solution of PCF conjecture

Recently Moti Gitik has refuted Shelah's PCF conjecture (see Short extenders forcings II ) by proving the following theorem: Theorem. Assuming the consistency of infinitely many strong cardinals, one ...
4
votes
4answers
895 views

How short can we state the Axiom of Choice?

How short can we state a principle which is equivalent with the Axiom of Choice under $ZF$? The principle should be a sentence in the language of set theory with only $\in$ and$=$ as extralogical ...
2
votes
2answers
191 views

Are there fragments of set theory which are axiomatized with only bounded (restricted) quantifiers used in axioms?

Bounded quantifiers in set theory are represented as $(\forall x \in S)$ or $(\exists x \in S)$. But since the modifier "bounded" brings up an association with "bounded variable", I prefer the term ...
5
votes
2answers
165 views

Iteration of Proper Forcing and Support of Master Conditions

Suppose $\mathbb{P}$ is a definable proper forcing (for instance Sacks forcing). Let $\alpha$ be some ordinal. Let $\mathbb{P}_\alpha$ be the countable support iteration of $\mathbb{P}$ of length ...
6
votes
1answer
271 views

Does OCA imply $2^{\aleph_0}=\aleph_2$?

Is it known whether Todorcevic's Open Coloring Axiom implies $2^{\aleph_0}=\aleph_2$? The only consistency proofs for OCA that I know are the following: 1) PFA implies OCA (and also ...
5
votes
1answer
226 views

Relationship between fragments of the axiom of choice and the dependent choice principles

The dependent choice principle ${\rm DC}_\kappa$ states that if $S$ is a nonempty set and $R$ is a binary relation such that for every $s\in S^{\lt\kappa}$, there is $x\in S$ with $sRx$, then there ...
7
votes
1answer
256 views

Ultracoproducts and Cartesian products

Let $X$ be a metrizable compact topological space, let $\mathcal U$ be an ultrafilter, and denote by $X^{\mathcal U}$ the ultracopower of $X$ with respect to $\mathcal U$. As a C$^*$-algebraist, I ...
0
votes
0answers
81 views

A question about ordinal numbers and sub-theories of ZF

A number of set theories have been investigated which were obtained from ZF by restricting in various ways, or even deleting, some of the axioms of ZF-such as Power set, Aussonderung, Infinity, ...
1
vote
1answer
149 views

Density with infinite cardinals [closed]

Let κ ≤ µ infinite cardinals. and lat D(µ, κ) = min{|D| : D ⊆ [µ]^κ ∧ (∀y ∈ [µ]^κ)(∃x ∈ D)(x ⊆ y)} D(µ, κ) is called the density of κ-sets of µ. 1) Suppose κ = cf(µ) < µ. prove that D(µ, κ) > ...
2
votes
2answers
229 views

Is not SH + not CH consistent?

I guess that $\lnot$SH + $\lnot$CH is consistent, but I have not found this question discussed anywhere. Is there any relatively simple model of $\lnot$SH + $\lnot$CH?
7
votes
1answer
231 views

Inaccessible becomes successor of singular

Is it possible, starting from any large cardinal assumption, to find a countably closed forcing $\mathbb{P}$ such that for some inaccessible $\kappa$, $\Vdash_\mathbb{P} "\kappa = \lambda^+$ and ...
6
votes
1answer
244 views

Partitioning $\omega_1$-branching trees of size and height $\omega_1$

Is it possible, in ZFC, to find an $\omega_1$-branching tree $(T,\leq)$ of size and height $\omega_1$ such that whenever $T$ is partitioned into countably many sets $T=\bigcup_{n<\omega} T_n$ one ...
0
votes
0answers
129 views

A not defined notion in Friedman's article about Generalized Fubini's Theorem

I intend to study Friedman's article, A Consistent Fubini-Tonelli Theorem for Nonmeasurable Functions (http://projecteuclid.org/download/pdf_1/euclid.ijm/1256047607). I think since I had a modern ...
5
votes
2answers
262 views

non-Borel set which intersects every compact in a Borel set

I remember hearing some time ago that there is a locally compact Hausdorff space $X$ and a non-Borel subset $E$ which intersects every compact set in a Borel set. (This would contradict Lemma 13.9 of ...
2
votes
1answer
186 views

Measure of the same set in different models of ZF

Let $A$ be a definable subset of $\mathbb{R}$ in $\mathsf{ZF}$, and let $\mathcal{M},\mathcal{N}\models\mathsf{ZF}$ such that $A$ is lebesgue measurable in both models. Is ...
6
votes
1answer
162 views

continuum many mutually generic filters

Given a countable model $M$ of set theory and an atomless, separative partial order $\mathbb{P} \in M$, can we construct (in the real universe) $2^\omega$ many pairwise mutually $\mathbb{P}$-generic ...
1
vote
0answers
70 views

Question on the consistency of Zermelo set theory minus specification and extensionality [closed]

Let $W=Z^{-}-Specification$ where $Z^{-}=Z-Extensionality$ and Z is Zermelo set theory. What is known about models of $W$ or $W^{+}=W+Extensionality$?
5
votes
0answers
100 views

A question about ordinal definable sets of real numbers revisited [duplicate]

Citing (almost) A question about ordinal definable real numbers If ZFC (Zermelo-Fraenkel set theory with the Axiom of Choice) is consistent, does it remain consistent when the following statement is ...
6
votes
0answers
98 views

Can $Ded(\kappa)$ be a supremum?

Definition If there is a dense linear order w/o endpoints of size $\lambda$ with a dense subset of size $\kappa$ then write $D(\kappa,\lambda)$. $Ded(\kappa)=\sup_\lambda \{D(\kappa,\lambda)\}$. It ...
1
vote
1answer
200 views

Problem of book Kunen [closed]

Suppose $P$ is a notion of forcing in $M$ such that $\left | P \right | \leq \omega_{1}$ and $P$ is ccc. Suppose further $\Diamond$ holds in $M$. How does one show that $\Diamond$ also holds $M[G]$?
2
votes
1answer
148 views

The word problem of the free left distributive algebra on one generator

A left distributive algebra is a set $A$ together with a binary operation, $\cdot$, satisfying $a\cdot(b\cdot c)=(a\cdot b)\cdot(a\cdot c)$. One important example of left distributive algebras arises ...
2
votes
3answers
271 views

Cardinality of $C^*([0,1])$ [closed]

What is the cardinality of the continuous dual of $C([0,1])$ (the set of continuous functions from $[0,1]\to \mathbb{R}$)?
3
votes
1answer
87 views

Boolean completion (of a forcing notion) isomorphic to each of its cones

Suppose $ \mathbb{P} := (P, {\leq_P}, 1_P) $ is a separative partial order. Let $ \mathbb{B} := \operatorname{RO}(\mathbb{P}) $ denote the Boolean completion. Fix some dense embedding $ i \colon P ...
4
votes
1answer
308 views

Set-theoretic tautologies

Let us consider unquantifed formulas of a set theory (for example, NBG), more precisely, the formulas, constructed from variables and the constants $\emptyset, V$ (the empty set and the class of all ...
4
votes
1answer
175 views

forcing square with small conditions

In the paper, Large cardinals and definable counterexamples to the continuum hypothesis, Foreman and Magidor mention a way to force $\square_{\omega_1}$ with countable conditions. (This is used in ...
4
votes
2answers
162 views

Borel Sets in Sacks Generic Extension

Let $\mathbb{S}$ denote Sacks forcing. This is forcing with perfect trees or equivalently forcing with uncountable Borel subsets of ${}^\omega 2$ with the relation $\subseteq$. Let $G \subseteq ...
6
votes
2answers
400 views

Can we define an “empirically generic” real number?

Summary: My question, in a nutshell, is how we should intuitively imagine a generic real number (as opposed to a random one), and whether we can construct numbers which empirically behave like generic ...
5
votes
1answer
307 views

Embeddings of forcing notions - preserve properness?

Let $ M $ be a countable, transitive model for $ \mathsf{ZFC}^* $, i.e. for a sufficiently large finite fragment of $ \mathsf{ZFC} $. Suppose that $ \mathbb{P} := (P, {\leq_P}, \mathbb{1}_P) \in M $ ...
7
votes
0answers
110 views

Without AC, which implications between the different definitions of amenability still hold?

More precisely, I would like to know which implications between the following definitions of amenability of a discrete countable (or even finitely generated) group can be proved to hold with only ZF ...
4
votes
1answer
148 views

Is it compatible with ZF to assume that every amenable discrete group is finite?

The question is in the title, amenability being understood as the existence of a left-invariant finitely additive probability measure on the group of interest. The case of countable groups is treated ...
4
votes
1answer
245 views

How do we know if Vaught's Conjecture is Absolute?

Please note that this might be some confusion on my part about the work surrounding Vaught's conjecture. First of all, Vaught Conjecture states that if a first-order complete theory $T$ in a ...
8
votes
2answers
223 views

A Weakening of the Tree Property

If $f$ and $g$ are two functions, define $f \sim g$ if they differ only finitely often on their common domain. The following property of a large cardinal arose from a problem in model theory. I am ...
-5
votes
1answer
135 views

Does an arbitrarily selected infinite number of integers form a set? [closed]

A serial of arbitrarily selected infinite number of integers S = {I1, I2, ...} (not sorted) is a subset of the set of all the integers. But is it a set? If yes, could we determine whether the ...
4
votes
1answer
259 views

Question about “Coding the universe”

The following is a result which I know as a weak form of Jensen's coding lemma$^*$ (first published in the book "Coding the universe"; also see http://www.jstor.org/stable/2273986): For any class ...
2
votes
1answer
126 views

Kunen's inconsistency concerning $L$

A famous result by Kunen regarding elementary embeddings states that there is no such embedding from $V$ onto itself which would be non-trivial. It's clear that if $V=L$ then there is also no ...
7
votes
1answer
116 views

Strongly compact cardinal with bad covering properties

This is a continuation of the question covering properties of strongly compact embedding. Recall that a cardinal $\kappa$ is $\nu$-strongly compact cardinal if there is an elementary embedding ...
15
votes
0answers
367 views

If all reals are generic, is the set of reals generic?

Let $W\subseteq V$ be two models of $\sf ZFC$ with the same ordinals. Is the following situation consistent: For every $x\in\Bbb R^V$ there is some $P_x\in W$ such that for some $G\subseteq P_x$ ...
10
votes
1answer
572 views

Harrington's unpublished note “The constructible reals can be anything”

Around 1974, Leo Harringto wrote an unpublished note entitled "The constructible reals can be anything", in which he proved that it is consistent that being $\Delta^1_n$ is the same as being ...
6
votes
2answers
532 views

Is there one binary operation foundational for set theory?

The membership relationship "$\epsilon$" is foundational for set theory, in the sense that the axioms of any set theory are formulated in the language of "$\epsilon$". Naturally, the question arises ...
5
votes
1answer
135 views

A realcompact analogue of the Baire category theorem

Let $\frak{m}$ be the least measurable cardinal. A space $X$ is realcompact if it is homeomorphic to a closed subset of some product $\mathbb{R}^I$. Let $X$ be realcompact with $P_\frak{m}$ topology, ...
7
votes
2answers
193 views

Does forcing with recursively pointed perfect trees add a Turing degree that is minimal over $V$?

A tree $T$ on $\omega$ is recursively pointed if it is recursive in each of its branches. We can consider a variant of Sacks forcing where the conditions are recursively pointed perfect trees ordered ...