If \(\{f_i: i\in I\}\) is a family of functions such that for each \(i\in I\), \(f_i\subseteq E\times W\), where \(E\) and \(W\) are non-empty sets, and \(\cal B\) is a filter base on \(I\) such that

1. For all \(B\in\cal B\) and all finite \(F\subseteq E\) there is an \(i\in I\) such that \(f_i\) is defined on \(F\), and
2. For all \(B \in\cal B\) and all finite \(F\subseteq E\) there exist at most finitely many functions on \(F\) which are restrictions of the functions \(f_i\) with \(i\in I\),  

\(C(\infty,< \aleph_{0})\):  Every set of non-empty finite  sets  has  a choice function.

\((\forall n\in\omega, n\ge 2\))\((C(\infty,n))\): For each \(n\in\omega\), \(n\ge 2\), every set of \(n\) element  sets has a choice function.

  \(C(\infty ,2)\):  Every family of pairs has a choice function.

Let \(\Omega\) be the set of all (undirected) infinite cycles of reals (Graphs whose vertices are real numbers, connected, no loops and each vertex adjacent to  exactly two others). Then there is a function \(f\) on \(\Omega \) such that for all \(s\in\Omega\), \(f(s)\) is a direction along \(s\).