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 relations,...

learn more… | top users | synonyms

3
votes
1answer
129 views

What kind of set theory is obtained from the canonical models of K?

Consider the minimal normal modal logic $K$ (axioms = classical propositional logic + $(\Box(p\land q)\leftrightarrow\Box p\land\Box q)$ + $(\Box\top)$, nothing else). Its canonical model with no ...
5
votes
1answer
312 views

Injection of the proper class of ordinals in every proper class

Is it possible to prove in the set theory NBG (with local choice but without global choice) that the proper class of ordinals injects in every proper class ?
28
votes
2answers
1k views

Should axiomatic set theory be translated into graph theory?

Recently I saw the abstract of a paper by Nash-Williams: ``Should axiomatic set theory be translated into graph theory?''. The abstract, taken from Mathscinet says the following: The author ...
5
votes
1answer
252 views

Why did Gödel name his constructible universe $L$?

It seems like Gödel didn't use the letter $L$ for his model before his book "The Consistency of the Axiom of Choice and of the Generalized Continuum-Hypothesis with the Axioms of Set Theory", which is ...
1
vote
1answer
151 views

Partial Universes and the Axioms of $ZF$ Set Theory Without Choice

In his Senior Thesis, Samuel Coskey answered the question of which axioms of $ZFC$ hold at each stage of the cumulative hierarchy. Here is the list of his results: Axioms that always hold: ...
6
votes
0answers
188 views

Tree property using side conditions

The following problems were asked during the high and low forcing workshop: Question 1. Can one force tree property at $\kappa^{++}$ for $\kappa$ singular using side conditions? Question 2. ...
7
votes
1answer
206 views

Uncountable models of Kelley-Morse set theory with only a countable number of sets

The Kelley-Morse set theory can be thought as the "full-secondorderification of $\sf ZFC$", where we switch from sets to classes and allow the comprehension schema to include quantifiers on class ...
1
vote
1answer
118 views

Without Choice: Are there filters of cardinality continuum?

Is it provable, in ZF (without Choice), that every filter can be extended to one of cardinality continuum? The extended filter is not requested to be an ultrafilter.
4
votes
0answers
222 views

Unbounded towers and combinatorial cardinal characteristics of the continuum

Update: Perhaps the question is too difficult. I would appreciate, thus, even just comments or related observations. This question assumes familiarity with combinatorial cardinal characteristics of ...
10
votes
1answer
320 views

Forcing PFA with ccc forcing

Is it consistent (from suitable large cardinals) that there is a ccc poset which forces PFA? This seems quite implausible to me. If we could force PFA via ccc forcing, the ground model would have to ...
5
votes
2answers
276 views

Why do we need a transitive model in forcing arguments?

One major approach to the theory of forcing is to assume that ZFC has a countable transitive model $M \in V$ (where $V$ is the "real" universe). In this approach, one takes a poset $\mathbb{P} \in M$, ...
5
votes
1answer
272 views

Comparing the sizes of uncountable sets of reals under AD

Working in ZF+AD, let $$\theta_0(X)=\min\{\alpha\in ON: \not\exists f: X\rightarrow \alpha\mbox{ surjective and OD}\}$$ be the least ordinal onto which $X$ does not surject in an OD way, for $X\...
22
votes
4answers
1k views

Do there exist non-PIDs in which every countably generated ideal is principal?

The title pretty much says it all: suppose R is a commutative integral domain such that every countably generated ideal is principal. Must R be a principal ideal domain? More generally: for which ...
9
votes
0answers
276 views

What ccc forcings add a Suslin tree?

In a comment to Miha's question in Forcing PFA with ccc forcing, I suggested that if such situation is even possible, it might be achieved by screwing with PFA by some ccc forcing (e.g. adding a Cohen ...
5
votes
1answer
149 views

Spreading sets - especially without choice

For what follows, I work in ZF+AD+DC. However, the questions below are not obviously trivial in ZFC, so I'm also interested in results in that system. Suppose I have a set $X\subseteq \mathbb{R}$. ...
3
votes
0answers
123 views

Compactness beyond extendibility

By a result of Magidor, $\kappa$ is extendible if and only if the infinitary $n$th-order logic over the language $L_{\kappa,\kappa}$ is compact for every $n < \omega$, where by compact, we mean ...
2
votes
1answer
138 views

How can two theories $T$ and $T+\phi$ be mutually interpretable?

Following Koellner in http://plato.stanford.edu/entries/independence-large-cardinals/, "a theory $T_1$ is interpretable in $T_2$ ($T_1 \leq T_2$) when, roughly speaking, there is a translation $\tau$ ...
10
votes
2answers
366 views

Extracting subsequences in Banach spaces, along an ultrafilter?

