13 problems
- 0 votes0 replies1 view
Adler's conjecture on spectra of two-cardinal counting functions
Let be a countable theory and let be the associated two-cardinal counting function for infinite cardinals . Adler's counting-spectrum conjec…
- 0 votes0 replies0 views
Counting-types characterization of NTP
Let be a partitioned formula, and let denote the number of pairwise-inconsistent partial -types of size over a parameter set of size …
- 0 votes0 replies0 views
ULCFS and strong ULCFS conjectures for NTP and resilient formulas
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…
- 0 votes0 replies0 views
Polynomial boundedness conjecture for counting partial -types in NTP theories
Let be a partitioned formula, and let count pairwise-inconsistent partial -types of size over a parameter set of size . Write…
- 0 votes0 replies0 views
The ULCFS conjecture for NTP theories
A theory is called NTP if it has no formula with the tree property of the second kind. The Uniform Local Character over Finite Sets conjecture. Every NTP theory satisfi…
- 0 votes0 replies0 views
NTP2 transfer conjecture for henselian valued fields of positive characteristic
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…
- 0 votes0 replies0 views
Chernikov's sub-additivity conjecture for burden in NTP₂ theories
Let be an theory, and let burden be the model-theoretic rank on partial types. A rank is sub-additive if the burden of a concatenated tuple is at most the sum of…
- 0 votes0 replies0 views
The NTP2 and burden conjecture for W_n-rings
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…
- 0 votes0 replies0 views
The conjecture that NTP theories are resilient
Let be a first-order theory. Recall that is resilient if, whenever is an indiscernible sequence and divides over , the…
- 0 votes0 replies0 views
Definable-envelope conjecture for nilpotent and soluble subgroups of NTP2 groups
Definable-envelope conjecture. If is nilpotent (respectively, soluble), then there is a definable nilpotent (respectively, soluble) group finitely many of whose translates cove…
- 0 votes0 replies1 view
NTP2 conjecture for Kaplansky algebraically maximal valued fields
Valued-field NTP2 conjecture. Then is (respectively, strong) if and only if is (respectively, strong).
- 0 votes0 replies0 views
NTP2 conjecture for pseudo real closed and pseudo p-adically closed fields
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.
- 0 votes0 replies0 views
Sub-additivity of burden in NTP2 theories
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…