# Category:Mathematical proofs

Computing portal |

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

This category includes articles on basic topics related to mathematical proofs, including terminology and proof techniques.

Related categories:

- Pages which contain theorems and their proofs should be placed in the subcategory Category:Articles containing proofs.
- Articles related to automatic theorem proving should be placed in Category:Automated theorem proving.

See Wikipedia:WikiProject Mathematics/Proofs for additional discussion.

## Subcategories

This category has the following 3 subcategories, out of 3 total.

### A

### P

## Pages in category "Mathematical proofs"

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

- Mathematical proof
*(computing)*

### *

- Rigour
*(computing)*

### B

- Back-and-forth method
*(computing)* - Bijective proof
*(computing)*

### C

- Cantor's diagonal argument
*(computing)* - Combinatorial proof
*(computing)* - Commutative diagram
*(computing)* - Conditional proof
*(computing)* - Constructive proof
*(computing)*

### D

- Direct proof
*(computing)* - Double counting (proof technique)
*(computing)*

### E

- Elementary proof
*(computing)*

### I

- Proof by infinite descent
*(computing)*

### L

- Law of large numbers
*(computing)* - List of long mathematical proofs
*(computing)* - List of mathematical proofs
*(computing)* - List of probabilistic proofs of non-probabilistic theorems
*(computing)*

### M

- Minimal counterexample
*(computing)*

### N

- Non-surveyable proof
*(computing)*

### O

- Of the form
*(computing)* - Original proof of Gödel's completeness theorem
*(computing)*

### P

- Probabilistic method
*(computing)* - Probabilistically checkable proof
*(computing)* - Proof by contradiction
*(computing)* - Proof by contrapositive
*(computing)* - Proof by exhaustion
*(computing)* - Proof by intimidation
*(computing)* - Proof of impossibility
*(computing)* - Proof sketch for Gödel's first incompleteness theorem
*(computing)* - Proof without words
*(computing)* - Proofs from THE BOOK
*(computing)* - Proofs of elementary ring properties
*(computing)* - Proofs That Really Count
*(computing)*

### Q

- Q.E.D.
*(computing)*

### S

- Structural induction
*(computing)*

### T

- Theorem
*(computing)* - Tombstone (typography)
*(computing)* - Turing's proof
*(computing)*

### W

- Wiles's proof of Fermat's Last Theorem
*(computing)*