There are various principles in Banach space theory that allow one to pass from a given sequence of vectors $(x_n)$, to a subsequence $(x_{n_k})$ with some desired property. I'm thinking here, in ...
2
votes
2answers
210 views

Why is Random forcing with $\mathbb{R}$, $2^\omega$, $\omega^\omega$ all the same?

By random forcing, I mean the partial order of Borel sets of the given space, modulo Lebesgue null sets, ordered by inclusion. I can not find a source proving that all these partial orders are forcing ...
1
vote
1answer
265 views

Further research on $\mathrm L_{\infty}$

In the mathoverflow question , "Godel's Constructible Universe in Infinitary Logics (A Possible Solution to $HOD$ Problem), Prof Hamkins answered user46667's question 2 What is $\mathrm L_{\infty}$...
6
votes
2answers
1k views

Non Lebesgue measurable subsets with “large” outer measure

It is well known that for any set A in R^d there exists a measurable set E such that E contains A and m*(A)=m*(E). Is it possible to go the other direction? In other words, is it true that for any ...
3
votes
1answer
236 views

A question about how much set theory can be developed based on the “subset” relation rather than the “elementhood” relation

I apologize, if my question seems too elementary for "mathoverflow.net". Let T be a set theory formalized in the classical first order predicate calculus whose atomic formulas are "x is a subset of y" ...
4
votes
1answer
166 views

Preservation of Woodinness when it overlaps the active extender

