Are every set totally ordered in $\sf{NBG}$ or $\sf{SP}$ or $\sf{TG}$ Set Theory?

I have glanced over this post but it the answer dealt mainly with $\sf{ZFA}$ and $\sf{ZFC}$. There was no mention of $\sf{NBG}$, $\sf{SP}$ or $\sf{TG}$. So my question is, can the same claim be proved in the set theories that I have mentioned?

• What is SF/SP here? – Asaf Karagila Dec 14 '15 at 4:24
• @AsafKaragila:Scott-Potter Set Theory. – user 170039 Dec 14 '15 at 5:13
• Thanks unfortunately that Wikipedia article does not include the axiom of SP, but rather ZU. In any case it seems the axiom of choice is not included there in any reasonable way that you can actually prove something like "every set can be linearly ordered". But since I never dabbled with that set theory, I will leave this to someone else to confirm. – Asaf Karagila Dec 14 '15 at 5:19

In the case of $\sf NBG$ many axiomatizations do include at least the axiom of choice for sets, and then every set can be well ordered, so in particular totally ordered. If the axiomatization does not include the axiom of choice, or something which can prove it then the answer is negative of course.
In the case of $\sf TG$ things are simpler since Tarski's axiom implies the axiom of choice already. So again every set is well orderable, so every set can be totally ordered.
• Is it true in $\sf{NF}$ also? – user 170039 Dec 14 '15 at 5:14