Shelah's consistency conjecture for Specker orders and Aronszajn trees
Statement
Let a Specker order and the orders be as described immediately before the statement. Let be an Aronszajn tree, let , and write for its tree order. Shelah's consistency conjecture. It is consistent that any Specker order contains a suborder as above, and that if are as above, then or have uncountable isomorphic suborders. Equivalently, for every Aronszajn tree and every coloring , there are an uncountable and such that for every distinct , the maximal satisfies .
The source says that the second consistency assertion is proved by a cited construction; the supplied status evidence says the associated claim is resolved by constructing a very special Aronszajn tree.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.