2
votes
2answers
110 views

Coding Forcing Notions by Ordinal Numbers: A Possible Approach to Shelah-Foreman-Magidor Conjecture

Forcing notions are partial orders. In some sense each partial order is a "combination" of some well-orderings and each well-orderings is isomorphic to a unique ordinal number. Thus in some sense a ...
13
votes
2answers
539 views

Are there any infinite sets that are not known to be either countable or uncountable?

Are there any known examples of sets that are definitely infinite, but where we don't know whether or not they're countable? I haven't heard of anything like this before, but it seems that there ...
8
votes
1answer
173 views

Independence results that cannot be established by forcing.

I read the Wikipedia article on Absoluteness recently and found mention of Shoenfield’s Absoluteness Theorem, which states that if $ \phi $ is any $ \Sigma^{1}_{2} $- or $ \Pi^{1}_{2} $-sentence of ...
4
votes
0answers
2k views

Lists of open problems in set theory

Are there any publicly available lists of open problems in set theory besides the following ones? (And if so, what are they?) http://www.math.wisc.edu/~miller/res/problem.pdf ...
1
vote
0answers
212 views

Is there a ccc but not separable space $X$ with a zeroset-diagonal, that isn't submetrizable?

Is there a ccc but not separable space $X$ with a zeroset-diagonal, that isn't submetrizable? separable = $X$ has a countable dense subset. A space $X$ has a zeroset-diagonal when there is a ...