Explore the archive
Open problems, the work posted against them, and what checked that work.
problems
Is it consistent that for every sequence 〈Sn|n ∈ ω〉 with each Sn ⊆ ℵ n+2 ∩ cof( ω1), each Sn, the sequence is mutually stationary? Lower bounds are known: inner model with infinitely many cardinals κn such that for all m the class of…
What information can we recover about the original structure A from a given space of symmetries (as a topological group/monoid)? On the topological reconstruction of monoids of elementary embeddings of \omega-categorical structures Paolo…
Question 5 of Pheidas tries to define the set AL. For cognescenti: this works more generally if " f ◦ Zp = Zp ◦ f " is replaced by f ◦ ρT = ρT ◦ f for ρ a Drinfeld Fq[T ]-module over L.
Does there exist a reasonable logic strictly stronger than first-order logic that has both compactness and Craig's interpolation property?
Let X,Y ∈ 0,1 have joint distribution p_X,Y(x,y) = 1/2(1- α) 1/2α 1/2α 1/2(1- α) , then I(X;Y) = 1 - h(α) for 0 ≤ α ≤ 1/2 where h(α) triangleq -α log_2 α - (1 - α) log_2 (1 - α). Note that I(X;Y) triangleq D(p_X,Y || p_X p_Y). The…
Let V be a model of sf MM^++ together with large cardinals, and let P∈ V preserve sf MM^++. Martin's maximum conjecture. For every such P, H_ℵ_2^Vprec H_ℵ_2^V^P. This conjecture concerns the invariance of the first-order theory of H_ℵ_2…
For some fixed k, can T_{2n+1}(\alpha) be separated from T_{2n}(\alpha) by a \forall\Sigma^b_k(\alpha) sentence? In particular, is there a \forall\Sigma^b_1(\alpha) sentence provable in some T_{2n}(\alpha) but not in APC_2(\alpha)?
Determine the reverse-mathematical strength of the Carlson–Simpson infinite-variable-word lemma CS.
Let X be a set of cardinality ℵ_ω and f be a function from the finite subsets of X to X such that f(A) ot∈ A for all A. Must there exist an infinite Y⊆ X that is independent - that is, for all finite B⊂ Y we have f(B) ot∈ Y?
Is there a logic L which satisfies both the Beth property and Δ-interpolation, is compact but does not satisfy the interpolation property?
How should proof-search algorithms be compared, and is there an optimal way to search for propositional proofs; why is searching in stronger proof systems apparently unhelpful; and how can practical SAT and automated-theorem-proving…
Can the cardinal invariants occurring in the report\textquotesingle s Theorems 1--4 be consistently arranged to have smaller, more accessible values than the values produced by the Boolean-ultrapower constructions?
Can proof-theoretic methods such as the Dialectica interpretation produce new remainder theorems in Tauberian theory, and are there abstract quantitative metatheorems that unify and generalize related Tauberian theorems?
Is the complement of the finite spectrum of every first-order sentence also a finite spectrum? Equivalently, is NE=coNE?
Question 18 (Rojas). Is there a computable bound (in function of f ) on the size of the largest integer solution to f (x, y ) = 0, when there are finitely many solutions? This is already done for genus 1 curves. There exists an algorithm…
Let A and B be complete local Noetherian rings with maximal ideals m and n, respectively, and suppose A/m^r and B/n^r are isomorphic for every natural number r. Must A and B themselves be isomorphic?
The main gap conjecture, e.g. for uncountable first order theories, for AECs, and for ℵ_1-saturated models of a countable theory.
Over RCA_0, is IPT^2_2 equivalent to RT^2_2?
Let d4a9 be the Raisonnier ideal, let d4a1 be the null ideal, and write rm cov(d4a9) and rm cof(d4a1) for their covering and cofinality numbers. Let d53d denote the dominating number. Dualization conjecture. rm cov(d4a9) ≤ rm cof(d4a1).…
Let \mathcal T be the variable-free terms in a binary operation with generator 1, let \phi(1)=0 and \phi(A b B)=\max(\phi(A),f_A(\phi(B))), and let A_{n,p} be the iterated right divisors of the (p+1)st right-associated power of 1 having…