Form equivalence class Howard-Rubin Number:
10
Statement:
\(UT(\aleph_{0},<\aleph_{0},WO)\): Theunion of denumerably many pairwise disjoint finite sets can be well ordered. ([10 A]\(\to\) [10 S] \(to\) 10)
Howard-Rubin number:
10 S
Citations (articles):
Connections (notes):
References (books):
Back