Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let textmdMA_ℵ_1 denote Martin's axiom for partially ordered sets satisfying the countable chain condition at cardinality ℵ_1. An uncountable strongly surjective real suborder is an uncountable suborder of R such that every suborder is the…
Fix an effective encoding of polynomials with integer coefficients in finitely many unknowns by finite strings over a finite alphabet (so that, for each n≥ 1, every P∈Z[x_1,…,x_n] has a code, and the coefficients and the number of unknowns…
O-minimality is a framework coming from model theory in which one can carry out analytic arguments with guaranteed tameness. By “analytic arguments” we specifically mean arguments from real or complex analysis. The success of o- minimality…
For each countable ordinal \alpha, classify the preorder on functions \varphi,\psi:\mathbb{Q}\to\alpha defined by \varphi\leq_{\alpha,\mathrm{dop}}\psi iff some dense order-preserving g:\mathbb{Q}\to\mathbb{Q} satisfies…
Let X⊆R be a measure universal set, meaning that every Lebesgue measurable subset of R with positive Lebesgue measure contains an affine copy of X. Erdős's similarity conjecture. No infinite subset of the real line is measure universal.…
Let C be a class of finite relational structures. We denote by f_C(n) the number of structures in C over the labeled set 0, …, n-1 . For any class C definable in monadic second-order logic with unary and binary relation symbols, Specker…
Let IN=1,2,3,… and let 3^X be the integer space associated with X∈ 2^IN. Using the operation ⊕ defined by A⊕ B↔ A∪ B, and writing A^⋆ for the inverse element from the preceding conjecture, define A≤ B↔ B⊕ A^⋆∈ 2^X. The partial-order…
Does every graph with chromatic number ℵ_1 contain a countable subgraph which is infinitely vertex-connected?
Is MAX(UB) a direct consequence of suitable large-cardinal axioms, where MAX(UB) asserts class many Woodin cardinals together with the stated universal-Baireness and generic-elementarity conditions for universally Baire sets?
Is ¬ square_κ^* + ¬ SCH_κ + GCH_<κ consistent for κ singular?
Let κ be a regular uncountable cardinal. Write χ(κ) for the C-sequence number of κ, and call a poset P κ-Knaster if every subset of P of cardinality κ contains a subset of cardinality κ whose distinct elements are pairwise compatible. Let…
Is pathwise connected choice in dimension two strongly Weihrauch equivalent to Weak Koenig's Lemma, as connected choice is from dimension two onwards?
Determine the reverse-mathematical strengths of Laver's labeled-linear-order theorem LAV and the Nash–Williams bqo transfinite-sequence theorem NWT.
Assume NS_ω_1 is precipitous. Is it possible to force NS_ω_1 to be non-precipitous without adding subsets of ω_1?
Question 13 (Cornelissen). Solve in integers A, B, X, Y: (A2 + B2)( A2 + 11 B2) = 9 · 25 · (X2 − 5Y 2)2 This is related to defining the integers in the rational numbers by a Σ+3 -formula, see Cornelissen-Zahidi, ArXiv:math.NT/0412473.
Assume T has NIP and that every formula \phi(x;y) with \ell(x)=1 satisfies \operatorname{vc}^{}(\phi)\le k. Does there exist, for every n, a bound k(n) such that \operatorname{vc}^{}(\phi(x;y))\le k(\ell(x)) for all formulas?
Question Positive Horn logic (pH) is the fragment of FO involving exactly ∃, ∀, ∧, =. Does the fragment pH ∧ ¬ pH have the finite model property?
Let S be an ∈-theory extending ZFC, let A be a predicate with signature ∈_A extending ∈_Δ_0, and let T_∈,A be the corresponding theory in the expanded language. AMC-spectrum conjecture. If S+T_∈,A has a model companion, then A∈spec_AMC(S).…
Let (A_i) be a family of sets with lvert A_irvert=ℵ_0 for all i, such that for any i≠ j we have lvert A_i∩ A_jrvert finite and ≠ 1. Is there a 2-colouring of ∪ A_i such that no A_i is monochromatic?
Suppose κ is singular with cofinality ω_1. Let λ=κ^+. Must square_ω_1^* hold in a forcing extension where λ is ℵ_2?