
The axiom of countable choice or axiom of denumerable choice, denoted ACω, is an axiom of set theory that states that every countable collection of non-empty sets must have a choice function. I.e., given a function A with domain N (where N denotes the set of natural numbers) such that A(n) is a non-empty set for every n ∈ N, then there exists a function f with domain N such that f(n) ∈ A(n) for every n ∈ N.
== Overview ==
The axiom of countable choice (ACω) is strictly weaker than the axiom of dependent choice (DC), (Jech 1973) which in turn is weaker than the axiom of choice (AC). Paul C...