We have the following indirect implication of form equivalence classes:
Here are the links and statements of the form equivalence classes referenced above:
Howard-Rubin Number | Statement |
---|---|
261: | \(Z(TR,T)\): Every transitive relation \((X,R)\) in which every subset which is a tree has an upper bound, has a maximal element. |
256: | \(Z(P,F)\): Every partially ordered set \((X,R)\) in which every forest \(A\) has an upper bound, has a maximal element. |
255: | \(Z(D,R)\): Every directed relation \((P,R)\) in which every ramified subset \(A\) has an upper bound, has a maximal element. |
260: | \(Z(TR\&C,P)\): If \((X,R)\) is a transitive and connected relation in which every partially ordered subset has an upper bound, then \((X,R)\) has a maximal element. |
40: | \(C(WO,\infty)\): Every well orderable set of non-empty sets has a choice function. Moore, G. [1982], p 325. |
43: | \(DC(\omega)\) (DC), Principle of Dependent Choices: If \(S\) is a relation on a non-empty set \(A\) and \((\forall x\in A) (\exists y\in A)(x S y)\) then there is a sequence \(a(0), a(1), a(2), \ldots\) of elements of \(A\) such that \((\forall n\in\omega)(a(n)\mathrel S a(n+1))\). See Tarski [1948], p 96, Levy [1964], p. 136. |
78: | Urysohn's Lemma: If \(A\) and \(B\) are disjoint closed sets in a normal space \(S\), then there is a continuous \(f:S\rightarrow [0,1]\) which is 1 everywhere in \(A\) and 0 everywhere in \(B\). Urysohn [1925], pp 290-292. |
155: | \(LC\): There are no non-trivial Läuchli continua. (A Läuchli continuum is a strongly connected continuum. Continuum \(\equiv\) compact, connected, Hausdorff space; and strongly connected \(\equiv\) every continuous real valued function is constant.) |
Comment: