Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let L be a first-order language with countably many symbols, and let T be a complete L-theory having infinite models. For a cardinal α, let I(T,α) denote the number of isomorphism classes of models of T of cardinality α, i.e. the…
For every pair of linear orders A and B and every n,m,k,l∈N_≥ 1, if the ordered sums satisfy nA+mB≅ kB+lA, where nA denotes the ordered sum of n copies of A, then A+B≅ B+A.
Is it consistent to have the failure of both SCH and square_ℵ_ω^*?
Suppose κ has the strong tree property. Does SCH hold above κ? (If yes, then the strong tree property at ℵ_2 implies SCH.)
Question 6. Is there a computable section?
Suppose there is no inner model with a Woodin cardinal, and κ is a singular strong limit of uncountable cofinality, with 2 κ = λ, some regular λ > κ +.Must o(κ)K ≥ λ?A negative answer may have applications in pcf theory. Known below 0 ¶…
Work of Nies, Schlicht, and Tent [9] showed that topological iso- morphism on oligomorphic groups is Borel reducible to a Borel equivalence relation with countable classes, but the question of whether this isomorphism relation is smooth…
What is the μ-measurable chromatic number of G?
Conjecture. Jonathan Kirby then introduced the classes of exponentially-algebraic functions and presented results investigating when such functions appear as solutions of algebraic differential equations. Peter Jossen delivered the final…
Let G_ω_2 be a (V, P_ω_2)-generic filter, and consider the model V[G_ω_2] constructed in the proof of Theorem. A Shelah–Steprāns almost disjoint family is an almost disjoint family of infinite subsets of ω with the Shelah–Steprāns…
In Martin-L\ddot{o}f type theory, what mathematical objects or formal mechanisms could serve as partial proofs, analogous to the partial functions used in the predicative construction of Mahlo universes?
Question 14 (Cornelissen). Jeroen Demeyer has observed that the existence of a polynomial bijection N2 → N implies that any first order formula over N in positive prenex form is equivalent to one in which every block of consecutive…
Question 19. Let T be a decidable theory having countably many countable models. What do we need to know to build a computable prime model of T? (Of course ω-stability again suffices.) 1.11. Turing degrees of DCFs (Calvert).
Question 36 (Jarden). Given f_1,…,f_n∈ C[x_1,…,x_m] which are homogeneous of degree d, assume that their only common zero is (0,…,0). Prove that V(f_1(vec x)=b_1,…,f_n(vec x)=b_n) is finite for all b_1,…,b_n∈ C.
Is the open mapping theorem for separable Banach spaces provable in RCA_0, or at least in WKL_0?
Assume K is the class of models of a countable first order theory omitting countably many types. If K has a model of cardinality ℵ_ω_1 does it have a model of cardinality continuum?
Work in ZFC. For a cardinal κ let κ^+ denote the least cardinal greater than κ, let cf(κ) denote the cofinality of κ, and let 2^κ = |P(κ)| denote the cardinality of the power set of κ. Call a cardinal κ singular if cf(κ) < κ, and call κ a…
Let c be the ordinal of the real numbers, β be any countable ordinal, and 2≤ n<ω. Is it true that c→ (β, n)_2^3?
What is the consistency strength of E_{\omega_1}\leq_{a\Delta^1_1}F_{\omega_1}, and does such an almost \Delta^1_1 reduction imply the existence of a real whose admissibility spectrum is sufficiently spread out to make its admissible…
Determine which countable ordinals β have the following property: if α=ω^β, then every red/blue coloring of the edges of the complete graph K_α contains either a red copy of K_α or a blue copy of K_3. Here countable means |β|≤ℵ_0.