Mathematics Problem Archive
Showing 1-20 of 20 problems
Automorphism Problem for the Turing Degrees
v1.3 research notesDetermine the automorphism group of the partial order of Turing degrees....
Martin's Conjecture on Natural Functions of Turing Degrees
v1.3 research notesClassify reasonable increasing functions on the Turing degrees; Martin's conjecture predicts that they are essentially iterates of the Turing jump....
Increasing Polarized Ramsey Theorem
v1.3 research notesOver $\mathsf{RCA}_0$, is $\mathsf{IPT}^2_2$ equivalent to $\mathsf{RT}^2_2$?...
Reverse-Mathematical Strength of Hindman's Theorem
v1.3 research notesOver $\mathsf{RCA}_0$, is Hindman's theorem equivalent to $\mathsf{ACA}^+_0$, equivalent to $\mathsf{ACA}_0$, or strictly between them?...
Strength of the Dual Ramsey Theorem
v1.3 research notesDetermine the reverse-mathematical strength of the dual Ramsey theorem $\mathsf{DRT}^k$....
Strength of the Carlson–Simpson Lemma
v1.3 research notesDetermine the reverse-mathematical strength of the Carlson–Simpson infinite-variable-word lemma $\mathsf{CS}$....
Lebesgue Differentiation and Weak Weak König's Lemma
v1.3 research notesOver $\mathsf{RCA}_0$, does the Lebesgue differentiation theorem imply $\mathsf{WWKL}_0$?...
Strength of the Auslander–Ellis Theorem
v1.3 research notesOver $\mathsf{RCA}_0$, is the Auslander–Ellis theorem equivalent to $\mathsf{ACA}_0$?...
Well-Ordered Linearizations
v1.3 research notesOver $\mathsf{RCA}_0$, is $\mathsf{EXT}(\omega^*)$ — the assertion that every well-founded partial order has a well-ordered linearization — equivalent...
Reverse Mathematics of Fraïssé's Conjecture
v1.3 research notesOver $\mathsf{RCA}_0$, is Fraïssé's conjecture for countable linear orders equivalent to $\mathsf{ATR}_0$?...
Three-Element Better-Quasi-Order
v1.3 research notesIs there a subsystem weaker than $\mathsf{ATR}_0$ that proves that the three-element antichain is a better-quasi-order?...
Ramsey's Theorem for Triples over a Weak Base
v1.3 research notesOver $\mathsf{RCA}^*_0$, is Ramsey's theorem for triples equivalent to $\mathsf{ACA}_0$, as it is over $\mathsf{RCA}_0$?...
The main gap conjecture, e.g. for uncountable first order theories, for AECs, and for $\aleph_1$-saturated models of a countable theory
v1.3 research notesThe main gap conjecture, e.g. for uncountable first order theories, for AECs, and for $\aleph_1$-saturated models of a countable theory....
Shelah's categoricity conjecture for $L_{\omega_1,\omega}$
v1.3 research notesShelah's categoricity conjecture for $L_{\omega_1,\omega}$: If a sentence is categorical above the Hanf number then it is categorical in all cardinals...
Shelah's eventual categoricity conjecture
v1.3 research notesShelah's eventual categoricity conjecture: For every cardinal $\lambda$ there exists a cardinal $\mu(\lambda)$ such that if an AEC K with LS(K)${} \le...
Does every simple first-order theory have stable forking
v1.3 research notesDoes every simple first-order theory have stable forking?...
The universality problem for C-free graphs
v1.3 research notesThe 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 ...
Wikipedia model theory and formal languages item 14: Assume K is the class of models of a countable first order theory omitting countably many types…
v1.3 research notesAssume K is the class of models of a countable first order theory omitting countably many types. If K has a model of cardinality $\aleph_{\omega_1}$ d...
If the class of atomic models of a complete first order theory is categorical in the $\aleph_n$, is it categorical in every cardinal
v1.3 research notesIf the class of atomic models of a complete first order theory is categorical in the $\aleph_n$, is it categorical in every cardinal?...
Is the Borel monadic theory of the real order (BMTO) decidable? Is the monadic theory of well-ordering (MTWO) consistently decidable
v1.3 research notesIs the Borel monadic theory of the real order (BMTO) decidable? Is the monadic theory of well-ordering (MTWO) consistently decidable?...