axiom of countable choice

The axiom of countable choice or axiom of denumerable choice is an axiom of set theory similar to the axiom of choice. It states that a countable collection of sets must have a choice function. Paul Cohen showed that this is not provable in ZF. This axiom is required for the development of analysis; in particular, many results depend on having a choice function for a countable set of real numbers (considered as sets of Cauchy sequences of rationals). The axiom of choice clearly implies the axiom of dependent choice, and the axiom of dependent choice is sufficient to show the axiom of countable choice. The axiom of countable choice is strictly weaker than each of these axioms.

<< Previous

Word Browser

Next >>

john fitzalan, 6th earl of arundel
buckingham (disambiguation)
richard fitzalan, 8th earl of arundel
mike krzyzewski
willy ley
cliff johnson
ustad alla rakha
spx
meridiani planum
spirit rover
lola corwin

opportunity rover
the kumars at no. 42
maumee bay
apple x11
line doubler
prenex normal form
thrinicia
apple public source license
robert fitzgerald
skolem normal form
delta force (computer game)

rockefeller commission
medallions
archibald sinclair, 1st viscount thurso
paraconsistent logic
lee byung chul
kim yong san
new zealand democratic party
deep image
shannon smith
the horse and his boy
shoulder launched missile weapon

evelyn keyes
committee for a marxist international
keep left
norbert elias
maximus of tyre
shoulder launched multipurpose assault weapon
coulomb barrier
jerome rothenberg
cob (building)
freedom socialist party
giambattista della porta