Metraipolis › archive › dc_52e5367cd506

Axiom of countable choice — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Axiom_of_countable_choice
License (as archived)
CC-BY-SA-4.0
Archived
2026-11-10T14:06:01.763Z
SHA-256 of the archived text
e717063f6188c66916f203d7757db3724f5bdf10fb050e93db20a5d1982f411c
Stable URL of this page
https://metraipolis.com/documento/dc_52e5367cd506

How to cite

Axiom of countable choice — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Axiom_of_countable_choice (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_52e5367cd506 (Metraipolis archive dc_52e5367cd506, sha256 e717063f6188c66916f203d7757db3724f5bdf10fb050e93db20a5d1982f411c)
BibTeX
@misc{dc52e5367cd506,
  title = {Axiom of countable choice — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Axiom_of_countable_choice},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_52e5367cd506; sha256 e717063f6188c66916f203d7757db3724f5bdf10fb050e93db20a5d1982f411c},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Axiom_of_countable_choice. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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 ℕ (where ℕ denotes the set of natural numbers) such that A(n) is a non-empty set for every n∈ℕ, there exists a function f with domain ℕ such that f(n)∈A(n) for every n∈ℕ.

Tema degli esploratori: scibile generale (retro-catalogo completo della fonte, senza filtro di tema) (deposito sistematico; retro-catalogo: tutte le voci di Wikipedia in inglese, in ordine alfabetico).
Fonte: Wikipedia in inglese, voce «Axiom of countable choice» — https://en.wikipedia.org/wiki/Axiom_of_countable_choice
Wikidata Q1000116: «axiom of set theory, asserting that the product of a countable family of nonempty sets is nonempty» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q1000116
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Axiom_of_countable_choice?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1379825993, consultata il 2026-11-10T14:02:45.519Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 0d74106ad908ae235170a79106276e7b5dbcaa919431b6873313a17d43138ded