We have the following indirect implication of form equivalence classes:

391 \(\Rightarrow\) 74
given by the following sequence of implications, with a reference to its direct proof:

Implication Reference
391 \(\Rightarrow\) 112 clear
112 \(\Rightarrow\) 90 Equivalents of the Axiom of Choice II, Rubin/Rubin, 1985, page 79
90 \(\Rightarrow\) 51 Variations of Zorn's lemma, principles of cofinality, and Hausdorff's maximal principle, Part I and II, Harper, J. 1976, Notre Dame J. Formal Logic
51 \(\Rightarrow\) 337 Non-constructive properties of the real numbers, Howard, P. 2001, Math. Logic Quart.
337 \(\Rightarrow\) 92 clear
92 \(\Rightarrow\) 94 clear
94 \(\Rightarrow\) 74 note-10

Here are the links and statements of the form equivalence classes referenced above:

Howard-Rubin Number Statement
391:

\(C(\infty,LO)\): Every set of non-empty linearly orderable sets has a choice function.

112:

\(MC(\infty,LO)\): For every family \(X\) of non-empty sets each of which can be linearly ordered there is a function \(f\) such that for all \(y\in X\), \(f(y)\) is a non-empty finite subset of \(y\).

90:

\(LW\):  Every linearly ordered set can be well ordered. Jech [1973b], p 133.

51:

Cofinality Principle: Every linear ordering has a cofinal sub well ordering.  Sierpi\'nski [1918], p 117.

337:

\(C(WO\), uniformly linearly ordered):  If \(X\) is a well ordered collection of non-empty sets and there is a function \(f\) defined on \(X\) such that for every \(x\in X\), \(f(x)\) is a linear ordering of \(x\), then there is a choice function for \(X\).

92:

\(C(WO,{\Bbb R})\):  Every well ordered family of non-empty subsets of \({\Bbb R}\) has a choice function.

94:

\(C(\aleph_{0},\infty,{\Bbb R})\): Every denumerable family of non-empty sets of reals  has a choice function. Jech [1973b], p 148 prob 10.1.

74:

For every \(A\subseteq\Bbb R\) the following are equivalent:

  1. \(A\) is closed and bounded.
  2. Every sequence \(\{x_{n}\}\subseteq A\) has a convergent subsequence with limit in A.
Jech [1973b], p 21.

Comment:

Back