Form Classes

Form equivalence class Howard-Rubin Number: 0

Statement:

The number of well ordered subsets of a set:

 For all \(x\), \(|x| < |s(x)|\) where \(s(x) = \{\, y \subseteq x : y\) can be well ordered \(\}\).  

Howard-Rubin number: 0 AE

Citations (articles): Tarski [1939] On well-ordered subsets of any set

Connections (notes):

References (books):

Back