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
157 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
547 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
152 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
221 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
220 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
325 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
474 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
392 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 ...
1
vote
1answer
84 views

On whether a formula of KP is $\Pi_3$

In the context of KP, is the formula $\forall w(w\in x \leftrightarrow\forall y\exists z F(w,y,z))$ $\Pi_3$ when $F(w,y,x)$ is $\Delta_0$?
0
votes
4answers
240 views

Approximating an arbitrary $\sigma$-algebra by simpler $\sigma$-algebras

A $\sigma$-algebra $\mathcal F$ over $\Omega$ is generated by an countable partition if there exits a countable partition $\mathcal B = \{ B_i \}$ of $\Omega$ such that $\mathcal F = \sigma(\mathcal ...
7
votes
1answer
296 views

Infinite graphs isomorphic to their line graph

The only finite connected graphs $G$ that are isomorphic to their line graph $L(G)$ are the cycle graphs $C_n$ (see this link for example). There are connected countable graphs that are isomorphic to ...
5
votes
2answers
556 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
0answers
125 views

a game with generic filters

The present question is a follow-up to this one. Assume GCH holds in $V$ and suppose $G \subseteq Add(\omega_1,\omega_2)$ is generic over $V$. For any $g \subseteq Add(\omega_1,\alpha)$ in $V[G]$ ...
10
votes
2answers
430 views

Is there a compendium of the consistency strength between the most important formal theories?

Preliminar Notions: A formal system is a tuple $(\Sigma,G,A,R)$ where $\Sigma$ is an alphabet (set of symbols), $G$ is a formal grammar on $\Sigma$ that generates a formal language $L$ (set of well ...
4
votes
1answer
121 views

Infimum of partitions

Let $X\neq\emptyset$ be a set. A partition is a subset $P\subseteq {\cal P}(X)\setminus \{\emptyset\}$ such that $\bigcup P = X$ and any distinct members of $P$ are disjoint. We denote by ...
14
votes
1answer
655 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 ...
4
votes
2answers
282 views

Limits of determinacy on reals

For $X\subseteq\mathbb{R}^\omega$, say that $X$ is determined if the associated game on $\mathbb{R}$ of length $\omega$ (players I and II alternate playing reals, player I wins iff the sequence built ...
7
votes
1answer
378 views

Is the functor of points of a scheme cofinally small?

Background: In functorial algebraic geometry one would like to consider the category of all functors $\mathsf{CRing} \to \mathsf{Set}$ and define/characterize the category of schemes as a full ...
6
votes
0answers
177 views

Core model for supercompact cardinals and iteration trees

I have a few somehow related questions: Question 1. What do we expect for an inner model $\mathcal{K}$ to be a core model for a supercompact cardinal? What properties should it have, and what ...
9
votes
0answers
118 views

Is it possible that all ultrafilters are determined by the meet-semilattice of sub-ultrapowers?

Suppose that $\mathcal{Z}$ is a filter on a set $X$. Let $\Pi(X)$ denote the lattice of all partitions of the set $X$. Then $(\Pi(X),\wedge)$ is a meet-semilattice where $P\wedge Q=\{R\cap S|R\in ...
6
votes
0answers
218 views

$\delta$-strong compactness and generalized strong tree properties

Are there non-trivial equivalent characterizations of $\delta$-strongly compact (and almost strongly compact) cardinals in terms of generalized tree properties? Recall the definitions as per Joan ...
5
votes
2answers
282 views

The 'class version' of almost disjoint sets: can it fail?

I have a question about 'class versions' of almost disjoint sets. To even state what I'm after, I need to go beyond what one can state in theories like NBG or MK. I'm wondering about the status ...
3
votes
1answer
259 views

Cardinality of an ultraproduct

Given structures $A_i$ each of cardinality $<\kappa$ where $\kappa$ is a measurable cardinal, the cardinalities of the $A_i$ are not uniformly bounded by a cardinal $\lambda <\kappa$, and ...
6
votes
1answer
225 views

Are two forms of the Dual Schroeder-Bernstein property equivalent?

We know the Shroeder-Bernstein (SB) theorem can be proved in ZF, while the Dual Schroeder-Bernstein (DSB) can be proved in ZF+AC but not in ZF. Define as ISB the property that whenever there are both ...
13
votes
3answers
539 views

Products of Cohen forcings

Let $\lambda$ be an infinite cardinal. Does the full support product of $\lambda$ copies of $Add(\omega, 1)$ collapse $2^\lambda$ to $\aleph_0$? For $\lambda = \omega$, it is known to be true (it is ...
4
votes
1answer
435 views

Did Brouwer evade uncountability?

I have the distinct memory of having often heard and read that intuitionism was inter alia geared to avoid Cantor's uncountable sets, and it may be that this was Brouwer's plan. But are there accounts ...
1
vote
3answers
596 views

Brouwer vs. Cantor

Brouwer criticises Cantor e.g. in Intuitionistiche Mengenlehre. Is there a link or reference to some streamlined modern account of Brouwer's ideas?
2
votes
1answer
351 views

A question regarding the Hahn-Banach theorem

Wikipedia states that, in $ZF$, the Axiom of Choice ($AC$) implies the Hahn-Banach theorem, but that the Hahn-Banach theorem does not imply $AC$. It also states that in $ZF$, the Hahn-Banach theorem ...
2
votes
1answer
99 views

Minimality condition in a certain class of hypergraphs

A hypergraph is a pair $H=(V,E)$ such that $V$ is a (possibly infinite) set and $E\subseteq \mathcal{P}(V)$. $C\subseteq E$ is said to be a cover if $\bigcup C = V$ and $C$is minimal if $C'\subseteq ...
14
votes
2answers
472 views

Preservation of properness

Suppose $\mathbb P$ is a countably closed forcing, and $\mathbb Q$ is a c.c.c. forcing that adds reals. Is $\mathbb P$ still proper in $V^{\mathbb Q}$?
3
votes
1answer
270 views

Some questions on (non)-measurable sets without AC

In his answer to a Math Stack Exchange question of Katlus, Asaf Karagila wrote the following: "It is a theorem that from $ZF+DC+$"$\aleph_1$$\le$$|$$\mathbb R$$|$" we can prove that there is an ...
11
votes
1answer
230 views

counterexample regarding quotient algebras in forcing

Suppose $A$ and $B$ are complete subalgebras of a complete boolean algebra $C$. Let $G \subseteq A$ be generic. In the extension $V[G]$, we can define the quotient algebras $B/G$ and $C/G$ in the ...
8
votes
1answer
263 views

What is known about global well ordering of classes in Gödel-Bernays?

I would like to have something like a linear order on classes, such that every instantiated predicate of classes has a minimal instance in that order. For my purposes, it is fine to assume V=L for ...
6
votes
1answer
127 views

Strongly minimal covers

Let $H=(V,E)$ be a hypergraph, that is $V$ is a set and $E\subseteq \mathcal{P}(V)$. We say that $C\subseteq E$ is a cover of $H$ if $\bigcup C = V$. A cover $M\subseteq E$ is said to be strongly ...
25
votes
5answers
1k views

Forcing as a replacement of induction and diagonal arguments

Let me give some examples motivating the question. The use of forcing instead of induction: For this consider Cantor's theorem: Theorem 1. Any two countable dense linear orders $I, J$ without end ...
6
votes
0answers
241 views

A new cardinality living in every forcing extension?

This question is motivated by the papers http://arxiv.org/abs/1405.7456 and http://arxiv.org/abs/1410.1224. Say that a set $X$ is "generically presentable" over $V\models ZF$ if there is some ...
2
votes
1answer
231 views

Is there a name for this cardinal?

Let $X$ be a set and $\omega$ be a family of its subsets. Consider the family $\mathcal{F}$ of subsets of $X$, such that any $A\in\mathcal{F}$ has a non-empty intersection with each element of ...
2
votes
0answers
48 views

Optimal tiling for a collection of partitions

I'm interested in a possible generalization of Tiling relation on the set of partitions (the question has only been partially answered). Let $x$ be an infinite set and let $\text{Part}(x)$ be the ...
4
votes
1answer
100 views

Tiling relation on the set of partitions

Let $x\neq \emptyset$ be a set and let $\text{Part}(x)$ be the collection of all partitions of $x$. We need the following notation. Let $P \in \text{Part}(x)$ and $t\subseteq x$. We set $$P_{[t]} = ...
2
votes
1answer
113 views

Closed sets in ordinal spaces

I'm studying the ordinal space $[0,\kappa[$ where $\kappa\neq \omega$ is a cardinal of countable cofinality and I want to know why there are in $[0,\kappa[$ two disjoint closed sets of cardinality ...
2
votes
1answer
254 views

Axiomatic ZFC Set Theory [closed]

Can the Axiom Schema of Comprehension be omitted from ZFC since it is implied by the Axiom Schema of Replacement?
1
vote
1answer
160 views

A question regarding sets of Vitali's type in models of $ZF+GCH$ where $L$$\neq$$V$

Consider sets of Vitali's type in models of $ZF+GCH$ where $L$ $\neq$$V$. Are there sets of Vitali's type in both $L$ and $V-L$? If so, is there any way one can distinguish the constructible sets of ...
6
votes
2answers
625 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 ...
3
votes
3answers
328 views

The Set-Theoretic Multiverse and Joint Embeddings

I am curious whether or not the following axiom is independent of Hamkins's axioms for the Set-Theoretic Multiverse. Hamkins's axioms can be found here on pages 1-2 and here on pages 24-26. Consider ...
4
votes
5answers
865 views

A generalized diagonal?

A simple question. Let $ f:X\to Y $ be a function and let $ E_f:=\{(x, y): f (x)=f (y)\}\subset X\times X $. What is the name of the set $ E(f) $? It would be nice to have some reference also. It ...
1
vote
2answers
288 views

What is the consistency strength of a standard model of ZF versus a transitive model?

A standard model of ZF need not be transitive, of course, and Joel David Hamkins' answer to Large cardinal axioms and Grothendieck universes gives Tarski sets as an interesting example. I should ...
1
vote
2answers
229 views

Is there a pairing function from countable ordinals to $\mathbb N$? [closed]

It is well-known that there is a computable pairing function $<\ >:\mathbb N^2\to \mathbb N$. Let $X$ be some reasonable class of countable ordinals ($\omega_1^{CK}$, $\epsilon_0$, ...
5
votes
0answers
258 views

Cardinal characteristics without choice

(I'm taking my definition of a cardinal characteristic from Blass' excellent article http://www.math.lsa.umich.edu/~ablass/need.pdf, which cites Vojtas/Fremlin/Miller; theirs is more general, but I'm ...