Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Question 1 (Shlapentokh, Eisentr¨ ager). Let K be a number field. (a) Does there exist a ( ∀x)( ∃~y)-formula θK (x) such that θK (a) ⇐⇒ a ∈ O K?(b) Same question with Z in place of OK.(c) Does there exist a ∀-formula ϕK (x) such that θK…
Determine the reverse-mathematical strengths of Laver's labeled-linear-order theorem LAV and the Nash–Williams bqo transfinite-sequence theorem NWT.
Let a Specker order and the orders I,J be as described immediately before the statement. Let T be an Aronszajn tree, let c:T→ 2, and write ≤_T for its tree order. Shelah's consistency conjecture. It is consistent that any Specker order…
Determine all sequences unavoidable over an arbitrary constructive L-theory including bar induction; in particular, the report conjectures that the Brouwerian theory T2 described there is recursively acceptable.
For the classical realizability topos K obtained from the coherence-space domain equation, is K two-valued, and does dependent choice continue to hold when the domain D is restricted to computable elements?
Given A\subseteq\omega_1, what is the least Lévy-hierarchy complexity of a parameter-free formula \Phi(x) such that one can pass to a stationary-set-preserving set-forcing extension in which A is defined by \Phi over \langle…
Question 8 (Pasten). Do we know an r.e. subset of Q which is not diophan-tine? There is some evidence that Z is not diophantine, but we have no proof yet. What is the "thinnest" subset of Q known to be diophantine? Does Bombieri-Lang imply…
Let E be treeable. \begin{enumerate}[a. ] \item Is every finite index extension of E treeable? \item What if we only require a μ-measurable treeing. \end{enumerate}
A Suslin ccc poset is a poset that is Suslin and satisfies the countable chain condition. It is correctness preserving if, whenever ⟨mathdsP_0,mathdsP_1,mathdsQ_0,mathdsQ_1⟩ is a correct diagram, the diagram…
Is the theory of the field of Laurent series over Z_p decidable? of the field of polynomials over C?
Does there exist a model N of ZFC such that, for every cardinal λ of N and every generic H⊆Col(ω,λ), the forcing extension N[H] is elementarily equivalent to N? Also, does such a model exist if the requirement is imposed only when H…
Let λ and κ be cardinals, with λ=λ^<λ>κ^+, κ=cf(κ), and λ≠ℵ_1. The weaker alternative allows λ≥beth_ω instead of λ≠ℵ_1. Write (Dℓ)_S^λ_κ for the corresponding diamond-like principle on S^λ_κ. The conjecture. Under these cardinal-arithmetic…
Let F/K and F′/K′ be function fields in one variable, with K and K′ relatively algebraically closed in the respective fields, and let G_{F/K}, G_{F′/K′} be the corresponding relative absolute Galois groups. Conjecture: the canonical map…
Is the forcing axiom for proper posets of size ℵ_1 with ℵ_2-many dense sets consistent? If so, what if we replace the size ℵ_1 with size ℵ_2.?
Is it consistent that the tree property holds at \aleph_{\omega+1} while the Singular Cardinal Hypothesis fails at \aleph_\omega?
Let κ be an infinite cardinal and put λ=κ^+. Define u_2(κ)=sup(λ^+)^L[A]:A⊆κ. \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?…
For any finite sets X and Y of published mathematical theorems expressible in second-order arithmetic, is either RCA_0+X interpretable in RCA_0+Y, or RCA_0+Y interpretable in RCA_0+X?
Is the constructive equivalence generated by adding abbreviations, logical constructors, unique-existence terms, and standard sorts such as subsorts, quotient sorts, finite products, and finite disjoint unions the same as constructive…
Question 14 (Pasten). Existential undecidability of K(t) in the language {0, 1, +, ·, T } where T (f ) ↔ f 6 ∈ K? This question is open for every field K.
Under the report's setting of PFA, η_C denotes a universal Aronszajn line. Is it provable that either the universality of η_C or the assertion that Aronszajn lines are well quasi-ordered by embeddability implies |ℝ|≤ℵ₂?