9 problems
Let be a countable theory and let be the associated two-cardinal counting function for infinite cardinals . Adler's counting-spectrum conjec…
Let be a partitioned formula, and let denote the number of pairwise-inconsistent partial -types of size over a parameter set of size …
Let be a partitioned formula. A formula is NTP when it does not have the tree property of the second kind, and it is resilient in the sense used in the paper. ULC…
Let be a henselian valued field of positive characteristic. A valued field is tame if it satisfies the standard tameness conditions for henselian valued fields. NTP2 transf…
Let be a -ring on an algebraically closed field. Wn-ring conjecture. The ring is NTP, and the burden of is at most . The source gives no further context or…
Definable-envelope conjecture. If is nilpotent (respectively, soluble), then there is a definable nilpotent (respectively, soluble) group finitely many of whose translates cove…
Valued-field NTP2 conjecture. Then is (respectively, strong) if and only if is (respectively, strong).
PRC and PpC NTP2 conjecture. A PRC field is if and only if it is bounded. Similarly, a PpC field is if and only if it is bounded.
In a first-order theory , let denote the burden of a tuple , and say that is NTP when it has no inp-pattern of depth in a single vari…