[FOM] Order types: a proof

[Hendrik Boom]

On Mon, Mar 07, 2005 at 11:31:22AM +0100, Jeremy Clark wrote:
> 
> Or you can construct (choiceless) Brouwerian counterexamples to your 
> theorem (trivial ones: subsets of a singleton set, for example, which 
> cannot be shown to be either empty or non-empty: such a set, trivially 
> ordered, would be a counter-example to your theorem), but I don't think 
> that is what you are asking for.

It would be a counterexample if it were possible to show that it not one
of the 11 known solutions.  But you can't show it differs from the empty
solution.

-- hendrik