ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let MA(sigma-centered)\mathsf{MA}(sigma\text{-centered}) hold, and let (P,<)(P,<) be a partial order of size at most 2c2^{\mathfrak{c}} such that every pinPp\text{in}P has at most c\mathfrak{c} many predecessors. Working hypothesis. The partial order PP embeds into the Rudin–Keisler ordering of P-point ultrafilters. The statement is presented as a working hypothesis motivated by the known cardinality restrictions on the ordering of P-points; the text says that a stronger version asks for embeddings into both the Rudin–Keisler and Tukey orderings, and attributes this formulation in question form to Raghavan and Shelah.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.