Form equivalence class Howard-Rubin Number: 10
Statement: \(PUT(\aleph_0,<\aleph_0,WO)\): The union of adenumerable set of pairwise disjoint finite sets has an infinite well ordered subset.([10 A] \(\to\) [10 T] \(\to\) [10 M])
Howard-Rubin number: 10 T
Citations (articles):
Connections (notes):
References (books):
Back