The C-sequence number and infinite productivity of the Knaster property
Statement
Let be a regular uncountable cardinal. Write for the C-sequence number of , and call a poset -Knaster if every subset of of cardinality contains a subset of cardinality whose distinct elements are pairwise compatible. Let denote the countable product of . The conjecture. The following are equivalent:
- ;
- for every -Knaster poset , is -Knaster as well.
This conjectures a connection between the C-sequence number and the infinite productivity of the -Knaster property. The statement is presented among questions that remain open.
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.