Recursive Function
A recursive function is a function generated by (1) Addition, (2) Multiplication, (3) selection of an elementfrom a list, and (4) determination of the truth or falsity of the Inequality 
according to the technical rules:
- 1. If
and the sequence of functions 
, ..., 
are recursive, then so is 
). - 2. If is a recursive function such that there is an
for each 
with 
, then the smallest can beobtained recursively.
References
Kleene, S. C. Introduction to Metamathematics. Princeton, NJ: Van Nostrand, 1952.
- Euclidean Space
- Euclid Number
- Euclid's Axioms
- Euclid's Elements
- Euclid's Fifth Postulate
- Euclid's Postulates
- Euclid's Principle
- Euclid's Theorems
- Eudoxus's Kampyle
- Euler Angles
- Euler-Bernoulli Triangle
- Euler Brick
- Euler Chain
- Euler Characteristic
- Euler Constant
- Euler Curvature Formula
- Euler Differential Equation
- Euler Equation
- Euler Formula
- Euler Four-Square Identity
- Euler Graph
- Eulerian Circuit
- Eulerian Cycle
- Eulerian Integral of the First Kind
- Eulerian Integral of the Second Kind