Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
The language and proof system of non-hypothetical logic are considered over the axioms of Peano Arithmetic, denoted by PA, in a purely relational language. One may also add a fixed theorem of PA as an additional axiom. Decidability…
Prove a superpolynomial lower bound on the size of Frege proofs; in particular, do some tautologies require exponentially large Frege proofs?
Can the assumption that \kappa is measurable be eliminated from Theorem 1?
By analogy with Conjecture 2, we make the following conjecture. Conjecture 5. Assume that K = Q, with the p-adic valuation, or K = k(\pi), with K-alg (B ) is acyclic except in degree the \pi-adic valuation. Then, the complex Ω\infty−●…
For strongly surjective linear orders, is it consistent that one has size greater than \aleph_{2}? Is it consistent that one contains no minimal strongly surjective suborder? Does \mathrm{MA}{\aleph{1}} imply an uncountable strongly…
Consider the system of equations ll a_1s_1 + … + a_4s_4 = c b_1s_1 + … + b_4s_4 = d . where a_i, b_j, c,d∈ Z for all 1≤ i,j≤ 4. Suppose that this system is solvable with the s_j in Z modulo every prime p. Fix k ≥ 4, and let s_j be the j-th…
Let φ(n) be the statement “for every graph of size ℵ_ω+1, if every subgraph of size <ℵ_ω+1 has chromatic number ≤ℵ_n, then the entire graph has chromatic number ℵ_n.” Is φ(0) consistent?
A.8 Greenberg, Noam My mathematical training is mainly in recursion theory on admissible ordinals, in which fine-structural notions come into play. I am also in general interested in set theory; inner model theory in particular has some…
Question 1. Is is the case that every computable structure is com-putable approximable? Date: August 12, 2013. 1COMPUTABLE STABILITY THEORY PROBLEM SESSION 2
Over RCA_0, is Hindman's theorem equivalent to ACA^+_0, equivalent to ACA_0, or strictly between them?
Question 12 (Cornelissen). If Z admits a Diophantine interpretation in Q (that is, using an equivalence relation), does it follow that Mazur's conjecture is wrong? See Cornelissen-Zahidi, Contemp. Math. 270 253-260. 4 MODERATED BY B.…
(1) Is every valued NIP field (K,v) henselian? (2) If K is an NIP field that is neither separably closed nor real closed, does K admit a definable non-trivial henselian valuation, and is the resulting valued field NIP?
Suppose ℵ_ω is a strong limit. Is there a poset P of size <ℵ_ω, which adds a club guessing sequence for S^ω_2_ω_1, preserving ω_1, ω_2, and ω_3.
Assuming a supercompact cardinal (or another reasonable large-cardinal hypothesis), can one force Martin's Maximum together with a parameter-free definable well-order of H(\omega_2) over \langle H(\omega_2),\in\rangle? Does Martin's…
Question 2. Let ϕ ∈ L ω1,ω be a satisfiable sentence of quantifier rank α, and suppose that either ω1 > β > α or β > α + ω. Is there an M | = ϕ such that SR( M) < β? 1.2. Strongly minimal nontrivial locally modular nonorthogo-nal groups…
Is an increasing countable union of hyperfinite CBERs hyperfinite? What if we add some restrictions, e.g. involving Borel asymptotic dimension?
Assume that c? holds, let c? be ultraexacting, and let c?<c? be extendible. Ultraexacting-above-extendible rank-Berkeley model conjecture. There is a set model of ZF with a rank-Berkeley cardinal. This is the explicit formulation of the…
Boffa's conjecture: does there exist a model M of ZF, a cardinal \kappa\in M, and a nontrivial \in-automorphism \sigma of M such that 2^\kappa=\sigma(\kappa)?
Question 30 (Shlapentokh). Let K be a number field and OK its ring of integers. Fix an embedding K ↪ → C, with K 6 ⊆ R. Is {α ∈ O K | | α| ≤ 1} Diophantine in OK?If this is true for all K, then Hilbert's Tenth Problem is undecidable for…
Conjecture 21. If T is totally categorical then Spec( T ) is a cone. This is true in a finite language. COMPUTABLE STABILITY THEORY PROBLEM SESSION 5 1.13. Model theoretic consequences of Erd˝ os-Rado (Greenberg). Task 22 (Hirschfeldt).…