Axiom of countable choice

From Wikipedia, the free encyclopedia

The axiom of countable choice, denoted ACω, or axiom of denumerable choice, is an axiom of set theory, similar to the axiom of choice. It states that any countable collection of non-empty sets must have a choice function. Paul Cohen showed that ACω is not provable in Zermelo-Fraenkel set theory (ZF).

ZF + ACω suffices to prove that the union of countably many countable sets is countable. It also suffices to prove that every infinite set is Dedekind-infinite (and hence has a countably infinite subset). ACω is particularly useful for the development of analysis, where many results depend on having a choice function for a countable set of real numbers (considered as sets of Cauchy sequences of rationals).

ACω is a weak form of the axiom of choice (AC) which states that every collection of non-empty sets must have a choice function. AC clearly implies the axiom of dependent choice (DC), and DC is sufficient to show ACω. However ACω is strictly weaker than DC (and DC is strictly weaker than AC).

This article incorporates material from axiom of countable choice on PlanetMath, which is licensed under the GFDL.

 This mathematical logic-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../a/x/i/Axiom_of_countable_choice.html"
Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.