# Category:Axioms of set theory

Here is a list of articles in the category **Axioms of set theory** of the Computing portal that unifies foundations of mathematics and computations using computers. This category is for axioms in the *language of set theory*; roughly speaking, ones that "talk about sets". Inclusion in this category does not necessarily imply that the axiom in question is an accepted axiom, or that it is believed to be true in the von Neumann universe of sets.

## Pages in category "Axioms of set theory"

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

### A

- Aczel's anti-foundation axiom
*(computing)* - AD+
*(computing)* - Axiom of adjunction
*(computing)* - Axiom of constructibility
*(computing)* - Axiom of determinacy
*(computing)* - Axiom of empty set
*(computing)* - Axiom of extensionality
*(computing)* - Axiom of finite choice
*(computing)* - Axiom of global choice
*(computing)* - Axiom of infinity
*(computing)* - Axiom of limitation of size
*(computing)* - Axiom of non-choice
*(computing)* - Axiom of pairing
*(computing)* - Axiom of power set
*(computing)* - Axiom of projective determinacy
*(computing)* - Axiom of real determinacy
*(computing)* - Axiom of regularity
*(computing)* - Axiom of union
*(computing)* - Axiom schema of predicative separation
*(computing)* - Axiom schema of replacement
*(computing)* - Axiom schema of specification
*(computing)*

### B

- Baumgartner's axiom
*(computing)*

### F

- Freiling's axiom of symmetry
*(computing)*

### G

- Ground axiom
*(computing)*

### L

- Large cardinal
*(computing)*

### M

- Martin's axiom
*(computing)* - Moschovakis coding lemma
*(computing)*

### O

- Open coloring axiom
*(computing)*

### P

- Proper forcing axiom
*(computing)*

### W

- Well-ordering theorem
*(computing)* - Wholeness axiom
*(computing)*