Recursion
See the entry on recursion for more details.
Recursion occurs when something refers to itself in its own definition.
In computing, a recursive algorithm calls itself on progressively simpler inputs until a base case can be reached.
The strength of recursion is that it allows many complex structures to be represented concisely. However, when used improperly, recursion can cause infinite loops or other undefined behavior, so watch out for that!
Logic & Proofs
Integer •
Rational number •
Inequality •
Real number •
Theorem •
Proof •
Statement •
Proof by exhaustion •
Universal generalization •
Counterexample •
Existence proof •
Existential instantiation •
Axiom •
Logic •
Truth •
Proposition •
Compound proposition •
Logical operation •
Logical equivalence •
Tautology •
Contradiction •
Logic law •
Predicate •
Domain •
Quantifier •
Argument •
Rule of inference •
Logical proof •
Direct proof •
Proof by contrapositive •
Irrational number •
Proof by contradiction •
Proof by cases •
Summation •
Disjunctive normal form
Set Theory
Set •
Element •
Empty set •
Universal set •
Subset •
Power set •
Cartesian product •
String •
Binary string •
Empty string •
Set operation •
Set identity •
Set proof
Functions
Algorithms
Relations
Number Theory
Induction
Combinatorics
Graph Theory
Graph •
Walk •
Subgraph •
Regular graph •
Complete graph •
Empty graph •
Cycle graph •
Hypercube graph •
Bipartite graph •
Component •
Eulerian circuit •
Eulerian trail •
Hamiltonian cycle •
Hamiltonian path •
Tree •
Huffman tree •
Substring •
Forest •
Path graph •
Star •
Spanning tree •
Weighted graph •
Minimum spanning tree •
Greedy algorithm •
Prim's algorithm
Recursion