Axiom of countable choice
From Wikipedia, the free encyclopedia
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. That is, 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, there exists a function f with domain N such that f(n) ∈ A(n) for every n ∈ N.
This article needs editing to comply with Wikipedia's Manual of Style. In particular, it has problems with MOS:MATHSPECIAL for U+005C. (April 2024) |