3 problems
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…
Definable extension conjecture. The formula extends to an -definable type.
Extensible definability conjecture. There is such that the partial type