# Category:Theorems in the foundations of mathematics

Computing portal |

Here is a list of articles in the category **Theorems in the foundations of mathematics** of the Computing portal that unifies foundations of mathematics and computations using computers. This category includes theorems on the foundational aspects of mathematics, including: mathematical logic, model theory, set theory, some general topology and category theory.

## Pages in category "Theorems in the foundations of mathematics"

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

### B

- Banach–Tarski paradox
*(computing)* - Barwise compactness theorem
*(computing)* - Borel determinacy theorem
*(computing)* - Bourbaki–Witt theorem
*(computing)*

### C

- Cantor's diagonal argument
*(computing)* - Cantor's theorem
*(computing)* - Categorical theory
*(computing)* - Church–Rosser theorem
*(computing)* - Codd's theorem
*(computing)* - Compactness theorem
*(computing)* - Completeness of atomic initial sequents
*(physics)* - Compression theorem
*(computing)* - Conservativity theorem
*(computing)* - Craig's theorem
*(computing)* - Cut-elimination theorem
*(computing)*

### D

- Deduction theorem
*(computing)*

### E

- Easton's theorem
*(computing)* - Extension by new constant and function names
*(computing)*

### F

- Frege's theorem
*(computing)*

### G

- Gödel's speed-up theorem
*(computing)* - Gödel's completeness theorem
*(computing)* - Gödel's incompleteness theorems
*(computing)* - Goodstein's theorem
*(computing)*

### H

- Halpern–Läuchli theorem
*(computing)* - Herbrand's theorem
*(computing)*

### K

- Kanamori–McAloon theorem
*(computing)* - Kleene's recursion theorem
*(computing)* - Knaster–Tarski theorem
*(computing)* - König's theorem (set theory)
*(computing)*

### L

- Lindström's theorem
*(computing)* - Löb's theorem
*(computing)* - Löwenheim–Skolem theorem
*(computing)* - Lusin's separation theorem
*(computing)*

### M

- Morley's categoricity theorem
*(computing)*

### P

- Paris–Harrington theorem
*(computing)* - Post's theorem
*(computing)*

### R

- Rice's theorem
*(computing)* - Rice–Shapiro theorem
*(computing)* - Richardson's theorem
*(computing)* - Robinson's joint consistency theorem
*(computing)*

### S

- Schröder–Bernstein theorem for measurable spaces
*(computing)* - Schröder–Bernstein theorem
*(computing)* - Szpilrajn extension theorem
*(computing)*

### T

- Tarski's theorem about choice
*(computing)* - Tennenbaum's theorem
*(computing)*

### V

- Von Neumann paradox
*(computing)*

### W

- Well-ordering theorem
*(computing)* - Wilkie's theorem
*(computing)*