# Category:Axiom of choice

Computing portal |

Here is a list of articles in the Axiom of choice category of the Computing portal that unifies foundations of mathematics and computations using computers.

This category is for equivalents of the axiom of choice, and weaker forms of that principle.

## Pages in category "Axiom of choice"

The following 25 pages are in this category, out of 25 total.

- Axiom of choice
*(computing)*

### A

- Amorphous set
*(computing)* - Axiom of countable choice
*(computing)* - Axiom of dependent choice
*(computing)*

### B

- Basis (linear algebra)
*(computing)* - Boolean prime ideal theorem
*(computing)*

### C

- Cartesian product
*(computing)* - Choice function
*(computing)*

### D

- De Bruijn–Erdős theorem (graph theory)
*(computing)* - Diaconescu's theorem
*(computing)*

### E

- Equivalents of the Axiom of Choice
*(computing)*

### G

- Group structure and the axiom of choice
*(computing)*

### H

- Hausdorff maximal principle
*(computing)*

### K

- König's lemma
*(computing)* - Kőnig's lemma
*(computing)* - König's theorem (set theory)
*(computing)*

### N

- Nielsen–Schreier theorem
*(computing)*

### S

- Spanning tree
*(computing)* - Szpilrajn extension theorem
*(computing)*

### T

- Tarski's theorem about choice
*(computing)* - Teichmüller–Tukey lemma
*(computing)* - Tychonoff's theorem
*(computing)*

### U

- Uniformization (set theory)
*(computing)*

### W

- Well-ordering theorem
*(computing)*

### Z

- Zorn's lemma
*(computing)*