I'm trying to show that if a premouse $\mathcal M$ is 1-small then it's also tame. Definition. $\mathcal M$ is 1-small if for every extender $E$ on the $\mathcal M$-sequence, $\mathcal J^{\mathcal ...
5
votes
0answers
144 views

Radin forcing and large cardinals

Assume $\kappa$ is a $(\kappa+2)$-strong cardinal and let $j: V \to M \simeq Ult(V, E) \supseteq V_{\kappa+2}$ witness this where $E$ is a $(\kappa, \kappa^{++})$-extender. Also let $u$ be the measure ...
2
votes
0answers
101 views

Can the Kunen inconsistency (or the existence of Reinhardt cardinals) be 'properly formulated' in Ackermann set theory?

In their paper "Generalizations of the Kunen Inconsistency" (arXiv:1106.1951v1 [math.LO]10 Jun. 2011), Hamkins, Kirmayer, and Perlmutter write the following: The first [metamathematical issue--my ...
14
votes
1answer
936 views

Can Vopenka's principle be violated definably?

One form of Vopenka's principle (a large cardinal axiom) states that no locally presentable category contains a full subcategory which is large (= a proper class) and discrete (= contains no ...
6
votes
2answers
534 views

An Extender is a Generalization of an Ultrafilter?

I'm not sure whether this belongs here or on math stackexchange, but I'll give a try here. I've heard that an extender is a generalization of an ultrafilter. This is not to say that an ultrafilter ...
1
vote
1answer
204 views

Well-ordering of power set of $\omega$

Assuming initially the background set theory ZF, what is the exact status of the existence of a well-ordering on the power set of $\omega$? How much needs to be added to guarantee this?
9
votes
1answer
238 views

Cofinal monotone maps from $\omega^\omega$ to $\kappa^\kappa$

Given a cardinal $\kappa$ consider the set $\kappa^\kappa$ of all functions from $\kappa$ to $\kappa$, endowed with the partial order $f\le g$ iff $f(\alpha)\le g(\alpha)$ for all $\alpha\in\kappa$. ...
7
votes
1answer
172 views

On the cardinal arithmetic of accessible categories

If $\lambda, \mu$ are regular cardinals, say that $\lambda \trianglelefteq \mu$ if $\lambda \leq \mu$ and $$\forall X, \, |X| < \mu \implies \mathrm{cf} (P_\lambda(X)) < \mu$$ Here $P_\lambda(X)...
6
votes
1answer
154 views

$\mathfrak b_a$: a new cardinal characteristic of the continuum?

By a partial function from $\omega$ to $\omega$ we understand a function $f:dom(f)\to\omega$ defined on an infinite subset of $\omega$. A family $\mathfrak F$ of partial functions from $\omega$ to $\...
-2
votes
1answer
188 views

Critical points and the Foundation Axiom

(Note: This question is related to my previous mathoverflow question, "Critical Points in $ZF$ without Choice".) In the Stanford Encyclopedia of Philosophy entry "Non-Wellfounded Set Theory" (...
5
votes
1answer
183 views

Ordinal-definable witnesses to the perfect set property?

This possibly a very basic descriptive set-theory question; if it is too basic for MO, feel free to migrate. Throughout we work in ZF+AD. My question is: If $A$ is an uncountable OD set of reals,...
5
votes
0answers
94 views

Preservation of Baumgartner's I-ultrafilters under various forcings

For $I\subset \mathcal{P}(2^\omega)$, an ultrafilter $U$ on $\omega$ is said to be an I-ultrafilter if for all $f:\omega \to 2^\omega$, there exists $A\in U$ such that $f''[A]\in I$ [Baumgartner]. In ...
4
votes
0answers
80 views

On thin $\Sigma^1_2$ equivalence relations

This question is regarding Hjorth's paper "Some applications of coarse inner model theory", J. Symbolic Logic 62 (1997), no. 2, 337–365. Hjorth claims that if $E$ is a thin $\Sigma^1_2$ equivalence ...
17
votes
2answers
1k 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 ...
9
votes
4answers
765 views

Is it inconsistent for a model of set theory to contain its own first order theory?

I am wondering if it is inconsistent to have a model of set theory V such that V contains an $A\subset \omega$ that codes its first order theory.I.e. for all $\{\underline\epsilon\}$-sentences $\phi$, ...
5
votes
0answers
110 views

Has a continuous map from $\kappa^\omega$ to $[0,1]^\omega$ a non-scattered fiber?

Question. Let $\kappa>\mathfrak c$ be a cardinal endowed with the discrete topology and $f:\kappa^\omega\to[0,1]^\omega$ be a continuous map. Is there a point $y\in[0,1]^\omega$ whose preimage $f^{-...
8
votes
0answers
179 views

What is the smallest density of a metrizable space without countable separation?

A Tychonoff space $X$ is defined to have countable separation if some (equivalently, any) compactification $bX$ of $X$ contains a countable family $\mathcal U$ of open sets such that for any points $x\...
5
votes
1answer
158 views

Bernstein sets of large cardinality

A metrizable space $X$ will be called a generalized Bernstein set if every closed completely metrizable subspace $C$ of $X$ has cardinality $|C|<|X|$. It is well-known that the real line contains ...
3
votes
1answer
218 views

A kind of saturation property related to forcing notions

Forcing is typically done over well-founded models. There are lots of good reasons for this, but it can feel confining at times. Fortunately, we can equally well force over non-well-founded models! It ...
5
votes
1answer
264 views

Intuitive descriptions of some large cardinals

I was trying to formulate intuitive descriptions of some large cardinals. Roughly something equivalent to "A manifold is an object which looks like patches of $R^n$ glued together". Not perfectly ...
8
votes
2answers
597 views

Difference between Laver's and Mathias's forcing

Mathias forcing consists of conditions of the form $(s,A)$ where $s$ is a finite subset of $\omega$, $A$ is an infinite subset of $\omega$ such that $\max(s) < \min(A)$ and $(s,A)\leq (t,B)$ iff $s\...
5
votes
1answer
250 views

Why relative consistency results by forcing arguments are provable in finitistic metatheory

It is claimed in many textbooks that relative consistency results, such as $\text{Con}(\text{ZFC})\rightarrow\text{Con}(\text{ZFC}+2^{\aleph_0}\geq\aleph_2)$, are provable in the finitistic metatheory....
3
votes
1answer
123 views

$2M = M$ and its subset

I have some question concerning arithmetic of cardinal in ZF. Write $ X = Y$ if there is a bijection between them. Let $M$ be a set such that $2M = M$. Can I show, in ZF, that any infinite subset $X$ ...
5
votes
1answer
154 views

Showing that $\alpha$ isn't a cardinal in $J_{\alpha+1}^{\vec E}$ for a fine extender sequence $\vec E$

In [FSIT] and [OIMT] it is claimed that there is a surjection from $P(\kappa)\cap J^{\vec E}_{\nu(E_\alpha)}\times[\nu(E_\alpha)]^{<\omega}$ onto $\alpha$, and that this surjection lies in $J_{\...
4
votes
2answers
263 views

Critical points in $ZF$ without Choice

Recall the definition of critical point for set theory: A critical point of an elementary embedding of one transitive class into another transitive class is the smallest ordinal not mapped to ...
7
votes
1answer
256 views

Are There Mutually Exclusive Large Cardinal Axioms in ZFC?

The various large cardinal axioms are usually described in terms of some roughly linear hierarchy of varying consistency strengths. However, some cardinal axioms potentially contradict one another. As ...
2
votes
0answers
128 views

Is there a model of ZF+ACC where transfer fails for the definable hyperreals?

A decade ago Kanovei and Shelah constructed a definable hyperreal field. The ultrapower used exploits a fairly large index set so that it is clear that the usual proof of Los and transfer does not go ...
7
votes
1answer
194 views

Definability using rudimentary function

Denote by RUD the set of all rudimentary functions, together with the function that takes any set to its transitive closure. Assume that I know that a binary relation $R$ is definable by some ...