Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Should number theorists care whether their abstract structures imply strongly inaccessible cardinals, and can logic yield useful number-theoretic results or clarify the strength of Fermat's Last Theorem over Peano Arithmetic?
Let E be pmp and G a Borel graphing of E. Does G contain Borel subgraphings (of E) whose cost is arbitrarily close to the cost of E?
Let LSA denote the theory “AD^+ + θ_β+1+θ_β is the largest Suslin cardinal.” Here Con(T) and Con(PFA) express the consistency of T and PFA, respectively. Consistency-strength conjecture. Con(T)⇒Con(LSA) and Con(PFA)⇒Con(LSA). The…
What does it mean, however, if no such generalization exists? Can we find a reasonable struc- tural characterization of Borel graphs for which these general results fail? Is there a similar characterization for Borel graphs of Borel…
\begin{enumerate} \item Is u_2(ω_1)=ω_3 consistent with (sufficiently) large cardinals? \item How to increase u_2(ω_1) without collapsing ω_1 or ω_2? \end{enumerate}
Does the consistency of a strongly compact cardinal imply the consistent existence of a supercompact cardinal?
Find examples of "Non-Modular"stable theories. That is, theories whose beautiful pairs are not essentially separably categorical. Background: Probability algebras and Hilbert spaces are ω stable structures whose beatiful pairs are…
Let de 2 be finite, let appa be measurable, and let σ<appa. Write HL(d,σ,appa) for the Halpern–Läuchli property for d many regular trees of height appa and σ colors. Consistency-strength conjecture. The consistency strength of HL(d,σ,appa)…
What is the nature of the proof-theoretic ordinal (the smallest ordinal a theory cannot prove well-founded) for second-order arithmetic, ZFC, or stronger theories?
Can we also reconstruct the action of Aut(A) or EEmb(A) on Ω (up to conjugation by a bijection), thus recovering A up to bi-definability? However, it is currently an open problem whether \omega-categorical structures with no algebraicity…
Determine the provability/unprovability phase transition for the additive-norm finite-well-ordering assertions FWO_N(F) below \varepsilon_0, where FWO_N(F) requires a descending pair in every sufficiently long sequence whose i-th ordinal…
What is the nature of the proof-theoretic ordinal (the smallest ordinal a theory cannot prove well-founded) for second-order arithmetic, ZFC, or stronger theories?
Let α=ω^ω. For every red/blue coloring of the edges of the complete graph K_α, there is either a red copy of K_α or a blue copy of K_3.
Let k be an abstract elementary class. Large-cardinal dichotomy conjecture. For a closed unbounded class C of cardinals, the alternatives stated in the source should hold: (1) the promised conclusion of Theorem 28 can be obtained with C an…
Over RCA_0, does the Furstenberg–Zimmer structure theorem imply Π^1_1-CA_0?
Let φ be an untranscendable linear order. A linear order is strongly indecomposable when [the source context does not provide a definition]. An uncountable real type is the order type of an uncountable subset of R. The Trichotomy…
Is there a model of set theory in which the universality number u(T_{\aleph_1}) of trees of size \aleph_1 without an \aleph_1-branch equals 1?
In logic, a true/false decision problem is decidable if there exists an effective method for deriving the correct answer. Logical systems are decidable if membership in their set of logically valid formulas can be effectively determined.…
Let \widetilde{\varphi} be a \Delta^{1}{3}-scale on a good universal \Pi^{1}{2} set, and let O_{\Sigma^{1}{3},\widetilde{\varphi}} be the corresponding universal \Sigma^{1}{3} set relative to the scale. Does…
Let G be a locally compact Polish group, and call a subset of G topologically universal if every dense G_δ subset of G contains its image under an affine transformation. Locally compact Polish-group conjecture. There is no uncountable…