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.
- Great Disdyakis Dodecahedron
- Great Disdyakis Triacontahedron
- Great Ditrigonal Dodecacronic Hexecontahedron
- Great Ditrigonal Dodecicosidodecahedron
- Great Ditrigonal Icosidodecahedron
- Great Dodecacronic Hexecontahedron
- Great Dodecadodecahedron
- Great Dodecahedron
- Great Dodecahedron-Small Stellated Dodecahedron Compound
- Great Dodecahemicosacron
- Great Dodecahemicosahedron
- Great Dodecahemidodecacron
- Great Dodecahemidodecahedron
- Great Dodecicosacron
- Great Dodecicosahedron
- Great Dodecicosidodecahedron
- Greater
- Greater Than/Less Than Symbol
- Greatest Common Denominator
- Greatest Common Divisor
- Greatest Common Divisor Theorem
- Greatest Common Factor
- Greatest Integer Function
- Greatest Lower Bound
- Greatest Prime Factor