Here's a question from Shelah's book *Classification Theory*. Given an order $I$, we consider cuts of the form $(A,B)$ where for all $a \in A, b \in B$ we have $a < b$ and $A \cup B = I$. The cofinality of a cut $(A,B)$ is the pair $(\lambda, \kappa)$ where $\lambda$ is the cofinality of $A$ and $\kappa$ is the cofinality of $B$ in the reverse order.


The reader is asked to show in Exercise VII.1.7 that given any order $J$ with $|J| \leq \kappa$ there is an order $I$ with $J \subseteq I$ and $|I| = \kappa$ so that if $(A,B)$ is a cut of $I$ then the cofinality of $(A,B)$ is $(\aleph\_{0}, \aleph\_{0})$. In other words, given any order of size at most $\kappa$, it can be expanded to an order of size $\kappa$ so that every cut has countable cofinality. 


Does anyone know how to show this? In the absence of any hypothesis on $\kappa$ it is difficult to see how one could kill off all uncountable cuts in an order of size $\kappa$ without increasing the cardinality. 



Linear orders with only short cuts
I don´t think the statement is true as it is. If $J=\omega\_1+1$ then for any $I \supseteq J$ (of whatever cardinality) you can define a cut as: $x \in A$ iff $x \in I$ and $\exists \alpha \in \omega\_1 (x<\alpha) $ and $B=I \setminus A$. This cut can't have cofinality $(\omega, \omega)$.


