Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Let X and Y be second countable, locally compact, noncompact spaces. Write X^*=β X∖ X and Y^*=β Y∖ Y, where β X and β Y are their Čech–Stone compactifications. A homeomorphism between these remainders is trivial when it is induced outside…
Let B_i (i<κ) be Boolean algebras, let D be an ultrafilter on κ, and let B=∏_i<κB_i/D. Write rm Depth(B) for the depth of a Boolean algebra and rm lim_D(⟨ rm Depth(B_i):i<κ⟩) for the ultrafilter limit. Assume ℵ_0=rm cf(λ)<λ, 2^ℵ_0<λ, κ<λ,…
Let J be a dense F_σδ weakly selective ideal on ω. A representation of J consists of a Polish space X with a countable base O and a σ-ideal I on X such that, under an identification of ω with O, the ideal J becomes J_I. Representation…
Question 11 (Flenner). Does there exist a formula ϕ(x, y ) such that for any finitely generated field K and every rank one divisorial valuation v on K, there exists a parameter a such that Ov = {b ∈ K | ϕ(b, a )}?
Does the generalized continuum hypothesis imply the existence of an ℵ_2-Suslin tree?
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?
Question 7. How complicated is the map ϕ 7 → dpϕ (possibly with uniformity in p)?
We conjecture that imp(P ) := [P, P ] is a jump. Consistency, implicit proofs, and cut-elimination Pavel Pudlák Mathematical Logic: Proof Theory, Constructive Mathematics 3023
Does every graph G with chromatic number at least ℵ_1 contain all sufficiently large odd cycles? Equivalently, for every vertex type V and every simple graph G on V, if G has no proper coloring with the countable set of colors N, then…
In the setting of the report's iterated elementary-embedding construction, is the cardinal \lambda weakly compact in HOD?
\begin{enumerate} \item Is the first order theory of C(t) decidable in signature with 1 and t? \item Does it help if ∂/∂ t_i is added to the signature? \end{enumerate}
Is the canonical \Gamma-field C generically \Gamma-closed, meaning that for every finitely generated \Gamma-field extension k over the prescribed closure, every irreducible n-dimensional variety V\subseteq L G^n\times G^n satisfying the…
A.10 Sargsyan, Grigor I am a second year graduate student at UC, Berkeley, and have taken inner model theory seminars with Professor Steel and Professor Woodin. Having learnt the basics of inner model theory, I hope to learn, during this…
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?
Let M/E and N/F be Borel quotient structures. Here c denotes the cardinality of the continuum, CH is the Continuum Hypothesis, and Forcing Axioms refers to the relevant forcing axioms. Meta-conjecture. The following statements hold: CH…
Let κ be a regular Jónsson cardinal. (1) Does there exist a function c:[κ]^{<κ}→κ and a uniform filter 𝓕 on κ such that, for every A∈[κ]^κ, the range of c restricted to [A]^{<ω} belongs to 𝓕? (2) Can there exist a C-system on κ with a…
Question 25 (Pheidas). Is {f ∈ C(Z) | ord Z=0 (f ) ≥ 0} (existentially) definable in C(Z),where there is a symbol for Z in the language? 6 MODERATED BY B. POONEN AND T. SCANLON, NOTES BY J. DEMEYER
The universality problem for C-free graphs: For which finite sets C of graphs does the class of C-free countable graphs have a universal member under strong embeddings?
Conjecture 1. If K is an k-dependent field (pure, or with valuation, derivation, etc.), then K is NIP. There is some mounting evidence for this conjecture: k-dependent ûelds are Artin-Schreier closed ([7], generalizing…
Question 6 (Koenigsmann). Consider the language O2 = {0, 1, +, P 2} where P2 is the set of squares. Is every ∃-O2-definable set in Q already ∃+-O2-definable? Equivalently, are the following sets ∃+-O2-definable: • { x ∈ Q | x 6 = 0 }, • {…