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

1
vote
0answers
4 views

Existence of $\kappa$-Suslin trees above a measurable cardinal

We have learned from Joel David Hamkins and Monroe Eskew that: Answers: Having a measurable cardinal $\delta$ we can force a $\kappa$-Suslin tree for many $\kappa$'s above $\delta$. But is the ...
3
votes
1answer
72 views

Infinite non-splittable graphs

Let $G=(V,E)$ be a graph. For $v\in V$ we set $N(v)=\{w\in V:\{v,w\}\in E\}$. We say that $G$ is splittable if there are $S,T\subseteq V$ with $S\cap T=\emptyset$ and $S\cup T = V$ such that for all ...
11
votes
2answers
618 views

Applications of set theory in physics

In the introduction of the paper "Links between physics and set theory", the following quote of Eris Chric is stated: ...
4
votes
0answers
39 views

Consistency strength of $\aleph_2$-Souslin hypothesis

Question 1. What is known about the consistency strength of $\aleph_2$-Souslin hypothesis? Question 2. What is known about the consistency strength of having both $\aleph_2$-Souslin hypotheis and ...
95
votes
12answers
18k views

Knuth's intuition that Goldbach might be unprovable

Knuth's intuition that Goldbach's conjecture (every even number greater than 2 can be written as a sum of two primes) might be one of the statements that can neither be proved nor disproved really ...
6
votes
1answer
500 views

A question on rank-to-rank embeddings

Consider a non-trivial elementary embedding $j:V_\lambda\to V_\lambda$ and, for each $A\subset V_\lambda$, set $j(A)=\bigcup_{\delta<\lambda}j(A\cap V_\delta)$. In Implications between strong ...
5
votes
0answers
121 views

Can the first ordinal in which $V\neq HOD$ be $\aleph_\omega$?

Assume that $V\neq HOD$ and let $\kappa = \min \{\alpha\in On \mid \mathcal{P}(\alpha) \not\subseteq HOD\}$. Clearly, $\kappa$ is a cardinal. Question: Is it consistent that $\kappa = ...
7
votes
1answer
187 views

Notions of infinity in $\mathsf{ZF}$ without choice

Consider the following statements about a given set $X$ in in $\mathsf{ZF}$: (1) There is $x_0\in X$ such that there is a surjective map $\varphi: X\setminus\{x_0\}\to X$. (2) There is an injective ...
0
votes
1answer
187 views

Definable surjections in $J$-structures

Recall that a $J$-structure is an amenable structure of the form ($J_{\alpha}^A,B$) where $A$ and $B$ are predicates and $\alpha$ is a limit ordinal. Then if you let $M=J_{\alpha}^A$, there is a ...
55
votes
17answers
6k views

Proofs of the uncountability of the reals.

