5 problems
Definable-basis conjecture. If admits a gt-henselian topology with a basis consisting of definable sets, then the -topology is a field topology.
Let be the reals at definability level , let , and let and…
Let be a non-big field, meaning an algebraic extension of that is not big, and let denote the ring constructed from the unit group of . Triviality conject…
Recursive definability conjecture. There are formulas , , and , depending recursively on and ,…
Finite-pattern definability conjecture. There is a finite set of formulas such that, for every and , if