Question. Is there a decent classification theorem for linear orders satisfying all three of:
Dense. Given a pair of elements $y,x$ with $y>x$, there exists $k$ satisfying $y>k>x$.
Complete. Given a non-empty subset $A$, if $A$ is bounded above, then $A$ has a least upper bound.
Endless. There is neither a greatest element nor a least element.