#ordinal_notation
Ordinal notation
Type of mathematical function
In mathematical logic and set theory, an ordinal notation is a partial function mapping the set of all finite sequences of symbols, themselves members of a finite alphabet, to a countable set of ordinals. A Gödel numbering is a function mapping the set of well-formed formulae of some formal language to the natural numbers. This associates each well-formed formula with a unique natural number, called its Gödel number. If a Gödel numbering is fixed, then the subset relation on the ordinals induces an ordering on well-formed formulae which in turn induces a well-ordering on the subset of natural numbers. A recursive ordinal notation must satisfy the following two additional properties:the subset of natural numbers is a recursive set the induced well-ordering on the subset of natural numbers is a recursive relation
Tue 23rd
Provided by Wikipedia
This keyword could refer to multiple things. Here are some suggestions: