92
votes
26answers
9k views
What are some reasonable-sounding statements that are independent of ZFC?
Every now and then, somebody will tell me about a question. When I start thinking about it, they say, "actually, it's undecidable in ZFC."
For example, suppose A is an abelian gro …
3
votes
3answers
362 views
Undecidability and holomorphic functions (Reference request)
The goal of this question is to recall a certain mathematical fact -not in my field- that I was once briefly told and that I have fogotten, and also to collect similar results.
T …
7
votes
1answer
260 views
Nice Algebraic Statements Independent from ZF + V=L (constructibility)
Background and Motivation
I've always been fascinated about algebraic statements independent from ZFC set theory. One such fascinating example comes from considering $\rm{Ext}^1_\ …
11
votes
2answers
257 views
Spectra of elements of a Banach algebra and the role played by the Hahn-Banach Theorem.
This problem was posed on Math StackExchange some time ago, but it did not garner any solutions there. I think that it is interesting enough to be posed here on Math Overflow, so h …
6
votes
2answers
424 views
Natural statements independent from true $\Pi^0_2$ sentences
I am looking for sentences in the language of first order arithmetic ($0,1,+,\cdot,\leq$) which are independent from $\Pi^0_2$ consequences of true arithmetic $\Pi^0_2\text{-}\math …
6
votes
4answers
590 views
Formal proof of Con(ZFC) => Con(ZFC + not CH) in ZFC
Is it possible to prove $Con(ZFC) \rightarrow Con(ZFC + \neg CH)$ purely within ZFC? To prove this (using forcing) one seems to need a countable transitive model of ZFC. The texts …
5
votes
2answers
576 views
Is the Axiom of Union independent of the rest of ZF?
Short version: Is the axiom of union independent of the rest of axioms of ZF?
NO) Tourlakis (2003) says in p. 177 that the axiom of union can be derived from the rest of ZF if an …
25
votes
3answers
2k views
“Simpler” statements equivalent to Con(PA) or Con(ZFC)?
Given any reasonable formal system F (e.g., Peano Arithmetic or ZFC), we all know that one can construct a Turing machine that runs forever iff F is consistent, by enumerating the …
3
votes
3answers
679 views
Is there an “undecided” assertion of which a proof that it’s not undecidable is known?
Just a curiosity:
Is there an assertion of which a proof (formalizable, say, in ZFC) is not known but a proof that it's not undecidable (in ZFC) is known?
Edit: after the com …
-3
votes
0answers
158 views
How to find Independence number of G and its complement G'?
what is the inequality in terms of n to find the independence number of G where G is C2n+1.
what is the inequality in terms of n to find the independence number of G where G' (G c …
8
votes
4answers
690 views
Is every p-point ultrafilter Ramsey?
A non-principal ultrafilter $\mathcal{U}$ on $\omega$ is a p-point (or weakly selective) iff for every partition $\omega = \bigsqcup _{n < \omega} Z_n$ into null sets, i.e each …
10
votes
5answers
1k views
Minimal subset of axioms for ZFC
Hello all, one may look for "minimal system of axioms" for ZFC (or any other
theory) in the following (unusual) sense : say that a subset S of ZFC is
"sufficient" if there is an ex …
6
votes
3answers
550 views
Reference Request: Independence of the ultrafilter lemma from ZF
I'm looking for references for the following facts concerning the ultrafilter lemma (~ "there exist non-principal ultrafilters"):
The ultrafilter lemma is independent of ZF.
ZF …
8
votes
2answers
435 views
Statements forced by one condition of a poset, but not the whole thing
In order to get the relative consistency of some statement, it suffices to find a notion of forcing, and a condition $p$ in that forcing, such that $p$ forces the desired statement …
3
votes
2answers
459 views
A problem about posets similar to Suslin’s problem
Suslin's problem is:
Given a complete dense linear order without endpoints, if it has the ccc must it be isomorphic to $\mathbb{R}$?
The answer is that it's independent of ZF …