Recently, I learnt in my analysis class the proof of the uncountability of the reals via the Nested Interval Theorem. At first, I was excited to see a variant proof (as it did not use the diagonal ...
6
votes
0answers
128 views

A generalization of SOCA

Roughly speaking, SOCA (Semi Open Coloring Axiom) says that for an open coloring of the unordered pairs over an uncountable separable metric space you can always find an uncountable homogeneous subset ...
6
votes
2answers
140 views

Reference for proof that consistency of $\omega_1$-Erdos cardinal implies Con(Chang's Conjecture)

What is a good source for Silver's proof (or a more modern version) that Con($\exists \omega_1$-Erdos cardinal) implies Con(Chang's Conjecture)? Silver's original proof seems to have never been ...
0
votes
0answers
47 views

Number of “small” subsets to a “large” set [migrated]

For the following we assume the axiom of choice. Let $X$ be a set of cardinality $l$ for some infinite cardinal number $l$, and let $p(X)$ be the number of subsets of $X$ that have cardinality ...
29
votes
2answers
895 views

Does an existence of large cardinals have implications in number theory or combinatorics?

Does an existence of large cardinals have implications in more down-to-earth fields like number theory, finite combinatorics, graph theory, Ramsey theory or computability theory? Are there any ...
11
votes
1answer
211 views

A classic cardinal characteristic of the continuum in disguise?

We believe the answer to the following question, that is relevant to a joint research project with Piotr Szewczak, should be known. We would appreciate any help or pointer. Needed definitions may be ...
1
vote
0answers
147 views

In set theory, is there a name for a function which maps the empty set to zero and all the others to one? [closed]

I would like to avoid inventing something which might be standard. Thus, I'am asking if there is a name for a function which is defined as $f$: Let $S$ be any set, then $f(S)=0$ if $S$ is empty and ...
3
votes
0answers
118 views

A property of the Frechet filter and every ultrafilter

(Joint question with Piotr Szewczak.) Definitions and notation. By filter we mean a filter on $\omega$ containing the cofinite sets at least. For a filter $\mathcal{F}$, let ...
-2
votes
0answers
15 views

Approximate point spectrum is complement of set of points of regular type [migrated]

I have a question concerning the approximate point spectrum of a closed linear operator. I need to show that the approximate point spectrum is the complement of the set of points of regular type, ...
8
votes
3answers
331 views

Freiling's Axiom of Symmetry Concretized

Freiling's Axiom of Symmetry says that for any function $f:[0,1]\to \mathcal{P}([0,1])$ such that for every $x\in [0,1]$ we have $|f(x)|=\aleph_0$, then there exist $y,z\in [0,1]$ such that $z\notin ...
13
votes
7answers
1k views

Finding the largest integer describable with a string of symbols of predefined length

(This question is motivated by the reading of the article Large numbers and unprovable theorems by Joel Spencer, which can be found at ...
13
votes
4answers
1k views

Is there a natural bijection from $\mathbb{N}$ to $\mathbb{Q}$?

In a conversation where it came up that the Pythagoreans probably found an enumeration of the rational numbers I erroneously remarked that Georg Cantor found a natural bijection from $\mathbb{N}$ to ...
8
votes
2answers
232 views

A question about the Ordinal Definable elements of Power Sets

Assume that we are working in a set theory T, formalized in the language of ZFC, whose axioms---in addition to those of ZFC---include also the negation of "V=OD". For any set X, let CARD(X) denote ...
4
votes
1answer
306 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 ...
11
votes
1answer
466 views

Analogues of Primitive Recursive Functions

Let $\mathbf{A}$ be an admissible set (possibly with urelements). I am wondering if there is some good notion of "primitive recursive arithmetic" relative to $\mathbf{A}$. More precisely, I would like ...
3
votes
0answers
158 views

What algebraic identities does the iteration of forcing operation satisfy?

Let $G$ be the set of all formulas $\phi(x)$ in the language of such that $ZFC\vdash\exists x\phi(x)$ exists, $ZFC\vdash\phi(x)\rightarrow``x\,\textrm{is a complete Boolean algebra}"$, ...
8
votes
2answers
284 views

For a partition of $\mathbb{R}$ into countably infinite sets, must there be an almost-disjoint family of $2^{\frak c}$ many selectors?

My question arises from a construction I gave in my recent answer to a question of Alexander Pruss concerning large families of independent non-measurable sets of reals. In that argument, using the ...
5
votes
2answers
546 views

Consequences of ZF+“all subsets of reals are Lebesgue measurable”

(I'm not sure if this is entirely suitable here so feel free to close it if it's not.) The statement "there is a Lebesgue measure on $\mathbb{R}$($2^\omega$)" means: there is a total $\sigma$-additive ...
4
votes
1answer
186 views

$\text{ZFGC}^{\text{−f}}+\text{BAFA}+\exists\kappa(κ \text{ is Reinhardt})$ and its implication

A. S. Daghighi, M. Golshani, J. D. Hamkins, and E. Jeřábek proved in "The foundation axiom and elementary self-embeddings of the universe" that, working in ZFGC$^{\text{−f}}$+BAFA, there are ...
5
votes
0answers
426 views

Continuous images of Cantor cubes

The original title of this question was "Is there only one (up to homeomorphism) zero-dimensional homogeneous dyadic space of weight $\mathfrak{c}$?". I changed it with the hope of getting a bit more ...
0
votes
2answers
112 views

Surjectivity from union of a set system to the set system

Let $\mathcal{A}$ be a non-empty systems of non-empty sets such that there is an injective map $f:\bigcup \mathcal{A}\to \mathcal{A}$ such that $a\in f(a)$ for all $a\in\bigcup\mathcal{A}$. Assuming ...
8
votes
2answers
218 views

Images of $\{0,1\}^\kappa$

Is there a compact topological space $(X,\tau)$ such that for no cardinal $\kappa$ there is a surjective continuous map $e:\{0,1\}^\kappa \to X$? (We assume that $\{0,1\}$ is endowed with the ...
2
votes
0answers
272 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 ...
36
votes
7answers
3k views

Is the ultraproduct concept fundamentally category-theoretic?

Once again, I would like to take advantage of the large number of knowledgable category theorists on this site for a question I have about category-theoretic aspects of a fundamental logic concept. ...
10
votes
4answers
699 views

On surjections, idempotence and axiom of choice

The following assertion is trivial in ZFC, or even in much weaker theories. Is it also true in ZF? (I couldn't find it in the Consequences site so far.) If $A$ is an infinite set such that $A$ ...
1
vote
0answers
118 views

Surjective marriages

Let $M, W\neq \emptyset$ be sets and $K\subseteq M\times W$. We say that $(M, W, K)$ has a marriage if there is an injective function $f:M\to W$ such that $f\subseteq K$. If $(M,W, K)$ has a ...
6
votes
1answer
155 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 ...
8
votes
1answer
323 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 ...
7
votes
2answers
468 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 ...
6
votes
3answers
231 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
1answer
189 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 ...
4
votes
1answer
121 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)$ ...
5
votes
0answers
105 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 ...
22
votes
3answers
1k views

Definable collections without definable members (in ZF)

Denote Zermelo Fraenkel set theory without choice by ZF. Is the following true: In ZF, every definable non empty class A has a definable member; i.e. for every class $A = \lbrace x : \phi(x)\rbrace$ ...
14
votes
2answers
494 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 ...
2
votes
1answer
106 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?
10
votes
0answers
226 views

full support iteration of semiproper forcings

Suppose $\langle P_\alpha,\dot{Q}_\alpha:\alpha\leq\omega_1\rangle$ is a full support iteration of (semi)proper forcings. Is the full limit $P_{\omega_1}$ (semi)proper or at least stationary set ...
8
votes
2answers
225 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 ...
9
votes
1answer
330 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$ ...
54
votes
13answers
10k views

Logic in mathematics and philosophy

What are the relations between logic as an area of (modern) philosophy and mathematical logic. The world "modern" refers to 20th century and later, and I am curious mainly about the second half of ...
7
votes
1answer
236 views

Foundation scheme for $\Sigma_{n+1}$-formulas

I have trouble working out a proof in the second part of Jean-Pierre Ressayre and Alex Wilkie. Modèles non standard en arithmétique et théorie des ensembles. Publications ...